Abstract
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space used to store the routing table on each node and the stretch factor of the multicast scheme – the maximum ratio over all sets of nodes between the cost of the multicast route induced by the scheme and the cost of a steiner tree between the same set of target nodes. We obtain results in several variants of the problem: labeled – in which the designer can choose polylogarithmic node names, name-independent – in which nodes have arbitrarily chosen names, dynamic – an online version of the problem in which nodes dynamically join and leave the multicast service and the goal is to minimize both the cost of the multicast tree at each stage and the total cost of control messages needed to update the tree.
This is a preview of subscription content, log in via an institution to check access.
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
Abraham, I., Gavoille, C., Malkhi, D.: Routing with Improved Communication-Space Trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 305–319. Springer, Heidelberg (2004)
Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 20–24. ACM Press, New York (2004)
Awerbuch, B., Bartal, Y., Fiat, A.: Distributed paging for general networks. In: SODA 1996: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 574–583. Society for Industrial and Applied Mathematics (1996)
Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503–513. IEEE Computer Society Press, Los Alamitos (1990)
Berman, P., Coulston, C.: On-line algorithms for steiner tree problems (extended abstract). In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 344–353. ACM Press, New York (1997)
Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)
Gupta, A., Hajiaghayi, M.T., Räcke, H.: Oblivious network design. In: SODA 2006: Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm, pp. 970–979. ACM Press, New York (2006)
Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Disc. Math. 4, 369–384 (1991)
Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for tsp, steiner tree, and set cover. In: STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing, pp. 386–395. ACM Press, New York (2005)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA 2000: Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 770–779. Society for Industrial and Applied Mathematics (2000)
Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, pp. 1–10. ACM Press, New York (2001)
Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10. ACM Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abraham, I., Malkhi, D., Ratajczak, D. (2009). Compact Multicast Routing. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)