Adversarial queueing network explained

In queueing theory, an adversarial queueing network is a model where the traffic to the network is supplied by an opponent rather than as the result of a stochastic process. The model has seen use in describing the impact of packet injections on the performance of communication networks.^[1] The model was first introduced in 1996.^[2]

The stability of an adversarial queueing network can be determined by considering a fluid limit.^[3]

Notes and References

1. Book: 10.1007/978-3-540-45198-3_14. Effective Routing and Scheduling in Adversarial Queueing Networks. Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. 2764. 153. Lecture Notes in Computer Science. 2003. Sethuraman . J. . Teo . C. P. . 978-3-540-40770-6.
2. Book: 10.1145/237814.237984. Adversarial queueing theory. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing – STOC '96. 376. 1996. Borodin . A. . Allan Borodin. Kleinberg . J. . Jon Kleinberg. Raghavan . P. . Prabhakar Raghavan. Sudan . M. . Madhu Sudan. Williamson . D. P. . David P. Williamson. 0897917855. 771941.
3. Book: 10.1109/SFCS.1998.743429. Stability of adversarial queues via fluid models. Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). 60–70. 1998. Gamarnik . D.. 0-8186-9172-7. 2145524.