The Effects of Local Randomness in the Adversarial Queueing Model

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.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Yann Lorion, Maik Weinard
• Keywords: Adversarial Queueing Model, Algorithms, ESA 2008, Queueing, Queueing Decisions