Scalable QoS Provision Through Buffer Management

Computer Communication Review

Volumn 28, Issue 4, 1998, Pages 29-40

  Guerin R ^a   Kamat, S ^a   Peris, V ^a   Rajan, R ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Buffer management; Fairness; Rate guarantees; Scheduling; Sharing

Indexed keywords

ALGORITHMS; BANDWIDTH; BUFFER STORAGE; DATA COMMUNICATION SYSTEMS; SCHEDULING; TELECOMMUNICATION LINKS;

BUFFER ALLOCATION RULE; BUFFER MANAGEMENT; LINK SCHEDULING ALGORITHM;

TELECOMMUNICATION SERVICES;

EID: 0032178134     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/285243.285254     Document Type: Article

References (10)

1. A. K. Choudhury and E. L. Hahne. Dynamic queue length thresholds in a shared memory ATM switch. In Proceedings of INFOCOM, pages 679-687, San Francisco, CA, April 1996.
2. I. Cidon, R. Guérin, and A. Khamisy. Protective buffer management policies. IEEE/ACM Trans. Networking, 2(3):240-246, June 1994.
3. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(4):397-413, August 1993.
4. L. Georgiadis, R. Guérin, V. Peris, and K. N. Sivarajan. Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Trans. Networking, 4(4):482-501, August 1996.
5. D. Lin and R. Morris. Dynamics of random early detection. In Proceedings of SIGCOMM, pages 127-137, Sophia Antipolis, France, September 1997.
6. A. K. J. Parekh. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks. PhD thesis, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, February 1992. No. LIDS-TH-2089.
7. A. Romanow and S. Floyd. Dynamics of TCP traffic over ATM networks. IEEEJ. Sel. Areas Commun., 13(4):633-641, May 1995.
8. S. Suri, G. Varghese, and G. Chandranmenon. Leap forward virtual clock: A new fair queueing scheme with guaranteed dealy and throughput fairness. In Proceedings of INFOCOM, pages 558-566, Kobe, Japan, April 1997.
9. J. Turner. Maintaining high throughput during overload in ATM switches. In Proceedings of INFOCOM, pages 287-295, San Francisco, CA, April 1996.
10. D. Wrege and J. Liebeherr. A near-optimal packet scheduler for QoS networks. In Proceedings of INFOCOM, pages 577-585, Kobe, Japan, April 1997.