Earticle

초록

영어

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

키워드

저자

• Weijun Yang [ Department of Electromechanical Engineering, Guangzhou City Polytechnic, Guangzhou, China ] Corresponding Author
• Xiaodong Wang [ Department of Electromechanical Engineering, Guangzhou City Polytechnic, Guangzhou, China ]
• Yuanfeng Chen [ Department of Electromechanical Engineering, Guangzhou City Polytechnic, Guangzhou, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Smart Home

• 간기

  격월간

• pISSN

  1975-4094

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605