¡¡
Spring 2002
ENSC 833: NETWORK PROTOCOLS AND PERFORMANCE
CMPT 885: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS
¡¡
FINAL PROJECT
¡¡Jian (Jason) Wen and Yi Zheng
Topic:
Implementation a class of End-to-End Congestion Control Algorithms for the Internet
Based on formulation of end-to-end
congestion control, a class of minimum cost flow control(MCFC) algorithms for
adjusting session rates or window sizes can be implemented at the transport
layer of an IP network and can provide certain fairness properties and user
priority options without requiring non-FIFO switches.
In our project, two algorithm
versions are introduced. One is coarse version, which is geared towards
implementation in the current Internet, relying on the end-to-end packet
loss observations as indication of congestion. The other is a more complete
version anticipates and Internet where sessions can solicit explicit congestion
information through a concise probing mechanism.
-
[References]
- 1. S.Jamaloddin Golestani, Bell Laboratories and Murray Hill, "A
Class of End-to-End Congestion Control Algorithms for the Internet"
- 2. Yair Bartal, John W.Byers and Danny Raz, "Global Optimization
Using Local Information with Applications to Flow Control"
- 3. Srisankar Kunniyur and R.Srikant,"End-to-End Congestion Control
Schemes : Utility Functions, Random Losses and ECN Marks"
- 4. S.Jamaloddin Golestani, Krishan K.Sabnani and Bell Laboratories, "Fundamental
Observations on Multicast Congestion Control in the Internet"
- 5. Anindya Basu, S.Jamaloddin Golestani and Bell Laboratories, "Estimation
of Receiver Round Trip Times in Multicast Communications"