File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Generalized load sharing for packet-switching networks

TitleGeneralized load sharing for packet-switching networks
Authors
KeywordsComputers
Computer networks
Issue Date2000
PublisherIEEE.
Citation
International Conference On Network Protocols, 2000, p. 305-314 How to Cite?
AbstractIn this paper, we propose a framework to study how to effectively perform load sharing 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 weighted fair routing (WFR), has been developed at two different granularity level, namely, the packet level, and the call level, to approximate GLS with the given routing weight vector. The packet-by-packet WFR (PWFR) mimics GLS by transmitting each packet as a whole, whereas the call-by-call WFR (CWFR) imitates GLS so that all packets belonging to a single flow are sent on the same path. 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 WFR outperforms two other traffic splitting algorithms, namely, generalized round robin routing (GRR), and probabilistic routing (PRR). These promising results form a basis for designing future adaptive constraint-based multipath routing protocols.
Persistent Identifierhttp://hdl.handle.net/10722/46247
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLeung, KaCheongen_HK
dc.contributor.authorLi, Victor OKen_HK
dc.date.accessioned2007-10-30T06:45:41Z-
dc.date.available2007-10-30T06:45:41Z-
dc.date.issued2000en_HK
dc.identifier.citationInternational Conference On Network Protocols, 2000, p. 305-314en_HK
dc.identifier.issn1092-1648en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46247-
dc.description.abstractIn this paper, we propose a framework to study how to effectively perform load sharing 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 weighted fair routing (WFR), has been developed at two different granularity level, namely, the packet level, and the call level, to approximate GLS with the given routing weight vector. The packet-by-packet WFR (PWFR) mimics GLS by transmitting each packet as a whole, whereas the call-by-call WFR (CWFR) imitates GLS so that all packets belonging to a single flow are sent on the same path. 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 WFR outperforms two other traffic splitting algorithms, namely, generalized round robin routing (GRR), and probabilistic routing (PRR). These promising results form a basis for designing future adaptive constraint-based multipath routing protocols.en_HK
dc.format.extent998224 bytes-
dc.format.extent4152649 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference on Network Protocolsen_HK
dc.rights©2000 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.subjectComputersen_HK
dc.subjectComputer networksen_HK
dc.titleGeneralized load sharing for packet-switching networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1092-1648&volume=&spage=305&epage=314&date=2000&atitle=Generalized+load+sharing+for+packet-switching+networksen_HK
dc.identifier.emailLeung, KaCheong:kcleung@eee.hku.hken_HK
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_HK
dc.identifier.authorityLeung, KaCheong=rp00147en_HK
dc.identifier.authorityLi, Victor OK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICNP.2000.896314en_HK
dc.identifier.scopuseid_2-s2.0-0034514645en_HK
dc.identifier.hkuros59995-
dc.identifier.spage305en_HK
dc.identifier.epage314en_HK
dc.identifier.scopusauthoridLeung, KaCheong=7401860663en_HK
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats