On routes and multicast trees in the Internet

  • Authors:
  • Jean-Jacques Pansiot;Dominique Grad

  • Affiliations:
  • Université Louis Pasteur - LSIIT URA-CNRS 1871, Computer Science Department, 7, rue Descartes 67084 Strasbourg Cedex, France;Université Louis Pasteur - LSIIT URA-CNRS 1871, Computer Science Department, 7, rue Descartes 67084 Strasbourg Cedex, France

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

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.