Core-selection algorithms in multicast routing - comparative and complexity analysis

Authors:
Ayşe Karaman;Hossam Hassanein
Affiliations:
Telecommunications Research Lab, School of Computing, Queen's University, Kingston Ont., Canada K7L 3N6;Telecommunications Research Lab, School of Computing, Queen's University, Kingston Ont., Canada K7L 3N6
Venue:
Computer Communications
Year:
2006

Citing 5
Cited 7

Multicast routing extensions for OSPF

Communications of the ACM
The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
Mechanisms for broadcast and selective broadcast

Mechanisms for broadcast and selective broadcast
Multicast routing for real-time communication of high-speed networks

Multicast routing for real-time communication of high-speed networks
Distributed center-location algorithms

IEEE Journal on Selected Areas in Communications

QoS-constrained core selection for group communication

Computer Communications
Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

Computer Networks: The International Journal of Computer and Telecommunications Networking
Latency reduction by dynamic core selection and partial migration of game state

Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games
The partial migration of game state and dynamic server selection to reduce latency

Multimedia Tools and Applications
Tabu search algorithm for RP selection in PIM-SM multicast routing

Computer Communications
Performance evaluation of multisource Application Layer Multicast (ALM): Theoretical and simulative aspects

Computer Networks: The International Journal of Computer and Telecommunications Networking
PIM-SM protocol with GRASP-RP selection algorithm based architecture to transparent mobile sources in multicast mobile IPV6 diffusion

Journal of Mobile Multimedia

Quantified Score

Hi-index	0.24

Visualization

Abstract

The Core-based approach is inevitable in multicast routing protocols as it provides efficient management of multicast path in changing group memberships, and scalability and performance. In this paper, we present a comprehensive analysis of this approach with the emphasis on core selection for the first time in literature. We first examine the evolution of multicast routing protocols into the core-based architecture and the motivation for the approach. Then we review the core-selection algorithms in the literature emphasizing their algorithmic structure and performance. Our study involves an extensive computational and message complexity analysis of each algorithm, and a classification for their deployment characteristics and algorithmic complexities. To the best of our knowledge ours is the first attempt towards providing such extensive comparative analysis of core-based multicast routing protocols.