1 / 7

A Class of End-to-End Congestion Control Algorithms for the Internet

A Class of End-to-End Congestion Control Algorithms for the Internet. Golestani and Bhattacharyya ICNP’98. Introduction.  Limited network observability and controllability  Congestion control (CC) is difficult

sage
Download Presentation

A Class of End-to-End Congestion Control Algorithms for the Internet

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Class of End-to-End Congestion Control Algorithms for the Internet Golestani and Bhattacharyya ICNP’98

  2. Introduction •  Limited network observability and controllability Congestion control (CC) is difficult •  To accommodate rapid growth of the InternetIP protocol and requirements are kept at a minimum End-to-end CC at the transport layer •  Prevalence of FIFO queuing in the Internet Sophisticated CC disciplines are not easily applicable

  3. Tradeoff between • avoiding congestion (in the network) • satisfying users • fairness • Priority • This paper formulate the end-to-end control of user traffic in IP networks as a global optimization problem, enforcing fairness and priority without requiring non-FIFO switches

  4. Minimum Cost Flow Control (MCFC) • Coarse Realization • Implicit congestion notification • Rely on the end-to-end packet delay and loss observations, like TCP • Exact Realization • Explicit congestion notification • Probing mechanism:some of the data packets of each session include a short congestion field which is modified by each switch that the packet visits.

  5. Multiple Scales of Congestion Control

  6. MCFC algorithm can be applied to • Rate-based CC (directly) controlling the transmission rateWindow-based CC (indirectly) controlling the window size • Assume an infinite source for a session s, • Window-based (Indirectly controlling) • s  ws/s (s : Short-term transmission rate; s : Short-term RTT) • Rate-based (Directly controlling) • ws = rs• s s  rs• s/s(rs : Medium-term transmission rate; s : Medium-term RTT) • If s  s , then s  rs

  7. Consider an exponentially weighted running average algorithm to update the estimation of s , of observing RTT(p)of each new packet p from s:s (1 - ) s +  • (p)

More Related