Compact multicast routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5805 LNCS, Issue , 2009, Pages 364-378

  Abraham, Ittai ^a   Malkhi, Dahlia ^a   Ratajczak, David ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL MESSAGES; DISTRIBUTED NETWORKS; MAXIMUM RATIO; MULTICAST ROUTES; MULTICAST ROUTING; MULTICAST SERVICES; MULTICAST TREE; MULTICASTS; ONLINE VERSIONS; POLYLOGARITHMIC; ROUTING SCHEME; ROUTING TABLE; STEINER TREES; STRETCH FACTOR; TARGET NODES; TOTAL COSTS;

COSTS; NETWORK ROUTING;

MULTICASTING;

EID: 76649142704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04355-0_40     Document Type: Conference Paper

References (13)

1. 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)
2. 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)
3. 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)
4. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503-513. IEEE Computer Society Press, Los Alamitos (1990)
5. 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)
6. 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)
7. 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)
8. Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Disc. Math. 4, 369-384 (1991)
9. 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)
10. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
11. 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)
12. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, pp. 1-10. ACM Press, New York (2001)
13. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1-10. ACM Press, New York (2001)