On routes and multicast trees in the Internet
- 1 January 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 28 (1) , 41-50
- https://doi.org/10.1145/280549.280555
Abstract
Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they cannot be used directly in the Internet since most inter-domain routers do no implement multicasting. Thus these protocols are mainly tested either on a small scale inside a domain, or through the Mboné, whose topology is not really the same as Internet topology. The purpose of this paper is to construct a graph using actual routes of the Internet, and then to use this graph to compare some parameters - delays, scaling in term of state or traffic concentration - of multicast routing trees constructed by different algorithms - source shortest path trees and shared trees.Keywords
This publication has 4 references indexed in Scilit:
- Multicast routing extensions for OSPFCommunications of the ACM, 1994
- Core based trees (CBT)Published by Association for Computing Machinery (ACM) ,1993
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- A fast algorithm for Steiner treesActa Informatica, 1981