Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability results for networks with input and output blocking
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Tight Bounds for the Performance of Longest-in-System on DAGs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support read-time traffic such as voice and video. The most critical performance parameter to bound is the delay experienced by a packet as it travels from its source to its destination. We study dynamic routing in a connection-oriented packet-switching network. We consider a network with arbitrary topology on which a set of sessions is defined. For each session i, packets are injected at a rate r/sub i/ to follow a predetermined path of length d/sub i/. Due to limited bandwidth, only one packet at a time may advance on an edge. Session paths may overlap subject to the constraint that the total rate of sessions using any particular edge is less than 1. We address the problem of scheduling the sessions at each switch, so as to minimize worst-case packet delay and queue buildup at the switches. We show the existence of an asymptotically-optimal schedule that achieves a delay bound of O(1/r/sub i/+d/sub i/) with only constant-size queues at the switches. We also present a simple distributed algorithm that, with high probability, delivers every session-i packet to its destination within O(1/r/sub i/+d/sub i/ log(m/r/sub min/)) steps of its injection, where r/sub min/ is the minimum session rate, and m is the number of edges in the network. Our results can be generalized to (leaky-bucket constrained) bursty traffic, where session i tolerates a burst size of b/sub i/. In this case, our delay bounds become O(b/sub i//r/sub i/+d/sub i/) and O(b/sub i//r/sub i/+d/sub i/ log(m/r/sub min/)), respectively.