Dynamic Packet Routing on Arrays with Bounded Buffers

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.].

• Type: Conference
• Year: 1998
• Where: LATIN
• Authors: Andrei Z. Broder, Alan M. Frieze, Eli Upfal
• Keywords: Generation Stochastic Distributions, Information Management, LATIN 1998, Routing, Routing Algorithm