Several Non-Rearranged Dynamic Multicast Routing Algorithms

Yin Fei Dai; Nian Feng Li

doi:10.4028/www.scientific.net/AMM.397-400.1107

Paper Titles

Application of Reverse Design in Wine Packaging Container Design
p.1088

B-Spline Curve Approximation Using Feature Points
p.1093

The Research of Adaptive Robust Predictive Current Control Algorithm of Permanent Magnet Synchronous Motors
p.1099

Load Prediction of RBF Neural Network Considering Weather Factors
p.1103

Several Non-Rearranged Dynamic Multicast Routing Algorithms
p.1107

Reactive Power Compensation of Oilfield Distribution Systems Based on Tabu Search Algorithm
p.1113

Parallel Ant Colony Algorithm Based on Award-Punishment Mechanism and its Application on Wireless Sensor Network Routing
p.1117

Research on Re-Use Reverse Logistics Network of Disused Electric Appliances Based on Election Campaign Algorithm
p.1121

Optimal Design of CNC Crushing Machine Steady Based on Genetic Algorithm
p.1129

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 397-400Several Non-Rearranged Dynamic Multicast Routing...

Several Non-Rearranged Dynamic Multicast Routing Algorithms

Abstract:

In this paper, dynamic multicast routing and routing optimization criteria have been described.By comparing and analyzing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms, the advantages of the non-rearranged dynamic multicast routing algorithm based on the delay constraint have been further confirmed and a conclusion has been drawn by performance testing.

You might also be interested in these eBooks

Advanced Design and Manufacturing Technology III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 397-400)

Pages:

1107-1112

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.397-400.1107

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yin Fei Dai, Nian Feng Li

Keywords:

Delay Constraint, Dynamic Multicast, Greedy Algorithm, On-Line Steiner Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. E. Dreyfus and R. A. Wagner. The Steiner Problem is graphs, Networks, vol. 1, no. 3, pp.195-207, (1971).

Google Scholar

[2] Garey M L, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W H Freeman, (1979).

Google Scholar

[3] Li Hanbing and Yu Jianping. Random Searching Multicast Tree Generating Algorithm [J]. Journal of China Institute of Communications, No. 9, pp.53-57, (2000).

Google Scholar

[4] Yu Yanping. An Improved Algorithm for Steiner Trees [J]. Journal of China Institute of Communications. No. 11, pp.35-40, (2002).

Google Scholar

[5] Li Xiongfei, Zang Xuebai, Xun Dandan and Dong Yuanfang. Simulation of Dynamic Multicast in Random Network [J]. Journal of Jilin University, vol. 21, No. 3 pp.265-268, (2003).

Google Scholar