An adaptive routing algorithm for flooding performance improving in GMPLS based WDM networks

2009 ◽  
Author(s):  
Jia Ren ◽  
Dahai Han ◽  
Lei Wang ◽  
Guanjun Gao ◽  
Jie Zhang ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Wdm Networks

Multi-class service based on the adaptive routing algorithm in WDM networks

2007 ◽  
Author(s):  
Zichun Le ◽  
Zhijun Zhu ◽  
Ran Zhu ◽  
Minglei Fu
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Wdm Networks

scholarly journals CSA: A Route Clonal Selection Algorithm for Dynamic WDM Networks

2011 ◽  
Vol 7 (4) ◽  
pp. 121
Author(s):  
M.Taynnan Barros ◽  
P.R. Lins Junior ◽  
M.Sampaio Alencar
Keyword(s):  
Clonal Selection ◽  
Fitness Function ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Traffic Grooming ◽  
Wdm Networks ◽  
Clonal Selection Algorithm ◽  
Network Equipment

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.

A lightpath length-aware adaptive routing algorithm for WDM networks

2005 ◽  
Vol 9 (8) ◽  
pp. 750-752 ◽  
Author(s):  
Y. Boujelben ◽  
J. Belhoste ◽  
S. Pierre
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Wdm Networks

An adaptive routing algorithm for integrated information networks

2019 ◽  
Vol 16 (7) ◽  
pp. 195-206 ◽  
Author(s):  
Feng Wang ◽  
Dingde Jiang ◽  
Sheng Qi
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Information Networks ◽  
Integrated Information

scholarly journals A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Wei Zhou ◽  
Zilong Tan ◽  
Shaowen Yao ◽  
Shipu Wang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Upper And Lower Bounds ◽  
Resource Location ◽  
Hop Count ◽  
Worst Case ◽  
Average Case ◽  
Splay Tree ◽  
Efficient Resource ◽  
P2p System

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.

A Novel Adaptive Routing Algorithm for Network-On-Chip

2011 ◽  
Vol 474-476 ◽  
pp. 413-416
Author(s):  
Jia Jia ◽  
Duan Zhou ◽  
Jian Xian Zhang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Network On Chip ◽  
Experimental Results ◽  
Average Latency ◽  
On Chip

In this paper, we propose a novel adaptive routing algorithm to solve the communication congestion problem for Network-on-Chip (NoC). The strategy competing for output ports in both X and Y directions is employed to utilize the output ports of the router sufficiently, and to reduce the transmission latency and improve the throughput. Experimental results show that the proposed algorithm is very effective in relieving the communication congestion, and a reduction in average latency by 45.7% and an improvement in throughput by 44.4% are achieved compared with the deterministic XY routing algorithm and the simple XY adaptive routing algorithm.

Sign in / Sign up

Export Citation Format

Share Document