Competitive queue policies for differentiated services

Journal of Algorithms

Volumn 55, Issue 2, 2005, Pages 113-141

  Aiello, William A ^a   Mansour, Yishay ^b   Rajagopolan, S ^c   Rosén, Adi ^d  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c TELCORDIA TECHNOLOGIES   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; DATA REDUCTION; INTERNET; PACKET NETWORKS; PROBABILITY; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION SERVICES;

FIXED PARTITION POLICY; FLEXIBLE PARTITION POLICY; GENERALIZED PROCESSOR SHARING; SIMULATED QUEUE POLICIES;

QUEUEING NETWORKS;

EID: 14844363456     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.04.004     Document Type: Article

References (15)

1. Andelman N., Mansour Y., Zhu A. Competitive queueing policies for QoS switches. Proc. of the 14th ACM-SIAM Symposium on Discrete algorithms. January, 2003;761-770
2. Borodin A., El-Yaniv R. Online Computation and Competitive Analysis. 1998;Cambridge University Press
3. Clark D., Wroclawski J. An approach to service allocation in the internet. internet draft, 1997 ftp://www-rp.lip6.fr/pub/documentaire/ietf_QoS/ draft/draft-clark-diff-svc-alloc-00.txt
4. Hahne E.L., Kesselman A., Mansour Y. Competitive buffer management for shared-memory switches. Proc. of the 13th ACM Symposium on Parallel Algorithms and Architectures. 2001;53-58
5. Kesselman A., Lotker Z., Mansour Y., Patt-Shamir B., Schieber B., Sviridenko M. Buffer overflow management in QoS switches. Proc. of the 33rd ACM Symposium on Theory of Computing. 2001;520-529
6. Kesselman A., Mansour Y. Loss bounded analysis for differentiated services. Proc. of 12th ACM-SIAM Symposium on Discrete algorithms. January, 2001;591-600
7. Kesselman A., Mansour Y. Harmonic buffer management policy for shared memory switches. Proc. of INFOCOM. 2002
8. Lotker Z., Patt-Shamir B. Nearly optimal FIFO buffer management for DiffServ. Proc. of the 21st ACM Symposium on Principles of Distributed Computing. 2002;691-700
9. Mansour Y., Patt-Shamir B., Lapid O. Optimal smoothing schedules for real-time streams. Proc. of the 19th ACM Symposium on Principles of Distributed Computing. 2000;21-29
10. May M., Bolot J., Jean-Marie A., Diot C. Simple performance models of differentiated services for the internet. Proc. of INFOCOM. 1998;1385-1394
11. Nichols K., Jacobson V., Zhang L. A two-bit differentiated services architecture for the internet. internet draft, RFC 2638, IETF, 1997 www.apps.ietf.org/rfc/rfc2638.html
12. Parekh A.K., Gallager R.G. A generalized processor sharing approach to flow control in integrated services network: the single node case. IEEE/ACM Trans. Netw. 3:(1):1993;344-357
13. S. Sahu, D. Towsley, J. Kurose, A quantitive study of differentiated services for the internet, manuscript, 1999
14. Sleator D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. ACM. 28:1985;202-208
15. Turner J.S. New directions in communications. IEEE Comm. Magazine. 24:(10):1986;8-15