• DocumentCode
    253318
  • Title

    TinyFlow: Breaking elephants down into mice in data center networks

  • Author

    Hong Xu ; Baochun Li

  • Author_Institution
    Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong, China
  • fYear
    2014
  • fDate
    21-23 May 2014
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Current multipath routing solution in data centers relies on ECMP to distribute traffic among all equal-cost paths. It is well known that ECMP suffers from two deficiencies. ECMP does not differentiate between elephant and mice flows, creates head-of-line blocking for mice flows in the egress port buffer, and results in long tail latency. Further it does not fully utilize available bandwidth due to hash collision among elephant flows. We propose TinyFlow, a simple yet effective approach that remedies both problems. TinyFlow changes the traffic characteristics of data center networks to be amenable to ECMP by breaking elephants into mice. In a network with a large number of mice flows only, ECMP naturally balances load and performance is improved. We conduct NS-3 simulations and show that TinyFlow provides 20%-40% speedup in both mean and 99-th percentile FCT for mice, and about 40% throughput improvement for elephants.
  • Keywords
    computer centres; computer networks; resource allocation; telecommunication network routing; telecommunication traffic; ECMP; NS-3 simulations; TinyFlow; data center networks; egress port buffer; elephant flows; equal cost multipathing; hash collision; head-of-line blocking; load balancing; mice flows; multipath routing solution; traffic distribution; Bandwidth; Load modeling; Mice; Ports (Computers); Routing; Throughput; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local & Metropolitan Area Networks (LANMAN), 2014 IEEE 20th International Workshop on
  • Conference_Location
    Reno, NV
  • Type

    conf

  • DOI
    10.1109/LANMAN.2014.7028620
  • Filename
    7028620