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
Stability of networks and protocols in the adversarial queueing model for packet routing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On deciding stability of scheduling policies in queueing systems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability preserving transformations: packet routing networks with edge capacities and speeds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Stability and non-stability of the FIFO protocol
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
New stability results for adversarial queuing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Tight Bounds for the Performance of Longest-in-System on DAGs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
The adversarial queueing theory model for packet routing was suggested by Borodin et al. We give a complete and simple characterization of all networks that are universally stable in this model. We show that a specific greedy protocol, SIS (Shortest In System), is stable against a large class of stochastic adversaries. New applications such as multicast packet scheduling and job scheduling with precedence constraints xsare suggested for the adversarial model.