Skip Navigation
York U: Redefine the PossibleHOME | Current Students | Faculty & Staff | Research | International
Search »FacultiesLibrariesCampus MapsYork U OrganizationDirectorySite Index
Future Students, Alumni & Visitors
2008 Technical Reports

Multicast Routing Algorithms

Uyen Trang Nguyen and Hoang Lan Nguyen

Technical Report CSE-2008-08

York University

October 9, 2008


Multicast is an efficient form of communication that delivers information from a source tomultiple destinations simultaneously. Given a wide range of multicast applications, numerousmulticast routing algorithms have been defined to satisfy different requirements of various applications.In addition, given a multicast routing algorithm and metric, the same application mayperform differently in different types of networks. Designing an appropriate routing algorithmfor a multicast application is crucial to ensure its optimal performance in the target network.It is important to have a broad view of multicast routing algorithms in relation to performancerequirements of applications and network characteristics. In this article, we present a surveyof multicast routing algorithms in the wireline Internet and wireless multi-hop networks. Wealso review routing metrics and multicast routing implementation issues, and discuss issues andchallenges for future research.

Download paper in PDF format.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.