A class of end to end congestion control algorithms for the internet
Download
1 / 7

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


  • 142 Views
  • Uploaded on

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

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' A Class of End-to-End Congestion Control Algorithms for the Internet' - sage


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
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
Introduction Internet

  •  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


  • Tradeoff between Internet

    • 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


  • Minimum Cost Flow Control Internet (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.


Multiple scales of congestion control
Multiple Scales Internetof Congestion Control


  • MCFC algorithm can be applied to Internet

    • 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



ad