원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The minimum Steiner tree problem is an NP-complete problem in multicast routing algorithms. In this paper, an improved algorithm called the prior nodes minimum cost path heuristic (PNMPH) algorithm is presented according to the shortage of the minimum cost path heuristic (MPH) algorithm, in which some paths that pass through prior destination nodes are selected first. It partly shares links in the network and decreases the cost of the multicast routing tree. It is also closer to the optimal solution with the time complexity O(n3). The simulation results on the existing networks show that the cost of the PNMPH algorithm is lower than that of the MPH algorithm in the case of more than 90%.
목차
Abstract
1. Introduction
2. Definitions of Multicast Minimal Generating Trees (Steiner Trees)
3. Multicast Routing Algorithms
3.1. Heuristic Algorithms
3.2. Description of the MPH Algorithm
4. Prior Nodes Minimum Cost Path Heuristic Algorithm (PNMPH)
4.1. Description of PNMPH Algorithm
4.2. An Example of the PNMPH Algorithm
4.3. Analysis of PNMPH Algorithm
5. Simulation Experiment
6. Conclusion
References
1. Introduction
2. Definitions of Multicast Minimal Generating Trees (Steiner Trees)
3. Multicast Routing Algorithms
3.1. Heuristic Algorithms
3.2. Description of the MPH Algorithm
4. Prior Nodes Minimum Cost Path Heuristic Algorithm (PNMPH)
4.1. Description of PNMPH Algorithm
4.2. An Example of the PNMPH Algorithm
4.3. Analysis of PNMPH Algorithm
5. Simulation Experiment
6. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보