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

Deskribapen osoa

Xehetasun bibliografikoak
Argitaratua izan da:Journal of the ACM 52, 4 (2005).
Egile nagusia: Andrews, Matthew
Formatua: Artikulua
Hizkuntza:English
Gaiak: