Nearly optimal FIFO buffer management for DiffServ

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 134-143

  Lotker, Zvi ^a   Patt Shamir, Boaz ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; PACKET SWITCHING; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION TRAFFIC;

BUFFER MANAGEMENT; DIFFSERV; PUSH-OUT BUFFERS;

NETWORK PROTOCOLS;

EID: 0036957953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571850.571851     Document Type: Conference Paper

References (17)

1. W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for diffrentiated services. In Proc. IEEE INFOCOM, 2000.
2. D. Black, S. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. Internet RFC 2475, December 1998.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. D. Clark and J. Wroclawski. An approach to service allocation in the Internet. Internet draft, 1997. Available from diffserv.lcs.mit.edu.
5. R. Cruz. A calculus for network delay part I: Network elements in isolation. IEEE Trans. Info. Theory, 37(1):114-131, Jan. 1991.
6. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking, 1(4):397-413, 1993.
7. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. In Proc. 33rd ACM STOC, pages 520-529, July 2001.
8. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. of the 12th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 591-600, 2001.
9. M. A. Labrador and S. Banerjee. Packet dropping policies for ATM and IP networks. IEEE Communications Surveys, 2(3), 1999.
10. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Transactions on Networking, 2(1):1-15, 1994.
11. Z. Lotker. Personal Communication, October 2000.
12. Y. Mansour, B. Patt-Shamir, and O. Lapid. Optimal smoothing schedules for real-time streams. In Proc. 19th Ann. ACM Symp. on Principles of Distributed Computing, pages 21-30, Portland, Oregon, July 2000.
13. M. May, J.-C. Bolot, A. Jean-Marie, and C. Diot. Simple performance models of differentiated services for the Internet. In Proc. IEEE INFOCOM, 1998.
14. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202-208, 1985.
15. M. Sviridenko. A lower bound for on-line algorithms in the FIFO model. Unpublished manuscript, Apr. 2001.
16. The ATM Forum Technical Committee. Traffic management specification version 4.0, Apr. 1996. Available from www.atmforum.com.
17. A. Veres and M. Boda. The chaotic nature of TCP congestion control. In Proc. IEEE INFOCOM, pages 1715-1723, 2000.