Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
SIAM Journal on Computing
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
Source Routing and Scheduling in Packet Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Effects of Temporary Sessions on Network Performance
SIAM Journal on Computing
On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The robustness of stability under link and node failures
Theoretical Computer Science
Adversarial queueing model for continuous network dynamics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze classes of queueing strategies. We introduce the class of queueing strategies that base their preferences on knowledge of the entire graph, the path of the packet and its progress. This restriction only rules out time keeping information like a packet's age or its current waiting time. We show that all strategies without time stamping have exponential queue sizes, suggesting that time keeping is necessary to obtain subexponential performance bounds. We further introduce a new method to prove stability for strategies without time stamping and show how it can be used to completely characterize a large class of strategies as to their 1-stability and universal stability.