Please use this identifier to cite or link to this item:

TitleDirected trees in multicast routing
Author(s)Nicolau, Maria João
Costa, António
Santos, Alexandre
Freitas, Vasco
KeywordsMulticast routing
Directed trees
Issue date24-May-2003
JournalLecture Notes in Computer Science
CitationINTERNATIONAL WORKSHOP ON QOS IN MULTISERVICE IP NETWORKS (QOS-IP), 2, Milão, 2003. Heidelberg : Springer, 2003. ISBN 3-540-00604-4. p 320-333.
Series/Report no.Lecture notes in computer science ; 2601.
Abstract(s)Traditional multicast routing protocols use RPF (Reverse Path Forwarding) concept to build multicast trees. This concept is based upon the idea that an actual delivery path to a node is the reverse of the path from this node to the source. This concept fits well in symmetric environments, but in a routing environment where Quality of Service is considered the guarantee that a symmetrical path will exist between two network addresses is broken. Available network resources impose specific Quality of Service asymmetries, therefore reverse path routing may not be used. In this paper a new multicast routing strategy is proposed, enabling directed trees establishment, instead of reverse path ones. This new strategy, DTMP- Directed Trees Multicast Routing, is then implemented and simulated using Network Simulator. Simulation results, driven from several scenarios are presented, analyzed and compared with PIM-SM.
TypeConference paper
AccessOpen access
Appears in Collections:DI/CCTC - Artigos (papers)
DSI - Sistemas de Computação e Comunicações

Files in This Item:
File Description SizeFormat 
paper-qosip2003.pdfFull Text205,68 kBAdobe PDFView/Open
qosip2003-bibitem.txtBibitem361 BTextView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID