Dynamic light trail routing in WDM optical networks

Fiber optics have replaced copper as the primary transmission medium. Wavelength Division Multiplexing (WDM) networks effectively increase single-link bandwidth from 10 Mbps to over 160 Gbps, and have been considered as a promising candidate for the next-generation backbone network. All optical circuits each on a separate wavelength called lightpaths represent the first major method for optical communication. The granularity provided between a source and destination node is that of a complete wavelength. Once a lightpath is set up, the entire wavelength is used exclusively by the connection’s source and destination node-pair. No sub-wavelength sharing between nodes along the lightpath is allowed. However, it is often observed that the bandwidth requirement in today’s network is often dynamically varying and does not justify the need for allocating an entire wavelength. Therefore, the wavelength capacity may be underutilized. A new technology termed light trail was proposed to avoid the inability of intermediate nodes to use a connection wavelength, and the constant reconfiguration of switches. In this article, we study dynamic light trail routing in a WDM optical network. We present an efficient algorithm for establishing a light trail routing for a new connection request, while using minimum network resources. We also study survivable network routing using the proposed light trail technology. We present an efficient heuristic for computing a pair of working and protection light trails for a dynamic incoming connection request. Simulation results are presented which demonstrate the advantages of our routing schemes.

[1]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[2]  Imrich Chlamtac,et al.  Light-frames: A pragmatic framework for optical packet transport , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Imrich Chlamtac,et al.  Light-trails: a novel conceptual framework for conducting optical communications , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[4]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[5]  J. P. C. Blanc.  An algorithmic solution of polling models with limited service disciplines , 1992, IEEE Trans. Commun..

[6]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[7]  An Ge,et al.  On optical burst switching and self-similar traffic , 2000, IEEE Communications Letters.

[8]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

[9]  Arun Kumar Somani,et al.  ON SURVIVABLE DESIGN IN LIGHT TRAIL OPTICAL NETWORKS , 2003 .

[10]  A.K. Somani,et al.  Light trails: a sub-wavelength solution for optical networking , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[11]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[12]  Arun K. Somani,et al.  Optimal light trail design in WDM optical networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[13]  Arunabha Sen,et al.  Routing with many additive QoS constraints , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[14]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[15]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[17]  Salim Tariq,et al.  A heuristic approach for dynamically reducing the number of Light Trails in Survivable Optical Networks , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

[18]  Imrich Chlamtac,et al.  Light-Trails: A Solution to IP Centric Communication in the Optical Domain , 2003, QoS-IP.

[19]  Imrich Chlamtac,et al.  Mesh implementation of light-trails: a solution to IP centric communication , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[20]  G. Xue,et al.  Polynomial time approximation algorithms for multi-constrained QoS routing , 2008, TNET.

[21]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[22]  Imrich Chlamtac,et al.  Lightpath communications: a novel approach to optical wans , 1990 .

[23]  Khaled M. F. Elsayed,et al.  Enhanced Optimal and Heuristic Solutions of the Routing Problem in Light-Trail Networks , 2007, 2007 Workshop on High Performance Switching and Routing.

[24]  Ashwin Gumaste,et al.  DWDM Network Designs and Engineering Solutions , 2002 .

[25]  Arun K. Somani,et al.  Light-Trail Networks: Design and Survivability , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[26]  Wang Sheng.  On Survivable Design in Light Trail WDM Optical Networks , 2005 .

[27]  R. Ravikanth,et al.  Optical burst switching: a viable solution for terabit IP backbone , 2000 .

[28]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[29]  Imrich Chlamtac,et al.  Optimizing light-trail assignment to WDM networks for dynamic IP centric traffic , 2004, The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004..