Multicasting has an increasing importancefor 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.

No abstract

No abstract

No abstract