Candidate core selection for load-balanced multicore shared tree multicasting

2016 ◽  
Author(s):  
Koushik Sinha ◽  
Bidyut Gupta ◽  
Shahram Rahimi ◽  
Ansuman Bhattacharya
Keyword(s):  
Core Selection ◽  
Selection For ◽  
Shared Tree ◽  
Load Balanced

QoS-constrained core selection for group communication

2007 ◽  
Vol 30 (7) ◽  
pp. 1600-1612 ◽  
Author(s):  
Ayşe Karaman ◽  
Hossam Hassanein
Keyword(s):  
Group Communication ◽  
Core Selection ◽  
Selection For

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.

Sign in / Sign up

Export Citation Format

Share Document