ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
On routes and multicast trees in the Internet
Full text PdfPdf (1.21 MB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 28 ,  Issue 1  (January 1998) table of contents
Pages: 41 - 50  
Year of Publication: 1998
ISSN:0146-4833
Authors
Jean-Jacques Pansiot  Université Louis Pasteur - LSIIT URA-CNRS 1871, Computer Science Department, 7, rue Descartes 67084 Strasbourg Cedex, France
Dominique Grad  Université Louis Pasteur - LSIIT URA-CNRS 1871, Computer Science Department, 7, rue Descartes 67084 Strasbourg Cedex, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 45,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/280549.280555
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
[Cal 83] R. Callon, Internet protocol, Proceedings of the IEEE, 71(12), Dec. 1983.
 
3
[DEF97] S. Deering, D. Estrin, D. Farinacci, V. Jacobson, A. Helmy, L. Wei, Protocol Independent Multicast Version 2, Dense Mode Specification, Work in progress, Internet Draft, draft-ietf-idmr-pim-dm-05, May. 97, 12 p.
 
4
[EFD 97] D. Estrin, D. Farinacci, S. Deering and al., Protocol Independent Multicast-Sparse mode (PIM-SM) : Protocol Specification, Work in progress, Internet Draft, draft-ietf-idmr-PIM-SM-specv2-10, Sep. 97, 52 p.
 
5
[GPZ 96] D. Grad, JJ. Pansiot, S. Marc-Zwecker, Distributed Computation of Reduced Multicast Trees, Proceedings of TDP'96, La Londe les Maures, Jun. 96, pp. 91-107.
 
6
[KMB 81] L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15, pp. 141-145, 1981.
 
7
8
 
9
[PGZ95] J-J. Pansiot, D. Grad, S. Marc-Zwecker, Towards a Logical Addressing and Routing Sublayer for Internet Multicasting, Proceedings of PROMS'95 Salzburg, Austria, Oct. 9-12 95, pp. 521-535.
 
10
[Pos 81a] J. Postel, Internet Protocol, Network Information Center, Request for Comments, RFC0791, Jan. 91, 45 p.
 
11
 
12
[Wax 88] B.M. Waxman, Routing on Multipoint Connections, IEEE Journal of Selected Areas in Communications, Vol. 6, No. 9, Dec. 88.
 
13

CITED BY  38

Collaborative Colleagues:
Jean-Jacques Pansiot: colleagues
Dominique Grad: colleagues