Source routing and scheduling in packet networks.

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 algorit...

Full beskrivning

Bibliografiska uppgifter

I publikationen:	Journal of the ACM 52, 4 (2005).
Huvudupphovsman:	Andrews, Matthew
Materialtyp:	Artikel
Språk:	English
Ämnen:	Computer systems organization. Computer-communication networks. Network architecture and design. Packet switching networks. Store and forward networks. Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Sequencing and scheduling. Algorithms. Theory.