The Effects of Local Randomness in the Adversarial Queueing Model

Authors:
Yann Lorion;Maik Weinard
Affiliations:
Institute of Computer Science, Johann Wolfgang Goethe-Universität, Frankfurt am Main, Germany 60054;Institute of Computer Science, Johann Wolfgang Goethe-Universität, Frankfurt am Main, Germany 60054
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 5
Cited 0

Tail bounds for occupancy and the satisfiability threshold conjecture

Random Structures & 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)
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

SIAM Journal on Computing
Stability of FIFO networks under adversarial models: State of the art

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the effect of randomness in the adversarial queueing model. All proofs of instability for deterministic queueing strategies exploit a finespun strategy of insertions by an adversary. If the local queueing decisions in the network are subject to randomness, it is far from obvious, that an adversary can still trick the network into instability. We show that uniform queueing is unstable even against an oblivious adversary. Consequently, randomizing the queueing decisions made to operate a network is not in itself a suitable fix for poor network performances due to packet pileups.