Stability preserving transformations: packet routing networks with edge capacities and speeds

Authors:
Allan Borodin;Rafail Ostrovsky;Yuval Rabani
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada M5S 3G4;Telcordia Technologies, MCC-1C357B, 445 South Street, Morristown, New Jersey;Computer Science Department, Technion -- IIT, Haifa 32000, Israel
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 11
Cited 6

Randomized algorithms

Randomized algorithms
Adversarial queueing theory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Instability of FIFO in session-oriented networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Stability of Adversarial Queues via Fluid Models

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Universal stability results for greedy contention-resolution protocols

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing

Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing

Routing and scheduling in multihop wireless networks with time-varying channels

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On delivery times in packet networks under adversarial traffic

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Performance and stability bounds for dynamic networks

Journal of Parallel and Distributed Computing
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks

Computer Communications
Heterogenous networks can be unstable at arbitrarily low injection rates

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Simulation of adversarial scenarios in OMNeT++: putting adversarial queueing theory from its head to feet

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

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.