Abstract
We survey over a decade of work on a classical Queueing Theory problem; the long-term equilibrium of routing networks. However, we do so from the perspective of Adversarial Queueing Theory where no probabilistic assumptions about traffic patterns are made. Instead, one considers a scenario where an adversary controls service requests and tries to congest the network. Under mild restrictions on the adversary, one can often still guarantee the network’s stability. We illustrate other applications of an adversarial perspective to standard algorithmic problems. We conclude with a discussion of new potential domains of applicability of such an adversarial view of common computational tasks.
Gratefully acknowledges the support of CONICYT via FONDAP in Applied Mathematics and Anillo en Redes.
Please use the following format when citing this chapter: Kiwi, M., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 9–10.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Adaptive packet routing for bursty adversarial traffic. In Proc. of the ACM Symposium on Theory of Computing, 359–368, 1998.
C. Alvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. Adversarial models for priority based networks. In Proc. of the International Symposium on Mathematical Foundations of Computer Science, 142–151, Springer-Verlag, 2003.
C. Àlvarez, M. Blesa, and M. Serna. A characterization of universal stability in the adversarial queueing model. SIAM J. Comput., 34(1):41–66, 2004.
M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results and performance bounds for greedy contention resolution protocols. J. of the ACM, 48(1):39–69, 2001.
M. Andrews, A. Fernandez, A. Goel, and L. hang. Source route and scheduling in packet networks. In Proc. of the IEEE Symposium on Foundations of Computer Science, 2001.
E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. In Proc. of the A CM Symposium on Theory of Computing, 399–406, 2002.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the IEEE Symposium on Foundations of Computer Science, 158–167, 2001.
R. Bhattacharjee, A. Goel, and Z. Lotker. Instability of FIFO at arbitrarily low rates in the adversarial queueing model. SIAM J. Comput., 34(2):318–332, 2005.
A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Williamson. Adversarial queueing theory. J. of the ACM, 48(1):13–38, 2001.
A. Borodin, R. Ostrovsky, and Y. Rabani. Stability preserving transformations: Packet routing nertworks with edge capacity and speed. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms, 601–610, 2000.
A. Charny and J.-Y. Le Boudec. Delay bounds in a network with aggregate scheduling. In Proc. of the International Workshop on Quality of Future Internet Services, 1–13. Springer-Verlag, 2000.
I. Chlamtac, A. Farago, H. Zhang, and A. Fumagalli. A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks. IEEE-ACM T. Network, 6(4):422–431, 1998.
D. Gamarnik. Stability of adversarial queues via fluid model. In Proc. of the IEEE Symposium on Foundations of Computer Science, 60–70, 1998.
M. Kiwi and A. Russell. The chilean highway problem. Theor. Comput. Sci., 326(1–3):329–342, 2004.
M. Kiwi, M. Soto, and C. Thraves. Adversarial queueing theory with setups. Technical report, Center for Mathematical Modelling, U. Chile, 2006.
P.R. Kumar and T.I. Seidman. Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Trans. on Automat. Contr., 35(3):289–298, 1990.
J.-Y Le Boudec and G. Hebuterne. Comments on “A deterministic approach to the end-to-end analysis of packet flows in connection oriented network”. IEEE-ACM T. Network, 8(1):121–124, 2000.
Z. Lotker, B. Patt-Shamir, and A. Rosén. New stability results for adversarial queuing. In Proc. of the ACM Symposium on Parallel Algorithms and Architec-tures, 192–199, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Kiwi, M. (2006). Adversarial Queueing Theory Revisited. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)