Title :
Multicast Routing Algorithm for packet networks with the application of the Lagrange Relaxation
Author :
Piechowiak, M. ; Stasiak, M. ; Zwierzykowski, P.
Author_Institution :
Dept. of Commun. & Comput. Networks, Poznan Univ. of Technol., Poznan, Poland
Abstract :
The paper presents a proposal of a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the MLRA (Multicast Routing Algorithm with Lagrange Relaxation) is to minimize the cost of paths between the source and each destination node using Lagrange relaxation, and eventually, minimize the total cost of multicast tree. A wide range of simulation experiments carried out by the authors for many network topologies and parameters confirmed the effectiveness of the proposed algorithm.
Keywords :
multicast communication; packet switching; telecommunication network routing; telecommunication network topology; Lagrange relaxation; multicast routing algorithm; multicast tree; network topologies; packet-switched networks; Delay; Generators; Internet; Lagrangian functions; Network topology; Routing; Topology; multicast; network topology; routing algorithms;
Conference_Titel :
Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 14th International
Conference_Location :
Warsaw
Print_ISBN :
978-1-4244-6704-4
Electronic_ISBN :
978-1-4244-6705-1
DOI :
10.1109/NETWKS.2010.5624921
