Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10340103 | Computer Networks | 2005 | 11 Pages |
Abstract
To 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Tat Wing Chim, Kwan L. Yeung, King-Shan Lui,