A new multi-granularity traffic grooming routing algorithm in IP over WDM networks

Optik ◽  
2011 ◽  
Vol 122 (11) ◽  
pp. 1019-1029 ◽  
Author(s):  
Weigang Hou ◽  
Lei Guo ◽  
Xingwei Wang
2004 ◽  
Author(s):  
Zhizhong Zhang ◽  
Yunlin Zhang ◽  
Qingji Zeng ◽  
Jianxin Wang ◽  
Tong Ye ◽  
...  

2005 ◽  
Author(s):  
Mingxia Bo ◽  
Xiaofei Pan ◽  
Fanghua Ma ◽  
Wanyi Gu

Author(s):  
Joana Socrates Dantas ◽  
Davide Careglio ◽  
Regina Melo Silveira ◽  
Wilson Vicente Ruggiero ◽  
Josep Sole-Pareta

Author(s):  
Bin Chen ◽  
DongHui Bao ◽  
Robert K. F. Teng ◽  
Ming Tang ◽  
Xiao-Hui Lin ◽  
...  

2011 ◽  
Vol 7 (4) ◽  
pp. 121
Author(s):  
M.Taynnan Barros ◽  
P.R. Lins Junior ◽  
M.Sampaio Alencar

The minimization of blocking probability is an important problem for the design of next generation high speednetworks. This problem is usually approached with an adaptive routing algorithm with traffic grooming, that is costly regarding improvements on network equipment. This paper presents the Clonal Selection Adaptive Routing Algorithm (CSA), a new routing algorithm for use in dynamic optical network. The algorithm uses a fitness function which adapts the route selection cost, minimizing the blocking. Its performance was evaluated considering the blocking probability with three different topologies, for high traffic, compared to the adaptive routing algorithm with traffic grooming. The results present a higher gain for the proposed approach, with no need to improvement on network equipment or conversion capabilities.


Sign in / Sign up

Export Citation Format

Share Document