Enhanced Sharing in Edge for Multicast Routing Algorithm in Communication Networks
碩士 === 國立屏東科技大學 === 資訊管理系所 === 95 === Multicast routing is a key issue in communication networks. The efficiency of multicast routing affects communication quality, especially in multimedia communication networks. In the past, the researches regarding multicast routing focus on heuristic techniques...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31580393330933117378 |
| Summary: | 碩士 === 國立屏東科技大學 === 資訊管理系所 === 95 === Multicast routing is a key issue in communication networks. The efficiency of multicast routing affects communication quality, especially in multimedia communication networks. In the past, the researches regarding multicast routing focus on heuristic techniques like Genetic Algorithms or Ant System, and the others is modified and based on traditional methods such as Dijkstra's algorithm or Prim's algorithm.
This thesis presents an approach called ESMA to solve the multimedia multicast routing problem in communication networks. The presented algorithm is based on Dijkstra's algorithm and using enhanced sharing in edge concept to obtain minimal cost in minimum spanning tree and thus get the optimal solution for multicast routing. According to computer simulation results, the proposed ESMA algorithm outperforms some existing well-known related approaches in effectiveness and efficiency comparisons.
|
|---|