Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds
Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Abstract:
In the context of an adversarial input model, we consider the effect on stability results when edges in packet routing networks can have capacities and speeds/slowdowns. In traditional packet routing networks, every edge is considered to have the same unit capacity and unit speed. We consider both static modifications (i.e. where the capacity or speed of an edge is fixed) and dynamic modifications where either the capacity or the speed of an edge can be dynamically changing over time. Amongst our results, we show that the universal stability of LIS is not preserved when either the capacity or the speed is changing dynamically whereas many other common scheduling protocols do maintain their universal stability. In terms of universal stability of networks, stability is preserved for dynamically changing capacities and speeds. The situation for static modifications is not as clear but we are able to show that (in contrast to the dynamic case) that any ``well defined'' universally stable scheduling rule maintains its universality under static capacities, and common scheduling rules also maintain their universal stability under static speeds.
comment: Appeared in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2001)
Full version in Journal of Interconnection Networks, Vol. 5, No. 1, pp. 1-12.
Fetch PostScript file of the paper Fetch PDF file of the paper