On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Tight bounds for the performance of longest in system on DAGs
Journal of Algorithms
The necessity of timekeeping in adversarial queueing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hi-index | 0.00 |
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first on-line routing algorithm that finds a set of admissible paths whenever this is feasible. Our algorithm calculates a path for each packet as soon as it is injected at its source using a simple shortest path computation. The length of a link reflects its current congestion. We also show how our algorithm can be implemented under today's Internet routing paradigms.When the paths are known (either given by the adversary or computed as above) our goal is to schedule the packets along the given paths so that the packets experience small end-to-end delays. The best previous delay bounds for deterministic and distributed scheduling protocols were exponential in the path length. In this paper we present the firstdeterministic and distributed scheduling protocol that guarantees a polynomial end-to-end delay for every packet.Finally, we discuss the effects of combining routing with scheduling. We first show that some unstable scheduling protocols remain unstable no matter how the paths are chosen. However, the freedom to choose paths can make a difference. For example, we show that a ring with parallel links is stable for all greedy scheduling protocols if paths are chosen intelligently, whereas this is not the case if the adversary specifies the paths.