Name
Abstract | ||
|---|---|---|
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, and paves the way for a systematic study of queuing with few or no probabilistic assumptions. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/363647.363659 | J. ACM |
Keywords | DocType | Volume |
probabilistic analysis,arrival process,time-invariant stochastic generation,preliminary result,stability,systematic study,simple network,packet routing,approach sheds light,adversarial theory,scheduling protocols,probabilistic assumption | Journal | 48 |
Issue | ISSN | Citations |
1 | 0004-5411 | 113 |
PageRank | References | Authors |
5.47 | 35 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Allan Borodin | 1 | 2947 | 658.84 |
| Jon Kleinberg | 2 | 22707 | 2358.90 |
| Prabhakar Raghavan | 3 | 13351 | 2776.61 |
| Madhu Sudan | 4 | 5616 | 591.68 |
| David P. Williamson | 5 | 3564 | 413.34 |