Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Volume 3624 of the series Lecture Notes in Computer Science pp 1-13
The Network as a Storage Device: Dynamic Routing with Bounded Buffers
- Stanislav AngelovAffiliated withUniversity of Pennsylvania
- , Sanjeev KhannaAffiliated withUniversity of Pennsylvania
- , Keshav KunalAffiliated withUniversity of Pennsylvania
Abstract
We study dynamic routing in store-and-forward packet networks where each network link has bounded buffer capacity for receiving incoming packets and is capable of transmitting a fixed number of packets per unit of time. At any moment in time, packets are injected at various network nodes with each packet specifying its destination node. The goal is to maximize the throughput, defined as the number of packets delivered to their destinations.
In this paper, we make some progress in understanding what is achievable on various network topologies. For line networks, Nearest-to-Go (NTG), a natural greedy algorithm, was shown to be O(n 2/3)-competitive by Aiello et al [1]. We show that NTG is \(\tilde{O}(\sqrt{n})\)-competitive, essentially matching an identical lower bound known on the performance of any greedy algorithm shown in [1]. We show that if we allow the online routing algorithm to make centralized decisions, there is indeed a randomized polylog(n)-competitive algorithm for line networks as well as rooted tree networks, where each packet is destined for the root of the tree. For grid graphs, we show that NTG has a performance ratio of \(\tilde{\Theta}(n^{2/3})\) while no greedy algorithm can achieve a ratio better than \(\Omega(\sqrt{n})\). Finally, for an arbitrary network with m edges, we show that NTG is \(\tilde{\Theta}(m)\)-competitive, improving upon an earlier bound of O(mn) [1].
- Title
- The Network as a Storage Device: Dynamic Routing with Bounded Buffers
- Book Title
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Book Subtitle
- 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005. Proceedings
- Pages
- pp 1-13
- Copyright
- 2005
- DOI
- 10.1007/11538462_1
- Print ISBN
- 978-3-540-28239-6
- Online ISBN
- 978-3-540-31874-3
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 3624
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Chandra Chekuri (16)
- Klaus Jansen (17)
- José D. P. Rolim (18)
- Luca Trevisan (19)
- Editor Affiliations
-
- 16. Dept. of Computer Science, University of Illinois
- 17. Institute for Computer Science, University of Kiel
- 18. Battelle Bâtiment A, Centre Universitaire d’Informatique
- 19. UC Berkeley
- Authors
-
- Stanislav Angelov (20)
- Sanjeev Khanna (20)
- Keshav Kunal (20)
- Author Affiliations
-
- 20. University of Pennsylvania, Philadelphia, PA, 19104, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.