Novel Virtual Source Based Multicast Routing Algorithm in WDM Networks with Sparse Light Splitting

2006 ◽  
Author(s):  
Peng Lin ◽  
Shuai Shi ◽  
Jian Li ◽  
Jie Zhang ◽  
Wanyi Gu
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Virtual Source ◽  
Sparse Light Splitting ◽  
Multicast Routing Algorithm

scholarly journals An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Huanlin Liu ◽  
Qinren Shen ◽  
Yong Chen
Keyword(s):  
Network Coding ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
The Other ◽  
Optical Wdm Networks ◽  
Optical Wdm ◽  
Optical Multicast ◽  
Multicast Routing Algorithm ◽  
Maximal Capacity

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

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 Multicast Routing to Improve Multicast Capacity with Minimal Network Coding Cellsin WDM Networks

2014 ◽  
Vol 35 (4) ◽  
Author(s):  
Huanlin Liu ◽  
Bangtao Zhou ◽  
Yong Chen
Keyword(s):  
Network Coding ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Minimal Network ◽  
Optical Wdm ◽  
Optical Multicast ◽  
Operation Costs ◽  
All Optical ◽  
Multicast Routing Algorithm

AbstractMulticast routing based on network coding can save large wavelength channels with high network coding operation costs for the all-optical WDM network. An optical multicast routing algorithm based on minimum network coding cells to reach the multicast max-flow is proposed in the paper. The algorithm selects path in the

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
Sign in / Sign up

Export Citation Format

Share Document