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

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.

Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection

2013 ◽  
Vol 373-375 ◽  
pp. 1182-1187
Author(s):  
Yuan Chen Li ◽  
Wei Qun Liu
Keyword(s):  
Real Time ◽  
Multicast Routing ◽  
Cost Minimization ◽  
Minimum Cost ◽  
Multicast Tree ◽  
Destination Node ◽  
Selection Methods ◽  
Routing Problem ◽  
Core Selection ◽  
Delay Variation

With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. 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. In addition, this core selection methods achieve 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, it can also meet the requirements of real-time network communication.

Multicast Routing with Delay and Delay Variation Constraints for Multimedia Applications

2004 ◽  
pp. 399-411 ◽  
Author(s):  
Shankar M. Banik ◽  
Sridhar Radhakrishnan ◽  
Chandra N. Sekharan
Keyword(s):  
Multicast Routing ◽  
Multimedia Applications ◽  
Delay Variation

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

scholarly journals Multicast routing with end-to-end delay and delay variation constraints

1997 ◽  
Vol 15 (3) ◽  
pp. 346-356 ◽  
Author(s):  
G.N. Rouskas ◽  
I. Baldine
Keyword(s):  
Multicast Routing ◽  
End To End Delay ◽  
End To End ◽  
Delay Variation
Sign in / Sign up

Export Citation Format

Share Document