Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adler, M., Rosen, A.: Tight Bounds for the Performance of Longest in System on DAGs. In: Proc. of the 19th Symposium on Theoretical Aspects of Computer Science, pp. 88–99 (2002)
Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z.: Universal-Stability Results and Performance Bounds for Greedy Contention-Resolution Protocols. Journal of the ACM 48(1), 39–69 (2001)
Andrews, M., Fernández, A., Goel, A., Zhang, L.: Source Routing and Scheduling in Packet Networks. In: Proc. of the 42nd Symposium on Foundations of Computer Science, pp. 168–177 (2001)
Andrews, M., Zhang, L.: The Effects of Temporary Sessions on Network Performance. SIAM Journal of Computation 33(3), 659–673
Bhattacharjee, R., Goel, A.: Instability of FIFO at arbitrarily low rates in the adversarial queueing model. In: Proc. of the 44th Symposium on Foundations of Computer Science, pp. 160–167 (2003)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queueing theory. Journal of the ACM 48(1), 13–38 (2001)
Gamarnik, David: Stability od Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. SIAM Journal on Computing 32(2), 371–385 (2003)
Koukopoulos, D., Mavronicolas, M., Spirakis, P.: FIFO is Unstable at Arbitrarily Low Rates (Even in Planar Networks). Electronic Colloq. on Computational Complexity (2003)
Rosén, A., Tsirkin, M.S.: On Delivery Times in Packet Networks under Adversarial Traffic. In: Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 1–10 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weinard, M. (2005). The Necessity of Timekeeping in Adversarial Queueing. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_38
Download citation
DOI: https://doi.org/10.1007/11427186_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)