Congestion-based algorithms for online routing in optical WDM mesh networks

Ajay Todimala, Byrav Ramamurthy
January 2003
Cite URL

Abstract

All-optical networks are becoming increasingly popular for high bandwidth connections. With the advent of the crossconnect technology, optical connections can be established dynamically. Routing and wavelength assignment are important issues in such networks. This work focuses on the routing issue in networks. Two online algorithms are presented that compute a route among all feasible routes for a node pair based on hop length of the path and congestion in the network. Simulations are conducted on sample network topologies with Poisson traffic and exponential call holding times. Results show that shortest hop least congested routing technique performs better than other previous techniques in terms of blocking probability.

Type
Conference paper
Publication
Proc. IASTED Int. Conf. CIIT’03
Blocking Probability Congestion Congestion Control Crossconnect Technology Network Topologies Online Algorithms Optical Connections Routing and Wavelength Assignment (RWA) Routing Technique
Byrav Ramamurthy
Byrav Ramamurthy
Professor & PI

My research areas include optical and wireless networks, peer-to-peer networks for multimedia streaming, network security and telecommunications. My research work is supported by the U.S. National Science Foundation, U.S. Department of Energy, U.S. Department of Agriculture, NASA, AT&T Corporation, Agilent Tech., Ciena, HP and OPNET Inc.