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.
Partially supported by DFG project SCHN 503/4-1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13–38 (2001)
Cholvi, V., Echagüe, J.: Stability of fifo networks under adversarial models: State of the art. Comput. Networks 51(15), 4460–4474 (2007)
Bhattacharjee, R., Goel, A., Lotker, Z.: Instability of fifo at arbitrarily low rates in the adversarial queueing model. SIAM Journal on Computing 34(2), 318–332 (2005)
Andrews, A., Fernandez, L., Liu, K.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM: Journal of the ACM 48 (2001)
Lorion, Y., Weinard, M.: The effects of local randomness in the adversarial queueing model. Technical Report 2008/01, Frankfurter Informatik Berichte (2008) ISSN 1616-9107
Kamath, A.P., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms 7, 59–80 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lorion, Y., Weinard, M. (2008). The Effects of Local Randomness in the Adversarial Queueing Model. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)