Abstract
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes. We give the first routing algorithm on this topology that is stable under an injection rate within a constant factor of the hardware bandwidth. Unlike previous results, our algorithm does not require the global synchronization of the insertion times or the retraction and reinsertion of excessively delayed messages and our analysis holds for a broad range of packet generation stochastic distributions. This result represents a new application of a general technique for the design and analysis of dynamic algorithms that we first presented in [Broder et al., FOCS 96, pp. 390–399.].
Research supported in part by NSF Grant CCRR-9530974
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Z. Broder, A. M. Frieze, and E. Upfal. A general approach to dynamic packet routing with bounded buffers. Proceedings of the 37th IEEE Symp. on Foundations of Computer Science. Burlington, 1996, pp. 390–399.
A. Z. Broder and E. Upfal. Dynamic deflection routing on arrays. Proceedings of the 28th ACM Symp. on Theory of Computing. Philadelphia, 1996, pp. 348–355.
U. Feige. “Nonmonotonic phenomena in packet routing”, manuscript, march 1997.
M. Harcol-Balter and P. Black. Queuing analysis of oblivious packet routing networks. Procs. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms. Pages 583–592, 1994.
M. Harcol-Balter and D. Wolf. Bounding delays in packet-routing networks. Procs. of the 27th Annual ACM Symp. on Theory of Computing, 1995, pp. 248–257.
N. Kahale and T. Leighton. Greedy dynamic routing on arrays. Procs. of the 6th Annual ACM-SIAM Symp. on Discrete Algorithms. Pages 558–566, 1995.
F. T. Leighton. Average case analysis of greedy routing algorithms on arrays. Procs. of the Second Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 2–10, 1990.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan-Kaufmann, San Mateo, CA 1992.
M. Mitzenmacher. Bounds on the greedy algorithms for array networks. Procs. of the 6th Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 346–353, 1994.
T. Rubshtein. A Dynamic Hot Potato Routing Algorithm for the Torus. M.Sc. thesis, The Weizmann Institute, 1996.
C. Scheideler and B. Voecking Universal continuous routing strategies. SPAA '96.
G. D. Stamoulis and J. N. Tsitsiklis. The efficiency of greedy routing in hypercubes and butterflies. Procs. of the 6th Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 346–353, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broder, A.Z., Frieze, A.M., Upfal, E. (1998). Dynamic packet routing on arrays with bounded buffers. In: Lucchesi, C.L., Moura, A.V. (eds) LATIN'98: Theoretical Informatics. LATIN 1998. Lecture Notes in Computer Science, vol 1380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054328
Download citation
DOI: https://doi.org/10.1007/BFb0054328
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64275-6
Online ISBN: 978-3-540-69715-2
eBook Packages: Springer Book Archive