Influence of routing and wavelength assignment algorithms on the blocking probability in wavelength-division-multiplexing all-optical network

2001 ◽  
Author(s):  
Yabin Ye ◽  
Hanyi Zhang ◽  
Yili Guo
Keyword(s):  
Wavelength Division Multiplexing ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Wavelength Division ◽  
All Optical ◽  
All Optical Network

Statistics study of routing and wavelength assignment algorithms in WDM all optical network

2000 ◽  
Vol 185 (4-6) ◽  
pp. 315-320 ◽  
Author(s):  
Yabin Ye ◽  
Hanyi Zhang ◽  
Tao Qin ◽  
Wuju Dai ◽  
Feifei Feng ◽  
...  
Keyword(s):  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
All Optical ◽  
All Optical Network

scholarly journals Routing Strategies in Survivable Optical Networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Routing Problem ◽  
Routing Strategy ◽  
Survivable Optical Networks ◽  
Conventional Algorithm ◽  
Better Than

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Sign in / Sign up

Export Citation Format

Share Document