Buffer Overflows of Merging Streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 349-360

  Kesselman, Alex ^a   Lotker, Zvi ^a   Mansour, Yishay ^a   Patt Shamir, Boaz ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; MERGERS AND ACQUISITIONS; MERGING;

BUFFER OVERFLOWS; COMPETITIVE FACTOR; FINITE BUFFER; LOCAL SCHEDULING; NETWORK MERGING; ON-LINE ALGORITHMS; POSITIVE VALUE; TOTAL VALUES;

QUALITY OF SERVICE;

EID: 0142152735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_33     Document Type: Article

References (21)

1. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Dynamic routing on networks with fixed-size buffers. In Proc. of the 14th ann. ACM-SIAM Symposium on Discrete Algorithms, pages 771-780, Jan. 2003.
2. W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for diffrentiated services. In Proc. IEEE INFOCOM, 2000.
3. Y. Azar and Y. Richter. Management of multi-queue switches in QoS networks. In Proc. 33rd ACM STOC, June 2003. To appear.
4. D. Black, S. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. Internet RFC 2475, December 1998.
5. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queuing theory. J. ACM, 48(1):13-38, 2001.
6. D. Clark and J. Wroclawski. An approach to service allocation in the Internet. Internet draft, 1997. Available from diffserv.lcs.mit.edu.
7. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking, 1(4):397-413, 1993.
8. E. H. Hahne, A. Kesselman, and Y. Mansour. Competitive buffer management for shared-memory switches. In Proc. of the 2001 ACM Symposium on Parallel Algorithms and Architecture, pages 53-58, 2001.
9. S. Keshav. An engineering approach to computer networking: ATM networks, the Internet, and the telephone network. Addison-Wesley Longman Publishing Co., Inc., 1997.
10. 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.
11. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. Journal of Algorithms, Vol. 46, Issue 1, pages 79-95, January 2003.
12. A. Kesselman and Y. Mansour. Harmonic buffer management policy for shared memory switches. In Proc. IEEE INFOCOM, 2002.
13. M. A. Labrador and S. Banerjee. Packet dropping policies for ATM and IP networks. IEEE Communications Surveys, 2(3), 1999.
14. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of ethemet traffic (extended version). IEEE/ACM Transactions on Networking, 2(1):1-15, 1994.
15. Z. Lotker and B. Patt-Shamir. Nearly optimal FIFO buffer management for DiffServ. In Proc. 21st Ann. ACM Symp. on Principles of Distributed Computing, pages 134-143, 2002.
16. Y. Mansour and B. Patt-Shamir. Greedy packet scheduling on shortest paths. J. of Algorithms, 14:449-465, 1993.
17. A preliminary version appears in the Proc. of 10th Annual Symp. on Principles of Distributed Computing, 1991.
18. 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.
19. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202-208, 1985.
20. The ATM Forum Technical Committee. Traffic management specification version 4.0, Apr. 1996. Available from www.atmforum.com.
21. A. Veres and M. Boda. The chaotic nature of TCP congestion control. In Proc. IEEE INFOCOM, pages 1715-1723, 2000.