Research Note: Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms

Authors:
M. Shiva Kumar;P. Sreenivasa Kumar
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India
Venue:
Computer Communications
Year:
2002

Citing 7
Cited 2

Efficient algorithm for virtual topology design in multihop lightwave networks

IEEE/ACM Transactions on Networking (TON)
A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use

IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network

IEEE/ACM Transactions on Networking (TON)
Multiwavelength lightwave networks for computer communication

IEEE Communications Magazine
The hidden benefits of optical transparency

IEEE Communications Magazine
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

WDM network design by ILP models based on flow aggregation

IEEE/ACM Transactions on Networking (TON)
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper considers Wavelength Division Multiplexing (WDM) networks, which employ wavelength routing switches that enable the establishment of lightpaths through the network between node-pairs. Conventional Routing and Wavelength Assignment (RWA) algorithms for Static Lightpath Establishment (SLE) are based on traditional circuit-switched networks where routing and wavelength assignment steps are decoupled. In this paper, we propose new Integer Linear Program (ILP) formulations for maximizing network throughput for two different types of traffic patterns namely, uniform and non-uniform. In the proposed formulations, routing and wavelength assignment steps are tightly coupled, unlike earlier proposed formulations. However, for large size networks solving the ILP formulations can easily overwhelm the capabilities of today's state-of-art computing facilities. Hence, we propose two heuristic algorithms based on wavelength-graph for maximizing network throughput. Simulation studies indicate that the heuristic approach gives performance close to the optimal solution obtained using ILP based solution.