Approximating Optimal Survivable Routing in WDM Optical Networks under a Scheduled Traffic Model

2006 ◽  
Author(s):  
Tianjian Li ◽  
Bin Wang
Keyword(s):  
Optical Networks ◽  
Traffic Model ◽  
Wdm Optical Networks ◽  
Scheduled Traffic

Performance Modeling and Analysis of WDM Optical Networks under Wavelength Continuity Constraint using MILP

2020 ◽  
Vol 13 (2) ◽  
pp. 203-211 ◽  
Author(s):  
Swati Bhalaik ◽  
Ashutosh Sharma ◽  
Rajiv Kumar ◽  
Neeru Sharma
Keyword(s):  
Network Design ◽  
Optical Networks ◽  
Wavelength Division Multiplexing ◽  
Optical Network ◽  
Optimal Path ◽  
Topology Design ◽  
Mixed Integer ◽  
Wdm Optical Networks ◽  
Virtual Topology ◽  
Wdm Network

Objective: Optical networks exploit the Wavelength Division Multiplexing (WDM) to meet the ever-growing bandwidth demands of upcoming communication applications. This is achieved by dividing the enormous transmission bandwidth of fiber into smaller communication channels. The major problem with WDM network design is to find an optimal path between two end users and allocate an available wavelength to the chosen path for the successful data transmission. Methods: This communication over a WDM network is carried out through lightpaths. The merging of all these lightpaths in an optical network generates a virtual topology which is suitable for the optimal network design to meet the increasing traffic demands. But, this virtual topology design is an NP-hard problem. This paper aims to explore Mixed Integer Linear Programming (MILP) framework to solve this design issue. Results: The comparative results of the proposed and existing mathematical models show that the proposed algorithm outperforms with the various performance parameters. Conclusion: Finally, it is concluded that network congestion is reduced marginally in the overall performance of the network.

Sign in / Sign up

Export Citation Format

Share Document