Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
A.Z. Broder , Digital Syst. Res. Center, Palo Alto, CA, USA
A.M. Frieze , Digital Syst. Res. Center, Palo Alto, CA, USA
E. Upfal , Digital Syst. Res. Center, Palo Alto, CA, USA
We prove a sufficient condition for the stability of dynamic packet routing algorithms. Our approach reduces the problem of steady state analysis to the easier and better understood question of static routing. We show that certain high probability and worst case bounds on the quasistatic (finite past) performance of a routing algorithm imply bounds on the performance of the dynamic version of that algorithm. Our technique is particularly useful in analyzing routing on networks with bounded buffers where complicated dependencies make standard queuing techniques inapplicable. We present several applications of our approach. In all cases we start from a known static algorithm, and modify it to fit our framework. In particular we give the first dynamic algorithm for routing on a butterfly with bounded buffers. Both the injection rate for which the algorithm is stable, and the expected time a packet spends in the system are optimal up to constant factors. Our approach is also applicable to the recently introduced adversarial input model.
packet switching; general approach; dynamic packet routing; bounded buffers; sufficient condition; stability; steady state analysis; static routing; worst case bounds; routing algorithm; butterfly; injection rate
E. Upfal, A. Frieze and A. Broder, "A general approach to dynamic packet routing with bounded buffers," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 390.