Multicast routing algorithm proposal for decrease the session blocking probability in a dynamic WDM network

2016 ◽  
Author(s):  
M. Marta Barria ◽  
U. Jonathan Araya ◽  
C. Reinaldo Vallejos
Keyword(s):  
Multicast Routing ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Wdm Network ◽  
Multicast Routing Algorithm

A Multicast Routing Algorithm with Sparse Light Splitting Constrained

2010 ◽  
Vol 159 ◽  
pp. 412-419
Author(s):  
Li Du ◽  
Xiao Jing Wang ◽  
Li Lin ◽  
Han Yuan Zhang
Keyword(s):  
Multicast Routing ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Virtual Source ◽  
Minimum Path ◽  
Average Maximum ◽  
Path Cost ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Path Calculation

This paper investigates the defects that exist in the blocking probability and the cost of establishing light-tree in the multicast routing algorithm with sparse splitting capability constraint based on the Virtual Source (VS). It proposes a new multicast routing algorithm N_VSBA (New Virtual Source Based Algorithm). By introducing the minimum interference routing algorithm in the path calculation among the VS nodes, this new algorithm solves the problem of blocking caused by establishing the light-tree through a pre-computed path when two VS nodes concentrate. This algorithm also solves the problem of VS-based algorithm’s not being able to utilize the TaC (Tap and Continue) capability of indecomposable optical nodes by introduction of MPH (Minimum Path-cost Heuristic) algorithm into the process of adding light-tree into indecomposable nodes. Simulation results show that the new algorithm has improvements of different degrees in aspects of blocking probability, average number of wavelength links and average maximum number of wavelength.

A novel multicast routing algorithm in sparse splitting WDM network with power attenuation constraint

2009 ◽  
Vol 19 (2) ◽  
pp. 134-143 ◽  
Author(s):  
Jianping Wang ◽  
Junling Yuan ◽  
Xianwei Zhou ◽  
Xiaosong Yu
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Network ◽  
Multicast Routing Algorithm

Overlay multicast routing algorithm with minimum overlay cost

2009 ◽  
Vol 28 (10) ◽  
pp. 2569-2572
Author(s):  
Long-xin LIN ◽  
Jie ZHOU ◽  
Ling ZHANG ◽  
Zhao YE
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Overlay Multicast ◽  
Multicast Routing Algorithm

An Energy Balanced Ad Hoc Multicast Routing Algorithm

2012 ◽  
Vol 466-467 ◽  
pp. 425-429
Author(s):  
Qi Zhang ◽  
Hai Jun Xiong
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Energy Model ◽  
Specific Data ◽  
Routing Technology ◽  
Multicast Routing Algorithm ◽  
Energy Network

Multicast routing technology of Ad hoc network is a method of transferring specific data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. After the analysis of energy model and other routing algorithms ,an energy model and a balanced energy network multicast routing algorithm EBAMRA have been proposed in this article,. Experiments had been done, the simulation results show that this algorithm is feasible and effective, which provides a new and effective way of Ad hoc multicast routing technology.

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