• DocumentCode
    2379352
  • Title

    Controlling high-bandwidth flows at the congested router

  • Author

    Mahajan, Ratul ; Floyd, Sally ; Wetherall, David

  • Author_Institution
    Washington Univ., Seattle, WA, USA
  • fYear
    2001
  • fDate
    11-14 Nov. 2001
  • Firstpage
    192
  • Lastpage
    201
  • Abstract
    FIFO queueing is simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control, but also short round-trip time TCP flows. At the other extreme, per-flow scheduling mechanisms provide max-min fairness but are more complex, keeping state for all flows going through the router. This paper presents RED-PD (Random Early Detection-Preferential Dropping), a mechanism that combines simplicity and protection by keeping state for just the high-bandwidth flows. RED-PD uses the packet drop history at the router to detect high-bandwidth flows in times of congestion and preferentially drops packets from these flows. This paper discusses the design decisions underlying RED-PD. We show that it is effective at controlling high-bandwidth flows using a small amount of state and very simple fast-path operations.
  • Keywords
    queueing theory; telecommunication congestion control; telecommunication network routing; transport protocols; FIFO queueing; RED-PD mechanism; congested router; design decisions; end-to-end congestion control; fast-path operations; high-bandwidth flows control; max-min fairness; packet drop history; per-flow scheduling mechanisms; preferential dropping mechanisms; random early detection; round-trip time TCP flows; Bandwidth; Filters; History; Internet; Monitoring; Proportional control; Proposals; Protection; Throughput; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Protocols, 2001. Ninth International Conference on
  • Print_ISBN
    0-7695-1429-4
  • Type

    conf

  • DOI
    10.1109/ICNP.2001.992899
  • Filename
    992899