Virtual Source-Based Minimum Interference Path Multicast Routing with Differentiated QoS Guarantees in the Next Generation Optical Internet

2005 ◽  
pp. 178-185
Author(s):  
Suk-Jin Lee ◽  
Kyung-Dong Hong ◽  
Chun-Jai Lee ◽  
Moon-Kyun Oh ◽  
Young-Bu Kim ◽  
...  
Keyword(s):  
Multicast Routing ◽  
Virtual Source ◽  
Next Generation ◽  
Optical Internet ◽  
Qos Guarantees ◽  
Minimum Interference

Virtual source-based minimum interference path multicast routing in optical virtual private networks

2006 ◽  
Vol 13 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Jun-Mo Jo ◽  
Suk-Jin Lee ◽  
Kyung-Dong Hong ◽  
Chun-Jai Lee ◽  
Oh-Han Kang ◽  
...  
Keyword(s):  
Multicast Routing ◽  
Virtual Private Networks ◽  
Virtual Source ◽  
Minimum Interference

scholarly journals Unencapsulated Mobile Multicast Routing for Next Generation Video Networks

2006 ◽  
pp. 1050-1057
Author(s):  
Thomas C. Schmidt ◽  
Matthias Wählisch ◽  
Hans L. Cycon ◽  
Mark Palkow ◽  
Henrik Regensburg
Keyword(s):  
Multicast Routing ◽  
Next Generation ◽  
Mobile Multicast ◽  
Mobile Multicast Routing

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.

Sign in / Sign up

Export Citation Format

Share Document