Holding-time-aware dynamic traffic grooming algorithms based on multipath routing for WDM optical networks

This paper investigates approaches for the traffic grooming problem that consider connection holding-times and bandwidth availability. Moreover, solutions can indicate the splitting of connections into two or more sub-streams by multipath routing and fine-tuned by traffic grooming to utilize network resources better. Algorithms are proposed and the results of simulations using a variety of realistic scenarios indicate that the proposed algorithms significantly reduce the blocking of connection requests yet promote a fair distribution of the network resources in relation to the state-of-the-art solutions.

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

[2]  Ajmal Muhammad,et al.  Reducing blocking probability in dynamic WDM networks using different schemes , 2011, 2011 International Conference on the Network of the Future.

[3]  Ying Chen,et al.  Energy-aware scheduling and resource allocation for periodic traffic demands , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[4]  Nelson Luis Saldanha da Fonseca,et al.  Load Balancing for Holding-Time-Aware Dynamic Traffic Grooming , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[5]  Ali Munir,et al.  Requests provisioning algorithms for Dynamic Optical Circuit Switched (DOCS) networks: A survey , 2009, 2009 IEEE 13th International Multitopic Conference.

[6]  Nelson Luis Saldanha da Fonseca,et al.  Algorithm for traffic grooming of batches of deadline-driven requests , 2013, 2013 IEEE International Conference on Communications (ICC).

[7]  Krishna M. Sivalingam,et al.  Performance study of IP and SONET grooming in optical WDM mesh networks , 2007 .

[8]  Daniel A. Spielman.  The Smoothed Analysis of Algorithms , 2005, FCT.

[9]  Biswanath Mukherjee,et al.  Survivable Multipath Provisioning with Differential Delay Constraint in Telecom Mesh Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  Ying Chen,et al.  Joint scheduling and virtual topology design for sliding periodic traffic , 2013, Opt. Switch. Netw..

[11]  Energy Aware Resource Allocation Based on Demand Bandwidth and Duration , 2012, ANT/MobiWIS.

[12]  Guy Pujolle,et al.  Service level agreement and provisioning in optical networks , 2004, IEEE Communications Magazine.

[13]  L Padhi,et al.  Multi-path routing in optical WDM networks: Even versus uneven split bandwidth allocation , 2010, 2010 International Conference on Signal Processing and Communications (SPCOM).

[14]  George N. Rouskas,et al.  A Tutorial on Optical Networks , 2002, NETWORKING Tutorials.

[15]  Marwan Krunz,et al.  Minimizing the differential delay for virtually concatenated Ethernet over SONET systems , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[16]  Nelson Luis Saldanha da Fonseca,et al.  On the Benefits of Multipath Routing for Distributed Data-Intensive Applications with High Bandwidth Requirements and Multidomain Reach , 2009, 2009 Seventh Annual Communication Networks and Services Research Conference.

[17]  Gerardus Sierksma,et al.  Linear and integer programming - theory and practice , 1999, Pure and applied mathematics.

[18]  Asad Ali,et al.  Multi-path traffic grooming in DOCS , 2011, 8th International Conference on High-capacity Optical Networks and Emerging Technologies.

[19]  Dennis Gannon,et al.  Workflows for e-Science, Scientific Workflows for Grids , 2014 .

[20]  Nelson Luis Saldanha da Fonseca,et al.  A Multipath Routing Mechanism in Optical Networks with Extremely High Bandwidth Requests , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[21]  Nelson Luis Saldanha da Fonseca,et al.  Multipath routing with topology aggregation for scalable inter-domain service provisioning in optical networks , 2012, Opt. Switch. Netw..

[22]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[23]  Ali Munir,et al.  Holding time aware dynamic bandwidth allocation algorithm for emerging bandwidth on demand multicast applications , 2009, 2009 6th International Symposium on High Capacity Optical Networks and Enabling Technologies (HONET).

[24]  Lena Wosinska,et al.  Impairment-aware dynamic provisioning in WDM networks with set-up delay tolerance and holding-time awareness , 2011, 2011 17th IEEE International Conference on Networks.

[25]  Biswanath Mukherjee,et al.  Holding-Time-Aware Dynamic Traffic Grooming , 2008, IEEE Journal on Selected Areas in Communications.

[26]  M. Tornatore,et al.  Dynamic traffic grooming of subwavelength connections with known duration , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[27]  Ali Munir,et al.  Holding time aware multicast requests provisioning algorithm for dynamic optical circuit switched (DOCS) networks , 2009, FIT.

[28]  D. Goderis,et al.  Service level agreements: a main challenge for next generation networks , 2002, 2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563).

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

[30]  Dong Shen,et al.  Energy-Efficient Traffic Grooming in WDM Networks With Scheduled Time Traffic , 2011, Journal of Lightwave Technology.

[31]  Wei Guo,et al.  Sliding scheduled lightpath provisioning by mixed partition coloring in WDM optical networks , 2013, Opt. Switch. Netw..

[32]  Reza Nejabati,et al.  Optical network services for ultra high definition digital media distribution , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[33]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[34]  Zhiqiang Zhou,et al.  A novel grooming algorithm with the adaptive weight and load balancing for dynamic holding-time-aware traffic in optical networks , 2013 .

[35]  A. Pattavina,et al.  Exploiting connection-holding time for an efficient dynamic traffic grooming , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.