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

Cheng Zhang; Wu Ma

doi:10.4028/www.scientific.net/AMM.556-562.5343

Paper Titles

The Study on the Methodology of Transactionevent in the Ale of Rfid Networks
p.5321

Research on the Route Optimization as to Timing Uncertainty of Wartime Transportation
p.5328

Seal-Calculus Based Dynamic Evolution Model for Internetware
p.5333

The Application Research of HR Performance Appraisal System Based on Collaboration OA System
p.5338

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

Research on the Search Strategy of Complex Network Based on Breadth-First
p.5348

Efficient Distributed RNN Query Processing with Caching
p.5352

Research of Optimizing Computer Network Based on Dynamism Theory
p.5356

Redundant Network Research Report
p.5359

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562Core Selection to Solve Multicast Routing with...

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

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

5343-5347

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.5343

Citation:

Cite this paper

Online since:

May 2014

Authors:

Cheng Zhang*, Wu Ma

Keywords:

Delay, Delay Variation, Multicast Routing, Routing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Satya Prakash Sahoo , Manas Ranjan Kabat and Ashis Kumar Sahoo. Tabu Search Algorithm for Core Selection in Multicast Routing, 2011 International Conference on Communication Systems and Network Technologie, 17: 121-126.

DOI: 10.1109/csnt.2011.11

Google Scholar

[2] S. M Chung, C. H Youn. Core Selection Algorithm for Multicast Routing Under Multiple QoS Constraints, 2000, 36, 378-379.

DOI: 10.1049/el:20000315

Google Scholar

[3] Oliveira C. A. S, Pardalos P. M. A Survey of Combinatorial Optimization Problems in Multicast Routing[J]. Computers and Operations Research, 2005, 32: 1953-(1981).

DOI: 10.1016/j.cor.2003.12.007

Google Scholar

[4] Pi-Rong Sheu, Shan-Tai Chen. A Fast and Efficient Heuristic Algorithm for The Delay and Delay Variation-bounded Multicast Tree Problem[J]. Computer Communications, 2002, 8(25): 825-833.

DOI: 10.1016/s0140-3664(01)00404-2

Google Scholar

[5] Ahn S, Kim M, Choo H. Efficient Algorithm for Reducing Delay Variation on Delay-Bounded Multicast Trees in Heterogeneous Networks[C]. IEEE Communication Society, WCNC proceedings, 2008: 2741-2746.

DOI: 10.1109/wcnc.2008.480

Google Scholar