Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 1999, Pages 1412-1420

  Anjum, Farooq M ^a   Tassiulas, Leandros ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER SPACE; FAIR BANDWIDTH SHARING; GATEWAY ALGORITHMS; INTERNET GATEWAY; MINIMAL FLOWS; NON-ADAPTIVE FLOWS; TRAFFIC FLOW;

ALGORITHMS; BANDWIDTH; DROPS; INTERNET; TELECOMMUNICATION SYSTEMS; ADAPTIVE ALGORITHMS; BUFFER STORAGE; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; GATEWAYS (COMPUTER NETWORKS); NETWORK PROTOCOLS; PACKET NETWORKS; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION TRAFFIC;

GATEWAYS (COMPUTER NETWORKS); INTERNET;

FAIR BANDWIDTH SHARING; GATEWAY ALGORITHMS;

EID: 0032650379     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.752161     Document Type: Conference Paper

References (12)

1. Charny A. An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback. MIT/LCS/TR-601, Cambridge, 1994.
2. D. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems, 17(5), pp1-14 1989.
3. Hashem E. Analysis of random drop for gateway congestion control. MIT/LCS/TR-465, Cambridge, 1989.
4. S. Floyd. Tcp and explicit congestion notification. Computer Communication Review, 24(5), Oct 1994.
5. S. Floyd and K. Fall. Router Mechanisms to Support End-to-End Congestion Control, February 1997.
6. S. Floyd and V. Jacobson. On traffic phase effects in packet switched gateways. CCR, April 1991.
7. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(4), August 1993.
8. E. L. Hahne. Round-robin scheduling for max-min fairness in data networks. IEEE Journal on Selected Areas in communications, 9(7):1024-1039, September 1991.
9. D. Lin and R. Morris. Dynamics of random early detection. In Proc. ACM SIGComm Symp., Cannes, France, September 1997.
10. UCL/LBNL/VINT Network Simulator. ns version 2. http://www-mash.cs. berkeley.edu/ns/.
11. B. Suter, Lakshman T.V., D. Stiliadis, and A. Choudhury. Design considerations for supporting tcp with per-flow queueing. In Proc. INFOCOM, San Francisco, April 1998.
12. Lakshman T.V., A. Neidhardt, and T.J. Ott. The drop from front strategy in tcp over atm and its interworking with other control features. In Proc. INFOCOM, April 1996.