Dynamic mimimum path cost heuristic algorithm

Hu Guangmin; Li Lemin; An Hongyan

Volume 25 Issue 1

Jan. 2003

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2003 > 25(1): 88-93

Hu Guangmin, Li Lemin, An Hongyan. Dynamic mimimum path cost heuristic algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(1): 88-93.

Citation:

Hu Guangmin, Li Lemin, An Hongyan. Dynamic mimimum path cost heuristic algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(1): 88-93.

Hu Guangmin, Li Lemin, An Hongyan. Dynamic mimimum path cost heuristic algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(1): 88-93.

Citation:

Hu Guangmin, Li Lemin, An Hongyan. Dynamic mimimum path cost heuristic algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(1): 88-93.

PDF( 855 KB)

Dynamic mimimum path cost heuristic algorithm

Hu Guangmin^{①;李乐民},
Li Lemin,
An Hongyan

Received Date: 2001-07-16
Rev Recd Date: 2001-12-18
Publish Date: 2003-01-19

Abstract

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.

FullText(HTML)

References(1)

References

P. Winter, Steiner problem in networks: a survey , Networks, 1987, 17(2), 129-167.[2]Wang Bin, C. Jennifer Hou, Multicast routing and its QoS extension: problem, algorithms and protocols, IEEE Network, 2000, 14(1), 22-35.[3]B.M. Waxman, Routing of multipoint connections, IEEE J. on Selected Areas in Communications, 1988, 6(9), 1617-1622.[4]J. Kadirire.[J].G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched network, IEEE INFOCOM95, Boston, IEEE.1995,:-[5]Hwa-Chun Lin.[J].Shou-Chuan Lai, VTDM-A dynamic multicast routing algorithm, IEEE INFOCOM98, San Francisco, IEEE.1998,:-[6]龙元香,廖建新,陈俊亮,动态启发式最小生成树多播路由算法,北京邮电大学学报,1999,22(3),29-33.

Relative Articles

Supplements(0)

Cited By

Proportional views