Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

2006 ◽  
Vol 19 (7) ◽  
pp. 554-564 ◽  
Author(s):  
Zhang Kun ◽  
Qi Yong ◽  
Zhang Hong
Keyword(s):  
Steiner Tree ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Steiner Tree Problem ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Delay Variation

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

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.

A DISTRIBUTED DYNAMIC HEURISTIC FOR DELAY-CONSTRAINED LEAST-COST MULTICAST ROUTING

2000 ◽  
Vol 01 (04) ◽  
pp. 331-344 ◽  
Author(s):  
Zhengying Wang ◽  
Bingxin Shi ◽  
Wei Liu
Keyword(s):  
Group Membership ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Network Resources ◽  
End To End Delay ◽  
Dynamic Multicast ◽  
Simulation Results ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.

Sign in / Sign up

Export Citation Format

Share Document