Adaptive Packet Routing for Bursty Adversarial Traffic
Authors:
- 30 June 2000
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 60 (3) , 482-509
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A simple local-control approximation algorithm for multicommodity flow2002
- Universal stability results for greedy contention-resolution protocols2002
- Competitive Routing of Virtual Circuits with Unknown DurationJournal of Computer and System Sciences, 2001
- A general approach to dynamic packet routing with bounded buffersJournal of the ACM, 2001
- Adversarial queuing theoryJournal of the ACM, 2001
- General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)SIAM Journal on Computing, 2000
- Slide—The Key to Polynomial End-to-End CommunicationJournal of Algorithms, 1997
- Dynamic deflection routing on arrays (preliminary version)1996
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks1994
- Approximate load balancing on dynamic and asynchronous networks1993