Download:
|
by Micah Adler, Adi Ros'en
http://www.cs.technion.ac.il/users/adiro/publ/AR.ps
Add To MetaCart
Abstract:
Abstract. A growing amount of work has been invested in recent years in analyzing packet-switching networks under worst-case scenarios rather than under probabilistic assumption. Most of this work makes use of the model of "adversarial queuing theory " proposed by Borodin et al. [6], under which an adversary is allowed to inject into the network any sequence of packets as long as-- roughly speaking-- it does not overload the network. We show that the protocol Longest-In-System, when applied to directed acyclic graphs, uses buffers of only linear size (in the length of the longest path in the network). Furthermore, we show that any packet incurs only linear delay as well. These results separate LIS from other common universally stable protocols for which there exist exponential lower bounds that are obtained on DAGs. Our upper bounds are complemented by linear lower bounds on buffer sizes and packet delays. 1
Citations
|
510
|
A Calculus for Network Delay, Part I: Network Elements in Isolation
– Cruz
- 1991
|
|
278
|
A Calculus for Network Delay, Part II: Network Analysis
– Cruz
- 1991
|
|
116
|
Universal stability results for greedy contention-resolution protocols
– Andrews, Awerbuch, et al.
- 1996
|
|
55
|
EN Adaptive Packet Routing for Bursty Adversarial Traffic
– AIELLO, KUSHILEVITZ, et al.
- 1998
|
|
53
|
Adversarial Queuing Theory
– Borodin, Kleinberg, et al.
- 2001
|
|
45
|
The Efficiency of Greedy Routing in Hypercubes and Butterflies
– Stamoulis, Tsitsiklis
- 1991
|
|
44
|
Stability of networks and protocols in the adversarial queueing model for packet routing
– Goel
|
|
42
|
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
– Gamarnik
- 1999
|
|
36
|
Bounding delays in packet-routing networks
– Harchol-Balter, Wolfe
- 1995
|
|
36
|
Bounds on the greedy routing algorithm for array networks
– Mitzenmacher
- 1996
|
|
34
|
Stability of adversarial queues via fluid models
– Gamarnik
- 1998
|
|
33
|
öcking. Universal continuous routing strategies
– Scheideler, V
- 1998
|
|
32
|
A general approach to dynamic packet routing with bounded buffers
– Broder, Frieze, et al.
- 1996
|
|
26
|
Dynamic Deflection Routing on Arrays
– BRODER, UPFAL
- 1996
|
|
25
|
General dynamic routing with per-packet delay guarantees of ¤ (distance + 1 / session rate
– Andrews, Fernández, et al.
- 1997
|
|
21
|
Queueing analysis of oblivious packet-routing algorithms
– Harchol-Balter, Black
- 1994
|
|
18
|
The Effects of Temporary Sessions on Network Performance
– ANDREWS, ZHANG
- 2000
|
|
13
|
Instability of FIFO in Session Oriented Networks
– Andrews
- 2000
|
|
13
|
öcking. From static to dynamic routing: Efficient transformations of store-andforward protocols
– Scheideler, V
- 1999
|
