Supporting best-effort traffic with Fair Service Curve

Performance Evaluation Review

Volumn 27, Issue 1, 1999, Pages 218-219

  Ng, T S Eugene ^a   Stephens, Donpaul C ^a   Stoica, Ion ^a   Zhang, Hui ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; FREQUENCY ALLOCATION; TELECOMMUNICATION TRAFFIC;

BEST EFFORT TRAFFIC; FAIR SERVICE CURVE (FSC) ALGORITHM;

WORLD WIDE WEB;

EID: 0032682342     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301464.301580     Document Type: Article

References (3)

1. A. Feldmann, J. Rexford, and R. Caceres. Efficient policies for carrying web traffic over flow-switched networks. IEEE/ACM Transactions on Networking. To Appear.
2. T.S.E. Ng, D.C. Stephens, I. Stoica, and H. Zhang. Supporting Best-Effort Traffic with Fair Service Curve, 1999. http://www.cs.cmu.edu/~hzhang/fsc/.
3. I. Stoica, H. Zhang, and T.S.E. Ng. A Hierarchical Fair Service Curve algorithm for link-sharing, real-time and priority services. In Proceedings of the ACM-SIGCOMM 97, Cannes, France, August 1997.