Name
Abstract | ||
|---|---|---|
Abstract In an adversarial queueing network, the incoming trac is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementary point of view to that of the traditional queueing network model in which arrivals are modeled by stochastic processes. As a result, the adversarial queueing network model has attracted a lot of attention in recent years, especially as a way of modeling packet injections into a communication network. Our main result is a simple, eective packet routing and scheduling algorithm with a provably-good performance. Specifically, our algorithm keeps the system stable (bounded number of packets in the system), with the bound on the number of packets in the system that is O((1 r) ,); moreover, our result matches the traditional queueing-theoretic number-in-system bound. 1 Introduction and Contributions Scheduling and packet-routing have emerged as important issues in modern computer and commu- |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00453-005-1162-1 | Algorithmica |
Keywords | Field | DocType |
fluid model,scheduling,multicommodity flow,adversarial networks.,congestion,stochastic process,scheduling algorithm | Telecommunications network,Computer science,Scheduling (computing),Network packet,Layered queueing network,Queueing theory,Packet switching,Multi-commodity flow problem,Adversarial system,Distributed computing | Journal |
Volume | Issue | ISSN |
43 | 1-2 | 0178-4617 |
Citations | PageRank | References |
2 | 0.38 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jay Sethuraman | 1 | 439 | 42.32 |
| Chung-Piaw Teo | 2 | 864 | 69.27 |
| CP Teo | 3 | 2 | 0.38 |