Traffic Splitting over ECMPs using ACC Scheme

In order to reduce network congestion, when equal-cost-multi-paths (ECMPs) are between a forwarding node and a destination subnet, traffic should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called ARC-based caching with counting (ACC) is proposed. Packet length differentiation is considered to achieve load balance. UDP packets are only concerned to achieve load balance. Furthermore, flow access recency and frequency are considered when redirecting a flow to a new path. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 1% of packets are out of order.

[1]  Wei Lin,et al.  Traffic Distribution over Equal-Cost-Multi-Paths using LRU-based Caching with Counting Scheme , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[2]  Liang Zhi An IP Lookup Scheme Supporting Routing Compaction and Multi Next Hops , 2004 .

[3]  Nimrod Megiddo,et al.  Outperforming LRU with an adaptive replacement cache algorithm , 2004, Computer.

[4]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

[5]  Hari Balakrishnan,et al.  Best-path vs. multi-path overlay routing , 2003, IMC '03.

[6]  Alex Zinin,et al.  Cisco IP Routing: Packet Forwarding and Intra-Domain Routing Protocols , 2001 .

[7]  Kwan Lawrence Yeung,et al.  Traffic distribution over equal-cost-multi-paths , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).