An effective heuristic algorithm for dynamic multicast routing with delay-constrained

2004 ◽  
Author(s):  
ZhengQuan Xu ◽  
Lin Chen
Keyword(s):  
Heuristic Algorithm ◽  
Multicast Routing ◽  
Dynamic Multicast

Two-stage evolutionary algorithm for dynamic multicast routing in mesh network

2008 ◽  
Vol 9 (6) ◽  
pp. 791-798
Author(s):  
Li Zhu ◽  
Zhi-shu Li ◽  
Liang-yin Chen ◽  
Yan-hong Cheng
Keyword(s):  
Evolutionary Algorithm ◽  
Multicast Routing ◽  
Mesh Network ◽  
Two Stage ◽  
Dynamic Multicast

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Dynamic multicast routing in VLSI

2000 ◽  
Vol 23 (11) ◽  
pp. 1055-1063 ◽  
Author(s):  
L.S Kei ◽  
T Srikanthan
Keyword(s):  
Multicast Routing ◽  
Dynamic Multicast
Sign in / Sign up

Export Citation Format

Share Document