Abstract
A growing amount of work has been invested in recent years in analyzing packet-switching networks under worst-case scenarios rather than under probabilistic assumption. Most of this work makes use of the modelof “adversarialqueuing theory” proposed by Borodin et al. [6], under which an adversary is allowed to inject into the network any sequence of packets as long as — roughly speaking — it does not overload the network.
We show that the protocolLongest-In-System, when applied to directed acyclic graphs, uses buffers of only linear size (in the length of the longest path in the network). Furthermore, we show that any packet incurs only linear delay as well. These results separate LIS from other common universally stable protocols for which there exist exponential lower bounds that are obtained on DAGs. Our upper bounds are complemented by linear lower bounds on buffer sizes and packet delays.
Part of this research was done while with the Dept. of Computer Science, University of Toronto.
Research supported in part by a grant from the Fund for the Promotion of Research at the Technion. Part of this research was done while with the Dept. of Computer Science, University of Toronto.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Aiello, E. Kushilevitz, R. Ostrovsky, A. Rosén. Adaptive packet Routing for Bursty Adversarial Trafic. Journal of Computer and System Sciences, Specialissue for STOC 98, Vol. 60, No. 3, pp. 482–509, 2000.
M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th SODA, 2000.
M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu, “Universal Stability Results for Greedy Contention-Resolution Protocols”, JACM 48(1), pp. 39–69, 2001.
M. Andrews, and L. Zhang, The Effect of Temporary Sessions on Network Performance. In Proc. of the 11th SODA, 2000.
M. Andrews, A. Fernández, M. Harchol-Balter, and T. Leighton, L. Zhang, “GeneralDynamic Routing with Per-Packet Delay Guarantees of O(distance + 1/session rate),” In Proc. of 38th FOCS, pp. 294–302, 1997.
A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Wiliamson, “Adversarial Queuing Theory”, JACM48(1), pp. 13–38, 2001.
A.Z. Broder, A.M. Frieze, and E. Upfal, “A General Approach to Dynamic Packet Routing with Bounded Buffers”, In Proc. of 37th FOCS, pp. 390–399, 1996.
A.Z. Broder, and E. Upfal, “Dynamic Deflection Routing on Arrays,” In Proc. of 28th STOC, pp. 348–355, 1996.
R. Cruz, “A Calculus for Network Delay, Part I: Network Elements in Isolation,” IEEE Transactions on Information Theory, pp. 114–131, 1991.
R. Cruz, “A Calculus for Network Delay, Part II: Network Analysis,” IEEE Transactions on Information Theory, pp. 132–141, 1991.
D. Gamarnik, Stability of Adversarial Queues via Fluid Model. In Proc. of the 39th FOCS, pp. 60–70, 1998.
D. Gamarnik. Stability of Adaptive and Non-Adaptive Packet Routing Policies in AdversarialQueuing Networks. In Proc. of the 31st STOC, pp. 206–214, 1999.
A. Goel, Stability of Networks and Protocols in the Adversarial Queuing Model for Packet Routing. Stanford University TechnicalNotes STAN-CS-TN-97-59, 1997.
M. Harchol-Balter and P. Black, “Queuing Analysis of Oblivious Packet-Routing Algorithms,” In Proc. of 5th SODA, pp. 583–592, 1994.
M. Harchol-Balter and D. Wolfe “Bounding Delays in Packet Routing Networks,” Proc. of 27th STOC, pp. 248–257, 1995.
M. Mitzenmacher, “Bounds on the Greedy Routing Algorithm for Array Networks”, J. Comput. System Sci. 53 (1996), No. 3, pp. 317–327.
C. Scheideler and B. Vöcking, “UniversalCon tinuous Routing Strategies,” In Proc. of 8th SPAA, 1996.
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols”, In Proc. of the 31st ACM Symposium on the Theory of Computing, pp. 215–224, 1999.
G. Stamoulis and J. Tsitsiklis, “The Efficiency of Greedy Routing in Hypercubes and Butterflies,” IEEE Transactions on Communications, 42 (11), pp. 3051–208, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adler, M., Rosén, A. (2002). Tight Bounds for the Performance of Longest-in-System on DAGs. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive