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

2006 ◽  
Vol 29 (8) ◽  
pp. 998-1014 ◽  
Author(s):  
Ayşe Karaman ◽  
Hossam Hassanein
Keyword(s):  
Multicast Routing ◽  
Complexity Analysis ◽  
Core Selection ◽  
Selection Algorithms

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

2017 ◽  
Vol 31 (4) ◽  
pp. e3489
Author(s):  
Hovhannes A. Harutyunyan ◽  
Meghrig Terzian
Keyword(s):  
Multicast Routing ◽  
Selection Approach ◽  
Core Selection ◽  
Dynamic Tree ◽  
Delay Variation

Tabu Search Algorithm for Core Selection in Multicast Routing

2011 ◽  
Author(s):  
Satya Prakash Sahoo ◽  
Manas Ranajan Kabat ◽  
Asis Kumar Sahoo
Keyword(s):  
Tabu Search ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Core Selection

A Heuristic Algorithm for Core Selection in Multicast Routing

2011 ◽  
Vol 26 (6) ◽  
pp. 954-961 ◽  
Author(s):  
Manas Ranjan Kabat ◽  
Manoj Kumar Patel ◽  
Chita Ranjan Tripathy
Keyword(s):  
Heuristic Algorithm ◽  
Multicast Routing ◽  
Core Selection

Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints

2014 ◽  
Vol 556-562 ◽  
pp. 5343-5347
Author(s):  
Cheng Zhang ◽  
Wu Ma
Keyword(s):  
Multicast Routing ◽  
Cost Minimization ◽  
Low Complexity ◽  
Multicast Tree ◽  
Selection Function ◽  
The Core ◽  
Core Selection ◽  
And Performance ◽  
Shared Tree ◽  
Delay Variation

The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

Core selection algorithm for multicast routing under multiple QoS constraints

2000 ◽  
Vol 36 (4) ◽  
pp. 378 ◽  
Author(s):  
Sung Mo Chung ◽  
Chan-Hyun Youn
Keyword(s):  
Multicast Routing ◽  
Selection Algorithm ◽  
Core Selection ◽  
Multiple Qos Constraints ◽  
Multiple Qos
Sign in / Sign up

Export Citation Format

Share Document