|
|
|
| Dynamic mimimum path cost heuristic algorithm |
| Hu Guangmin①; Li Lemin①; An Hongyan② |
| ①National Key Lab of Fiber Communication UEST of China Chengdu 610054 China;②Department of Applied Mathematics Chengdu Univ. of Tech.,Chengdu 610059 China |
|
|
|
|
Abstract In IP multicast network, how to choose appropriate multicast routes and optimize the configuration for reducing the cost of multicast are the key to popularize the multicast service. Aiming at characteristics of multicast routing algorithm and weakness of existing algorithm, a new dynamic multicast routing algorithm called Dynamic Minimum Path cost Heuristic (DMPH) is introduce. The simulation results show that the cost of tree from DMPH is similar to that of tree from static algorithm, and DMPH is faster than existing dynamic algorithms.
|
|
Received: 16 July 2001
|
|
|
|
|
|
|
|
|
2003, Vol. 25 
