Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.comnet.2005.01.011 | Computer Networks: The International Journal of Computer and Telecommunications Networking |
Keywords | DocType | Volume |
Traffic engineering,Traffic splitting,ECMPs,Packet reordering,Load balancing | Journal | 49 |
Issue | ISSN | Citations |
4 | 1389-1286 | 9 |
PageRank | References | Authors |
0.70 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tat Wing Chim | 1 | 79 | 6.70 |
| K. L. Yeung | 2 | 370 | 52.12 |
| King-Shan Lui | 3 | 294 | 26.21 |