Comparison and analysis of several non-rearranged dynamic multicast routing algorithms

Author(s):  
Yin-fei Dai ◽  
Nian-feng Li
2013 ◽  
Vol 397-400 ◽  
pp. 1107-1112
Author(s):  
Yin Fei Dai ◽  
Nian Feng Li

In this paper, dynamic multicast routing and routing optimization criteria have been described.By comparing and analyzing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms, the advantages of the non-rearranged dynamic multicast routing algorithm based on the delay constraint have been further confirmed and a conclusion has been drawn by performance testing.


2009 ◽  
Vol 21 (6) ◽  
pp. 365-367 ◽  
Author(s):  
G. Ellinas ◽  
N. Antoniades ◽  
T. Panayiotou ◽  
A. Hadjiantonis ◽  
A.M. Levine

2008 ◽  
Vol 9 (6) ◽  
pp. 791-798
Author(s):  
Li Zhu ◽  
Zhi-shu Li ◽  
Liang-yin Chen ◽  
Yan-hong Cheng

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang

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


Sign in / Sign up

Export Citation Format

Share Document