• DocumentCode
    2311563
  • Title

    Traffic Splitting over ECMPs using ACC Scheme

  • Author

    Lin, Wei ; Tang, Yi ; Liu, Bin

  • Author_Institution
    Graduate Sch. at Shenzhen, Tsinghua Univ., Beijing
  • fYear
    2006
  • fDate
    25-27 Oct. 2006
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    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.
  • Keywords
    cache storage; telecommunication traffic; transport protocols; ARC-based caching with counting; Packet length differentiation; TCP flow; UDP; cache lookup; destination subnet; equal-cost-multipaths; forwarding node; load balance; network congestion reduction; traffic splitting; Computational modeling; Costs; DH-HEMTs; Frequency; Out of order; Round robin; Routing protocols; Switches; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Networking in China, 2006. ChinaCom '06. First International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    1-4244-0463-0
  • Electronic_ISBN
    1-4244-0463-0
  • Type

    conf

  • DOI
    10.1109/CHINACOM.2006.344703
  • Filename
    4149706