Abstract
We study the problem of online packet routing and information gathering in lines, rings and trees. A network consist of n nodes. At each node a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the same destination. If a packet reaches the destination it is absorbed. The goal is to maximize the number of absorbed packets. Previous studies have shown that even on the line topology this problem is difficult to handle by online algorithms. A lower bound of \({\it \Omega}(\sqrt{n})\) on the competitiveness of the Greedy algorithm was presented by Aiello et al in [1]. All other known algorithms have a near linear competitive ratio. In this paper we give the first O(log n) competitive deterministic algorithm for the information gathering problem in lines, rings and trees. We also consider multi-destination routing where the destination of a packet may be any node. For lines and rings we show an O(log2 n) competitive randomized algorithms. Both for information gathering and for the multi-destination routing our results improve exponentially the previous results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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: Proc. 14th SODA, pp. 771–780 (2003)
Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380–389 (1996)
Angelov, S., Khanna, S., Kunal, K.: The network as a storage device: Dynamic routing with bounded buffers. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 1–13. Springer, Heidelberg (2005) (to appear)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput competitive on-line routing. In: Proc. 34th IEEE Symp. on Found. of Comp. Science, pp. 32–40 (1993)
Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting and multicasting in adversarial systems: Routing and admission control. In: Proc. 30 ICALP, pp. 1153–1168 (2003)
Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proc. 5’th ACM-SIAM Symp. on Discrete Algorithms, pp. 312–320 (1994)
Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 64–71 (2004)
Birman, A., Gail, H.R., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM) 42(3), 641–657 (1995)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queuing theory. In: Proc. 28th ACM STOC, pp. 376–385 (1996)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B.: Buffer overflows of merging streams. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 349–360. Springer, Heidelberg (2003)
May, M., Bolot, J.C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the internet. In: Proceedings of the IEEE INFOCOM, pp. 1385–1394 (1999)
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
Azar, Y., Zachut, R. (2005). Packet Routing and Information Gathering in Lines, Rings and Trees. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_44
Download citation
DOI: https://doi.org/10.1007/11561071_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)