Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings
Journal of High Speed Networks
QoS Routing with Wavelengths Conversion and Call Admission Connection in DWDM Networks
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Electro-optic and wavelength conversion
IP Over WDM
IP- and wavelength-routing networks
IP Over WDM
Performance Evaluation of Shared Mesh Protection in WDM Networks
Cluster Computing
Dynamic wavelength assignment for WDM all-optical tree networks
IEEE/ACM Transactions on Networking (TON)
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Journal of Experimental Algorithmics (JEA)
A genetic algorithm for solving virtual source placement problem on WDM networks
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint computing and network resource scheduling in a lambda grid network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Review: Comparison of ILP formulations for the RWA problem
Optical Switching and Networking
Converter placement in all-optical networks using genetic algorithms
Computer Communications
Hi-index | 0.00 |
We consider the problem of routing and assignment of wavelength (RAW) in optical networks. Given a set of requests for all-optical connections (or lightpaths), the problem is to (a) find routes from the source nodes to their respective destination nodes, and (b) assign wavelengths to these routes. Since the number of wavelengths is limited, lightpaths cannot be established between every pair of access nodes. In this paper, we first consider the dynamic RAW problem where lightpath requests arrive randomly with exponentially distributed call holding times. Then, the static RAW problem is considered which assumes that all the lightpaths that are to be set-up in the network are known initially. Several heuristic algorithms have already been proposed for establishing a maximum number of lightpaths out of a given set of requests. However most of these algorithms are based on the traditional model of circuit-switched networks where routing and wavelength assignment steps are decoupled. In this paper a new graphtheoretic formulation of the RAW problem, dubbed as layered-graph, has been proposed which provides an efficient tool for solving dynamic as well as static RAW problems. The layered-graph model also provides a framework for obtaining exact optimal solution for the number of requested lightpaths as well as for the throughput that a given network can support. A dynamic and two static RAW schemes are proposed which are based on the layeredgraph model. Layered-graph-based RAW schemes are shown to perform better than the existing ones.