File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Flow assignment and packet scheduling for multipath routing

TitleFlow assignment and packet scheduling for multipath routing
Authors
KeywordsComputer communications
Dispersity routing
Flow assignment
High speed networks
Multipath routing
Packet scheduling
Performance modeling
Resequencing
Traffic dispersion
Traffic engineering
Issue Date2003
PublisherKorean Institute of Communication Sciences. The Journal's web site is located at http://jcn.kics.or.kr
Citation
Journal Of Communications And Networks, 2003, v. 5 n. 3, p. 230-239 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. To illustrate our model, and without loss of generality, Gaussian distributed end-toend path delays are used. 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/73808
ISSN
2015 Impact Factor: 0.92
2015 SCImago Journal Rankings: 0.608
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KCen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2010-09-06T06:54:57Z-
dc.date.available2010-09-06T06:54:57Z-
dc.date.issued2003en_HK
dc.identifier.citationJournal Of Communications And Networks, 2003, v. 5 n. 3, p. 230-239en_HK
dc.identifier.issn1229-2370en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73808-
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. To illustrate our model, and without loss of generality, Gaussian distributed end-toend path delays are used. 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.publisherKorean Institute of Communication Sciences. The Journal's web site is located at http://jcn.kics.or.kren_HK
dc.relation.ispartofJournal of Communications and Networksen_HK
dc.subjectComputer communicationsen_HK
dc.subjectDispersity routingen_HK
dc.subjectFlow assignmenten_HK
dc.subjectHigh speed networksen_HK
dc.subjectMultipath routingen_HK
dc.subjectPacket schedulingen_HK
dc.subjectPerformance modelingen_HK
dc.subjectResequencingen_HK
dc.subjectTraffic dispersionen_HK
dc.subjectTraffic engineeringen_HK
dc.titleFlow assignment and packet scheduling for multipath routingen_HK
dc.typeArticleen_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.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-10844279221en_HK
dc.identifier.hkuros92174en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-10844279221&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume5en_HK
dc.identifier.issue3en_HK
dc.identifier.spage230en_HK
dc.identifier.epage239en_HK
dc.publisher.placeKorea, Republic ofen_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