Survivable traffic grooming for scheduled demands

There has been considerable research interest in the design of survivable grooming capable networks in recent years. For such networks, protection may take place at the lightpath level or at the connection level. The vast majority of the current work can be classified into one of two categories (i) static grooming, where the demands are allocated for the entire duration of the network and (ii) dynamic grooming, where the start times and durations of demands are generated randomly based on certain traffic distributions. In this paper, we propose a new technique for survivable traffic grooming under the scheduled traffic model that exploits knowledge of the connection holding times of traffic demands to lead to more efficient resource allocation. We present efficient integer linear program (ILP) formulations for the complete survivable traffic grooming problem in WDM networks. Our formulations can solve the joint problem of the topology design, traffic routing and RWA, using path protection at lightpath level. Our aim is to design a stable logical topology that can accommodate a collection of low-speed traffic demands with specified setup and teardown times. The objective function, considered in our ILP formulation, is to minimize the resource requirements. This can be easily modified to maximize the throughput under a given set of resources. We also have proposed a simplified version of our ILP formulations that can solve the problem in a way that is computationally more efficient. To the best of our knowledge, this is the first paper to address the survivable traffic grooming problem under the scheduled traffic model.

[1]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[2]  C. Siva Ram Murthy,et al.  Efficient dynamic traffic grooming in service-differentiated WDM mesh networks , 2004, Comput. Networks.

[3]  I. Chlamtac,et al.  Lightnets: Topologies for High-speed Optical Networks , 1993 .

[4]  B. Ramamurthy,et al.  A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks , 2005, IEEE Journal on Selected Areas in Communications.

[5]  Ying Chen,et al.  Quality of service based resource allocation for scheduled lightpath demands , 2007, Comput. Commun..

[6]  Arunita Jaekel,et al.  Resilient traffic grooming for WDM networks , 2008 .

[7]  Byrav Ramamurthy,et al.  Survivable traffic grooming in WDM mesh networks under SRLG constraints , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[8]  Jing Zhang,et al.  Efficient shared-path protection exploiting the knowledge of connection-holding time , 2005, Conference onOptical Network Design and Modeling, 2005..

[9]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2001, SIGMETRICS '01.

[10]  Wei Su,et al.  Scheduling of periodic connections with flexibility , 2006, Opt. Switch. Netw..

[11]  Bin Wang,et al.  Path-protection-based routing and wavelength assignment in wavelength-division multiplexing optical networks under a scheduled traffic model , 2006 .

[12]  Mark A. Shayman,et al.  Optical Network Design with Optical Constraints in IP/WDM Networks , 2005, IEICE Trans. Commun..

[13]  Arun K. Somani Survivability and Traffic Grooming in WDM Optical Networks , 2006 .

[14]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[15]  J. Li,et al.  Logical topology design for dynamic traffic grooming in WDM optical networks , 2006, Journal of Lightwave Technology.

[16]  Armando N. Pinto,et al.  Optical Networks: A Practical Perspective, 2nd Edition , 2002 .

[17]  Arun K. Somani,et al.  Traffic grooming for survivable WDM mesh networks , 2001, OptiComm: Optical Networking and Communications Conference.

[18]  Arunita Jaekel OPN09-02: Lightpath Scheduling and Allocation Under a Flexible Scheduled Traffic Model , 2006, IEEE Globecom 2006.

[19]  Biswanath Mukherjee,et al.  A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges , 2002 .

[20]  George N. Rouskas,et al.  A framework for hierarchical traffic grooming in WDM networks of general topology , 2005, 2nd International Conference on Broadband Networks, 2005..

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

[22]  Bin Wang,et al.  On optimal survivability design under a scheduled traffic model in wavelength-routed optical mesh networks , 2006, 4th Annual Communication Networks and Services Research Conference (CNSR'06).

[23]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[24]  Bin Wang,et al.  On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[25]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[26]  Sudhir S. Dixit,et al.  On the merit of IP/MPLS protection/restoration in IP over WDM networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[27]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[28]  Ying Chen,et al.  New Techniques for Efficient Traffic Grooming in WDM Mesh Networks , 2007, 2007 16th International Conference on Computer Communications and Networks.

[29]  Byrav Ramamurthy,et al.  Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[30]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[31]  Murti V. Salapaka,et al.  A practical approach to operating survivable WDM networks , 2002, IEEE J. Sel. Areas Commun..

[32]  T. Li,et al.  On optimal survivability design in WDM optical networks under a scheduled traffic model , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

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

[34]  Suresh Subramaniam,et al.  Survivable Traffic Grooming in WDM Optical Networks , 2006 .

[35]  Byrav Ramamurthy,et al.  Survivable traffic grooming with path protection at the connection level in WDM mesh networks , 2004, First International Conference on Broadband Networks.

[36]  Bin Wang,et al.  Traffic Grooming Under a Sliding Scheduled Traffic Model in WDM Optical Networks , 2004 .