File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Traffic distribution over equal-cost-multi-paths

TitleTraffic distribution over equal-cost-multi-paths
Authors
KeywordsEcmps
Load Balancing
Packet Reordering
Traffic Engineering
Traffic Splitting
Issue Date2005
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comnet
Citation
Computer Networks, 2005, v. 49 n. 4, p. 465-475 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 less severe. Simulations show that THR provides close-to-optimal load balancing performance but suffers about 5% of packets arrived out-of-order. Although additional traffic monitoring function is needed by THR, we show that the extra complexity incurred is marginal. © 2005 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/155286
ISSN
2015 Impact Factor: 1.446
2015 SCImago Journal Rankings: 0.755
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChim, TWen_US
dc.contributor.authorYeung, KLen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T08:32:43Z-
dc.date.available2012-08-08T08:32:43Z-
dc.date.issued2005en_US
dc.identifier.citationComputer Networks, 2005, v. 49 n. 4, p. 465-475en_US
dc.identifier.issn1389-1286en_US
dc.identifier.urihttp://hdl.handle.net/10722/155286-
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 less severe. Simulations show that THR provides close-to-optimal load balancing performance but suffers about 5% of packets arrived out-of-order. Although additional traffic monitoring function is needed by THR, we show that the extra complexity incurred is marginal. © 2005 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comneten_US
dc.relation.ispartofComputer Networksen_US
dc.subjectEcmpsen_US
dc.subjectLoad Balancingen_US
dc.subjectPacket Reorderingen_US
dc.subjectTraffic Engineeringen_US
dc.subjectTraffic Splittingen_US
dc.titleTraffic distribution over equal-cost-multi-pathsen_US
dc.typeArticleen_US
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityYeung, KL=rp00204en_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.comnet.2005.01.011en_US
dc.identifier.scopuseid_2-s2.0-24344488423en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-24344488423&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume49en_US
dc.identifier.issue4en_US
dc.identifier.spage465en_US
dc.identifier.epage475en_US
dc.identifier.isiWOS:000232098800001-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridChim, TW=6507501073en_US
dc.identifier.scopusauthoridYeung, KL=7202424908en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats