File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Flow assignment and packet scheduling for multipath networks

TitleFlow assignment and packet scheduling for multipath networks
Authors
KeywordsCommunications
Issue Date1999
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308
Citation
The 1999 IEEE Global Telecommunications Conference, Rio de Janeireo, Brazil, 5-9 December 1999. In Globecom. IEEE Global Telecommunications Conference & Exhibition Conference Record, 1999, v. 1 pt. A, p. 246-250 How to Cite?
AbstractIn this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. We consider a multiple-node M/M/1 tandem network with a delay line as the path model. When end-to-end path delays are all Gaussian distributed, our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.
Persistent Identifierhttp://hdl.handle.net/10722/46159
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-10-30T06:43:46Z-
dc.date.available2007-10-30T06:43:46Z-
dc.date.issued1999en_HK
dc.identifier.citationThe 1999 IEEE Global Telecommunications Conference, Rio de Janeireo, Brazil, 5-9 December 1999. In Globecom. IEEE Global Telecommunications Conference & Exhibition Conference Record, 1999, v. 1 pt. A, p. 246-250en_HK
dc.identifier.issn1054-5921en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46159-
dc.description.abstractIn this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. We consider a multiple-node M/M/1 tandem network with a delay line as the path model. When end-to-end path delays are all Gaussian distributed, our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308en_HK
dc.relation.ispartofGlobecom. IEEE Global Telecommunications Conference & Exhibition Conference Record-
dc.rights©1999 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.subjectCommunicationsen_HK
dc.titleFlow assignment and packet scheduling for multipath networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1054-5921&volume=1&issue=pt A&spage=246&epage=250&date=1999&atitle=Flow+assignment+and+packet+scheduling+for+multipath+networksen_HK
dc.identifier.emailLeung, KC: kcleung@eee.hku.hk-
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLeung, KC=rp00147-
dc.identifier.authorityLi, VOK=rp00150-
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/GLOCOM.1999.831643en_HK
dc.identifier.scopuseid_2-s2.0-0033294591-
dc.identifier.hkuros50176-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033294591&selection=ref&src=s&origin=recordpage-
dc.identifier.volume1-
dc.identifier.issuept. A-
dc.identifier.spage246-
dc.identifier.epage250-
dc.identifier.scopusauthoridLeung, KaCheong=7401860663-
dc.identifier.scopusauthoridLi, Victor OK=7202621685-
dc.customcontrol.immutablesml 160113 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats