File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Traffic distribution over equal-cost-multi-paths

TitleTraffic distribution over equal-cost-multi-paths
Authors
KeywordsECMPs
Packet Reordering
Traffic splitting
Issue Date2004
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2004, v. 2, p. 1207-1211 How to Cite?
AbstractTo effectively manage the traffic distribution inside a network, traffic splitting is needed for load sharing over a set of equal-cost-multi-paths (ECMPs). In this paper, a new traffic splitting algorithm, called Table-based Hashing with Reassignments (THR), is proposed. Based on the load sharing statistics collected, THR selectively reassigns some active flows from the over-utilized paths to under-utilized paths. The reassignment process takes place in such a way that the packet out-of-order problem is minimized. As compared with the existing traffic splitting algorithms, THR provides close-to-optimal load balancing performance, less than 2% of packets arrived out-of-order, and a very small end-to-end packet delay performance. Although additional traffic monitoring function is needed by THR, we show that the extra complexity incurred is marginal.
Persistent Identifierhttp://hdl.handle.net/10722/46457
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChim, TWen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:50:16Z-
dc.date.available2007-10-30T06:50:16Z-
dc.date.issued2004en_HK
dc.identifier.citationIeee International Conference On Communications, 2004, v. 2, p. 1207-1211en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46457-
dc.description.abstractTo effectively manage the traffic distribution inside a network, traffic splitting is needed for load sharing over a set of equal-cost-multi-paths (ECMPs). In this paper, a new traffic splitting algorithm, called Table-based Hashing with Reassignments (THR), is proposed. Based on the load sharing statistics collected, THR selectively reassigns some active flows from the over-utilized paths to under-utilized paths. The reassignment process takes place in such a way that the packet out-of-order problem is minimized. As compared with the existing traffic splitting algorithms, THR provides close-to-optimal load balancing performance, less than 2% of packets arrived out-of-order, and a very small end-to-end packet delay performance. Although additional traffic monitoring function is needed by THR, we show that the extra complexity incurred is marginal.en_HK
dc.format.extent394122 bytes-
dc.format.extent519608 bytes-
dc.format.extent8014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rights©2004 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.subjectECMPsen_HK
dc.subjectPacket Reorderingen_HK
dc.subjectTraffic splittingen_HK
dc.titleTraffic distribution over equal-cost-multi-pathsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=2&spage=1207&epage=1211&date=2004&atitle=Traffic+Distribution+over+Equal-Cost-Multi-Pathsen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-4143107047en_HK
dc.identifier.hkuros90910-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4143107047&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2en_HK
dc.identifier.spage1207en_HK
dc.identifier.epage1211en_HK
dc.identifier.scopusauthoridChim, TW=6507501073en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats