Adversarial queuing theory

Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
2001 Journal of the ACM  
We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. Our approach sheds light on various queuing policies in simple networks,
more » ... and paves the way for a systematic study of queuing with few or no probabilistic assumptions.
doi:10.1145/363647.363659 fatcat:wq6t2ocbvncytbprh6kmmpfjvm