Adversarial queueing network
From HandWiki
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]
References
- ↑ Sethuraman, J.; Teo, C. P. (2003). "Effective Routing and Scheduling in Adversarial Queueing Networks". Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. Lecture Notes in Computer Science. 2764. pp. 153. doi:10.1007/978-3-540-45198-3_14. ISBN 978-3-540-40770-6. http://www.columbia.edu/~js1353/pubs/st-adversarial.pdf.
- ↑ Borodin, A.; Kleinberg, J.; Raghavan, P.; Sudan, M.; Williamson, D. P. (1996). "Adversarial queueing theory". Proceedings of the twenty-eighth annual ACM symposium on Theory of computing – STOC '96. pp. 376. doi:10.1145/237814.237984. ISBN 0897917855.
- ↑ Gamarnik, D. (1998). "Stability of adversarial queues via fluid models". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 60–70. doi:10.1109/SFCS.1998.743429. ISBN 0-8186-9172-7.
| Single queueing nodes | |
|---|---|
| Arrival processes | |
| Queueing networks | |
| Service policies | |
| Key concepts | |
| Limit theorems | |
| Extensions | |
| Information systems | |
 |  |
