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

2013 ◽  
Author(s):  
Yin-fei Dai ◽  
Nian-feng Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithms ◽  
Dynamic Multicast ◽  
Comparison And Analysis

Several Non-Rearranged Dynamic Multicast Routing Algorithms

2013 ◽  
Vol 397-400 ◽  
pp. 1107-1112
Author(s):  
Yin Fei Dai ◽  
Nian Feng Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Performance Testing ◽  
Routing Algorithms ◽  
Delay Constraint ◽  
Advantages And Disadvantages ◽  
Routing Optimization ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

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.

Multicast Routing Algorithms Based on $Q$-Factor Physical-Layer Constraints in Metro Networks

2009 ◽  
Vol 21 (6) ◽  
pp. 365-367 ◽  
Author(s):  
G. Ellinas ◽  
N. Antoniades ◽  
T. Panayiotou ◽  
A. Hadjiantonis ◽  
A.M. Levine
Keyword(s):  
Multicast Routing ◽  
Physical Layer ◽  
Routing Algorithms ◽  
Q Factor ◽  
Metro Networks

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

Sign in / Sign up

Export Citation Format

Share Document