Abstract
We consider a network merging streams of packets with different quality of service (QoS) levels, where packets are transported from input links to output links via multiple merge stages. Each merge node is equipped with a finite buffer, and since the bandwidth of a link outgoing from a merge node is in general smaller than the sum of incoming bandwidths, overflows may occur. QoS is modeled by assigning a positive value to each packet, and the goal of the system is to maximize the total value of packets transmitted on the output links. We assume that each buffer runs an independent local scheduling policy, and analyze FIFO policies that must deliver packets in the order they were received. We show that a simple local on-line algorithm called Greedy does essentially as well as the combination of locally optimal (off-line) schedules. We introduce a concept we call the weakness of a link, defined as the ratio between the longest time a packet spends in the system before transmitted over the link, and the longest time a packet spends in that link’s buffer. We prove that for any tree, the competitive factor of Greedy is at most the maximal link weakness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proc. of the 14th ann. ACM-SIAM Symposium on Discrete Algorithms, January 2003, pp. 771–780 (2003)
Aiello, W., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: Proc. IEEE INFOCOM (2000)
Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. 33rd ACM STOC (June 2003) (to appear)
Black, D., Blake, S., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. Internet RFC 2475 (December 1998)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13–38 (2001)
Clark, D., Wroclawski, J.: An approach to service allocation in the Internet. Internet draft (1997), Available from diffserv.lcs.mit.edu
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking 1(4), 397–413 (1993)
Hahne, E.H., Kesselman, A., Mansour, Y.: Competitive buffer management for sharedmemory switches. In: Proc. of the 2001 ACM Symposium on Parallel Algorithms and Architecture, pp. 53–58 (2001)
Keshav, S.: An engineering approach to computer networking: ATM networks, the Internet, and the telephone network. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1997)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd ACMSTOC, July 2001, pp. 520–529 (2001)
Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. Journal of Algorithms 46(1), 79–95 (2003)
Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. In: Proc. IEEE INFOCOM (2002)
Labrador, M.A., Banerjee, S.: Packet dropping policies for ATM and IP networks. IEEE Communications Surveys 2(3) (1999)
Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Transactions on Networking 2(1), 1–15 (1994)
Lotker, Z., Patt-Shamir, B.: Nearly optimal FIFO buffer management for DiffServ. In: Proc. 21st Ann. ACM Symp. on Principles of Distributed Computing, pp. 134–143 (2002)
Mansour, Y., Patt-Shamir, B.: Greedy packet scheduling on shortest paths. J. of Algorithms 14, 449–465 (1993); A preliminary version appears in the Proc. of 10th Annual Symp. on Principles of Distributed Computing (1991)
May, M., Bolot, J.-C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the Internet. In: Proc. IEEE INFOCOM (1998)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Comm. ACM 28(2), 202–208 (1985)
The ATM Forum Technical Committee. Traffic management specification version 4.0 (April 1996); Available from www.atmforum.com
Veres, A., Boda, M.: The chaotic nature of TCP congestion control. In: Proc. IEEE INFOCOM, pp. 1715–1723 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B. (2003). Buffer Overflows of Merging Streams. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive