File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Lookahead algorithm for node placement optimization in ShuffleNets

TitleLookahead algorithm for node placement optimization in ShuffleNets
Authors
Wong, HLTYeung, KL
KeywordsMultihop Wdm Network
Node Placement Problem
Shufflenet
Issue Date2000
PublisherInstitute of Electronics, Information and Communication Engineers (Denshi Jouhou Tsuushin Gakkai). The Journal's web site is located at http://search.ieice.org/bin/index.php?category=B&lang=E&curr=1
Citation
IEICE Transactions On Communications, 2000, v. E83-B n. 7, p. 1527-1533 How to Cite?
AbstractNode placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance hd is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the hd obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.
Persistent Identifierhttp://hdl.handle.net/10722/155129
ISSN
0916-8516
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.246
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorWong, HLTen_US
dc.contributor.authorYeung, KLen_US
dc.date.accessioned2012-08-08T08:31:59Z-
dc.date.available2012-08-08T08:31:59Z-
dc.date.issued2000en_US
dc.identifier.citationIEICE Transactions On Communications, 2000, v. E83-B n. 7, p. 1527-1533en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/10722/155129-
dc.description.abstractNode placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance hd is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the hd obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.en_US
dc.languageengen_US
dc.publisherInstitute of Electronics, Information and Communication Engineers (Denshi Jouhou Tsuushin Gakkai). The Journal's web site is located at http://search.ieice.org/bin/index.php?category=B&lang=E&curr=1en_US
dc.relation.ispartofIEICE Transactions on Communicationsen_US
dc.subjectMultihop Wdm Networken_US
dc.subjectNode Placement Problemen_US
dc.subjectShuffleneten_US
dc.titleLookahead algorithm for node placement optimization in ShuffleNetsen_US
dc.typeArticleen_US
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_US
dc.identifier.authorityYeung, KL=rp00204en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0034224838en_US
dc.identifier.hkuros61622-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034224838&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volumeE83-Ben_US
dc.identifier.issue7en_US
dc.identifier.spage1527en_US
dc.identifier.epage1533en_US
dc.publisher.placeJapanen_US
dc.identifier.scopusauthoridWong, HLT=7402864464en_US
dc.identifier.scopusauthoridYeung, KL=7202424908en_US
dc.identifier.issnl0916-8516-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats