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].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of the 14th SODA, pp. 771–780 (2003)
Kesselman, A., Mansour, Y., Lotker, Z., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of the 15th SPAA, pp. 244–245 (2003)
Kothapalli, K., Scheideler, C.: Information gathering in adversarial systems: lines and cycles. In: SPAA 2003: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 333–342 (2003)
Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 484–495. Springer, Heidelberg (2005)
Labrador, M., Banerjee, S.: Packet dropping policies for ATM and IP networks. IEEE Communications Surveys 2 (1999)
Broder, A.Z., Frieze, A.M., Upfal, E.: A general approach to dynamic packet routing with bounded buffers. In: Proceedings of the 37th FOCS, p. 390 (1996)
Broder, A., Upfal, E.: Dynamic deflection routing on arrays. In: Proceedings of the 28th annual ACM Symposium on Theory of Computing, pp. 348–355 (1996)
Mihail, M.: Conductance and convergence of markov chains–a combinatorial treatment of expanders. In: Proceedings of the 30th FOCS, pp. 526–531 (1989)
Mitzenmacher, M.: Bounds on the greedy routing algorithm for array networks. Journal of Computer System Sciences 53, 317–327 (1996)
Stamoulis, G., Tsitsiklis, J.: The efficiency of greedy routing in hypercubes and butterflies. IEEE Transactions on Communications 42, 3051–3208 (1994)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queueing theory. In: Proceedings of the 28th STOC, pp. 376–385 (1996)
Andrews, M., Mansour, Y., Fernéndez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proceedings of the 37th FOCS, pp. 380–389 (1996)
Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.G.: Direct routing: Algorithms and complexity. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 134–145. Springer, Heidelberg (2004)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput competitive on-line routing. In: Proceedings of 34th FOCS, pp. 32–40 (1993)
Scheideler, C., Vöcking, B.: Universal continuous routing strategies. In: Proceedings of the 8th SPAA, pp. 142–151 (1996)
Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci. 324, 161–182 (2004)
Lotker, Z., Patt-Shamir, B.: Nearly optimal FIFO buffer management for DiffServ. In: Proceedings of the 21th PODC, pp. 134–143 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelov, S., Khanna, S., Kunal, K. (2005). The Network as a Storage Device: Dynamic Routing with Bounded Buffers. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_1
Download citation
DOI: https://doi.org/10.1007/11538462_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)