The gain and cost of multicast routing trees

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 5, Issue , 2004, Pages 4625-4630

  Janic, Milena ^a   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Multicast; Shortest Path Tree; Steiner Minimum Tree; Uniform Recursive Tree

Indexed keywords

ALGORITHMS; BANDWIDTH; BROADCASTING; CHANNEL CAPACITY; COMPUTER SIMULATION; COSTS; DATA COMPRESSION; INTERNET; ROUTERS;

MULTICAST; SHORTEST PATH TREES; STEINER MINIMUM TREES; UNIFORM RECURSIVE TREES;

MULTICASTING;

EID: 15744362260     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Dover, 1968.
2. B. Bollobas, Random Graphs, Academic Press, 1981
3. B. Bollobas, D. Gamarnik, O. Riordan and B. Sudako, "On the value of a random minimum weight Steiner tree ", Combinatorica 24 (2004), 187-207.
4. R. Chalmers and K. Almeroth, "On the Topology of Multicast Trees", 153-165, IEEE Transactions on Networking, April 2003.
5. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "The origin of power laws in Internet topologies revisited", Proceedings of IEEE INFOCOM, 2002.
6. J. C.-I. Chuang and M. A. Sirbu, "Pricing multicast communications: A cost based approach", Proceedings of INET, 1998.
7. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, McGraw-Hill, 1995.
8. D. Dolev, O. Mokryn and Y. Shavitt, "On Multicast Trees: Structure and Size Estimation", Proceedings of IEEE INFOCOM, April 2003.
9. H. Einsiedler, P. Hurley, B. Stiller and T. Braun, "Charging Multicast Communications Based on A Tree Metric", Proceedings of Multicast Workshop, Braunschweig, Germany, 1999.
10. M. Faloutsos, P. Faloutsos, C. Faloutsos, "On Power-Law Relationships of the Internet Topology", Proceedings of SIGCOMM '99, pp. 251-262, August 1999.
11. W. Fenner and S. Casner, "A 'traceroute' acuity for IP multicast", Tech. Rep, draft-ietf-idmr-traceroute-ipm-*txt, Internet Engineering Talk Force (IETF), August 1998.
12. S. Herzog, S. Shenker, and D. Estrin, "Sharing the "cost" of multicast trees; An axiomatic analysis", IEEE Transactions on Networking, 5(6):847-860, 1997.
13. R. van der Hofstad, G. Hooghiemstra and P. Van Mieghem, "Size and Weight of Shortest Path Trees with Exponential LinkWeights", submitted to Combinatorica.
14. F. Hwang, D. Richards, P. Winter, The Steiner Tree Problem (Annals of Discrete Mathematics, Vol 53), North Holland, pp, 103, 1992.
15. M. Janic and P. Van Mieghem, "Inferring the Internet Topology based on Traceroute Measurements", Delft University of Technology, Technical Report, 2004.
16. G. Phillips, S. Shenker, H. Tangmunarunkit, "Scaling of Multicast Trees: Comments on the Chuang-Sirbu scaling law", Proceedings of SIGCOMM'99, August 1999.
17. R. T. Smythe and H. M. Mahmoud, "A Survey of Recursive Trees", Theor. Probability and Math Statist., No. 51, pp. 1-27, 1995.
18. P. Van Mieghem, Q. Hooghiemstra and R. van der Hofstad, "On the Efficiency of Multicast", IEEE/ACM Transactions on Networking, vol. 9, No. 6, pp. 719-732, 2001.
19. P. Van Mieghem, G. Hooghiemstra and R. van der Hofstad, "A Scaling Law for the Hopcount in Internet", report 2000125 (http://www.nas.ewi. tudelft.nl/people/Piet/teleconference.html).
20. P. Van Mieghem and M. Janic, "Stability of a Multicast Tree", in Proceedings of IEEE INFOCOM, July 2002.
21. http://www.caida.org.
22. RIPE Test Traffic Measurements, http://www.ripe.net/ripencc/memservices/ ttm/