Adversarial queueing network

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 (PDF). Lecture Notes in Computer Science 2764. p. 153. doi:10.1007/978-3-540-45198-3_14. ISBN 978-3-540-40770-6.
↑ 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. p. 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). p. 60. doi:10.1109/SFCS.1998.743429. ISBN 0-8186-9172-7.

Queueing theory

Single queueing nodes	D/M/1 queue M/D/1 queue M/D/c queue M/M/1 queue Burke's theorem M/M/c queue M/M/∞ queue M/G/1 queue Pollaczek–Khinchine formula Matrix analytic method M/G/k queue G/M/1 queue G/G/1 queue Kingman's formula Lindley equation Fork–join queue Bulk queue

Arrival processes	Poisson process Markovian arrival process Rational arrival process

Queueing networks	Jackson network Traffic equations Gordon–Newell theorem Mean value analysis Buzen's algorithm Kelly network G-network BCMP network

Service policies	FIFO LIFO Processor sharing Round-robin Shortest job first Shortest remaining time

Key concepts	Continuous-time Markov chain Kendall's notation Little's law Product-form solution Balance equation Quasireversibility Flow-equivalent server method Arrival theorem Decomposition method Beneš method

Limit theorems	Fluid limit Mean field theory Heavy traffic approximation Reflected Brownian motion

Extensions	Fluid queue Layered queueing network Polling system Adversarial queueing network Loss network Retrial queue

Information systems	Data buffer Erlang (unit) Erlang distribution Flow control (data) Message queue Network congestion Network scheduler Pipeline (software) Quality of service Scheduling (computing) Teletraffic engineering

Category

This article is issued from Wikipedia - version of the Saturday, August 29, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.