File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Generalized load sharing for packet-switching networks I: Theory and packet-based algorithm

TitleGeneralized load sharing for packet-switching networks I: Theory and packet-based algorithm
Authors
KeywordsComputer communications
Dispersity routing
High speed networks
Inverse multiplexing
Load sharing
Multipath routing
Multiprotocol label switching
Network striping
Performance modeling
Traffic dispersion
Traffic engineering
Issue Date2006
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2006, v. 17 n. 7, p. 694-702 How to Cite?
AbstractIn this paper, we propose a framework to study how to effectively perform loadsharing in multipath communication networks. A generalized load sharing (GLS) model has been developed to conceptualize how traffic is split ideally on a set of active paths. A simple traffic splitting algorithm, called packet-by-packet weighted fair routing (PWFR), has been developed to approximate GLS with the given routing weight vector by transmitting each packet as a whole. We have developed some performance bounds for PWFR and found that PWFR is a deterministically fair traffic splitting algorithm. This attractive property is useful in the provision of service with guaranteed performance when multiple paths can be used simultaneously to transmit packets which belong to the same flow. Our simulation studies, based on a collection of Internet backbone traces, reveal that PWFR outperforms two other traffic splitting algorithms, namely, packet-by-packet generalized round robin routing (PGRR), and packet-by-packet probabilistic routing (PPRR). © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/44787
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-10-30T06:10:13Z-
dc.date.available2007-10-30T06:10:13Z-
dc.date.issued2006en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2006, v. 17 n. 7, p. 694-702en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44787-
dc.description.abstractIn this paper, we propose a framework to study how to effectively perform loadsharing in multipath communication networks. A generalized load sharing (GLS) model has been developed to conceptualize how traffic is split ideally on a set of active paths. A simple traffic splitting algorithm, called packet-by-packet weighted fair routing (PWFR), has been developed to approximate GLS with the given routing weight vector by transmitting each packet as a whole. We have developed some performance bounds for PWFR and found that PWFR is a deterministically fair traffic splitting algorithm. This attractive property is useful in the provision of service with guaranteed performance when multiple paths can be used simultaneously to transmit packets which belong to the same flow. Our simulation studies, based on a collection of Internet backbone traces, reveal that PWFR outperforms two other traffic splitting algorithms, namely, packet-by-packet generalized round robin routing (PGRR), and packet-by-packet probabilistic routing (PPRR). © 2006 IEEE.en_HK
dc.format.extent2099829 bytes-
dc.format.extent1810 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rights©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectComputer communicationsen_HK
dc.subjectDispersity routingen_HK
dc.subjectHigh speed networksen_HK
dc.subjectInverse multiplexingen_HK
dc.subjectLoad sharingen_HK
dc.subjectMultipath routingen_HK
dc.subjectMultiprotocol label switchingen_HK
dc.subjectNetwork stripingen_HK
dc.subjectPerformance modelingen_HK
dc.subjectTraffic dispersionen_HK
dc.subjectTraffic engineeringen_HK
dc.titleGeneralized load sharing for packet-switching networks I: Theory and packet-based algorithmen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=17&issue=7&spage=694&epage=702&date=2006&atitle=Generalized+load+sharing+for+packet-switching+networks.+I.+Theory+and+packet-based+algorithmen_HK
dc.identifier.emailLeung, KC:kcleung@eee.hku.hken_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLeung, KC=rp00147en_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TPDS.2006.90en_HK
dc.identifier.scopuseid_2-s2.0-33745728955en_HK
dc.identifier.hkuros144872-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33745728955&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume17en_HK
dc.identifier.issue7en_HK
dc.identifier.spage694en_HK
dc.identifier.epage702en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLeung, KC=7401860663en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats