Efficient Traffic Engineering Strategies for Optimizing Network Throughput in WDM All-Optical Networks

Full Text (PDF, 591KB), PP.39-49

Views: 0 Downloads: 0

Author(s)

Mohamed Koubaa 1,* Naama Amdouni 1 Taoufik Aguili 1

1. Laboratoire SYStèmes des COMmunications Département Technologies de l’Information et de la Communication École Nationale d’Ingénieurs de Tunis Université Tunis El Manar - BP 37, Le Belvédère - 1002 Tunis - Tunisia

* Corresponding author.

DOI: https://doi.org/10.5815/ijcnis.2015.06.05

Received: 15 Sep. 2014 / Revised: 2 Jan. 2015 / Accepted: 16 Feb. 2015 / Published: 8 May 2015

Index Terms

All-optical WDM networks, Routing and Wavelength Assignment (RWA), Wavelength Continuity Constraint, Traffic Engineering, Intentional/Active Lightpath ReRouting, Network Throughput Optimization

Abstract

In this paper we investigate traffic-engineering issues in Wavelength Division Multiplexing (WDM) all-optical networks. In such networks, the wavelength continuity constraint along with the wavelength clash constraint, lead to poor network performances when dealing with the lightpath provisioning problem. The impact of these constraints is especially severe when traffic demands are unpredictable and characterized by random arrivals and departures. In order to alleviate the impact of these constraints, we propose to employ intentional/active rerouting. Active lightpath rerouting is to intentionally reroute already established lightpaths, during their life period, so as to achieve a better blocking performance. We here assume that due to the large geographic area an optical WDM network can cover, upgrading such a network to support the huge demand for network bandwidth can be costly. Thereby, it is extremely important for network operators to apply traffic-engineering strategies to cost-effectively optimize network throughput. Two new routing and wavelength assignment (RWA) algorithms applying intentional rerouting are proposed. Both algorithms dynamically reroute some already established lightpaths from longer paths to vacant shorter ones so as to reduce the network resources consumption and hence improve the network throughput. The first algorithm, namely, Timer-Based Active Lightpath Rerouting (TB-ALR) initiates the rerouting procedure every time a timer expires. The second algorithm, namely, Sequential Routing with Active Lightpath Rerouting (SeqRwALR) initiates the rerouting procedure when a connection leaves and its lightpaths are released. To the best of our knowledge, our global approach has not already been investigated in the literature. Simulation results show that the proposed active rerouting algorithms yield much lower connection rejection ratios than rerouting algorithms previously presented in the literature while rerouting a small number of already established lightpaths. By rerouting a small number of existing lightpaths, we hope that the disruption period incurred due to rerouting is minimized.

Cite This Paper

Mohamed Koubàa, Naama Amdouni, Taoufik Aguili, "Efficient Traffic Engineering Strategies for Optimizing Network Throughput in WDM All-Optical Networks", International Journal of Computer Network and Information Security(IJCNIS), vol.7, no.6, pp.39-49, 2015. DOI:10.5815/ijcnis.2015.06.05

Reference

[1]N. Zhang and H. Bao, “Re-routing Technology and Its Application in Optical Network,” in Proceedings, 2010 International Conference on Innovative Computing and Communication and 2010 Asia-Pacific Conference on Information Technology and Ocean Engineering, pp. 24-27, 2010.
[2]I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath Communications: An Approach to High-Bandwidth Optical WANs,” IEEE Transactions on Communications, 40(7):1171-1182, Jul. 1992.
[3]H. Zang, J. P. Jue, and B. Mukherjee, “A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks,” Optical Networks Magazine, 1(1):47-60, 2000.
[4]M. Kovacevic and A. Acampora, “Benefits of Wavelength Translation in All-Optical Clear-channel Networks,” IEEE Journal on Selected Areas in Communications, 14(5):868-880, 1996.
[5]H. Q. Ngo, D. Pan, and Y. Yang, “Optical Switching Networks with Minimum Number of Limited Range Wavelength Converters,” in Proceedings, IEEE INFOCOM, volume 2, pp. 1128-1138, 2005.
[6]B. Ramamurthy and B. Mukherjee, “Wavelength Conversion in WDM Networking,” IEEE Journal on Selected Areas in Communications, 16(7):1061-1073, 1998.
[7]S. Subramaniam, M. Azizoglu, and A. K. Somani, “All-Optical Networks with Sparse Wavelength Conversion,” IEEE/ACM Transactions on Networking, 4(4):544-557, 1996.
[8]J. Yates, J. Lacey, D. Everitt, and M. Summerfield, “Limited Range Wavelength Translation in All-Optical Networks,” in Proceedings, IEEE INFOCOM, pp. 954-961, 1996.
[9]X. Chu and B. Li, “Dynamic Routing and Wavelength Assignment in the Presence of Wavelength Conversion for All-Optical Networks,” IEEE/ACM Transactions on Networking, 13(3):704-715, 2005.
[10]K. Chan and T. P. Yum, “Analysis of Least Congested Path Routing in WDM Lightwaves Networks,” in Proceedings, IEEE INFOCOM, pp. 962-969, 1994.
[11]H. Harai, M. Murata, and H. Miyahara, “Performance of Alternate Routing Methods in All-Optical Switching Networks,” in Proceedings, IEEE INFOCOM, pp. 517-525, 1997.
[12]L. Li and A. K. Somani, “Dynamic Wavelength Routing Using Congestion and Neighbourhood Information,” IEEE/ACM Transactions on Networking, 7(5):779-786, 1999.
[13]A. Mokhtar and M. Azizoglu, “Adaptive Wavelength Routing in All-Optical Networks,” IEEE/ACM Transactions on Networking, 6(2):197-206, 1998.
[14]S. Ramamurthy and B. Mukherjee, “Fixed-Alternate Routing and Wavelength Conversion in Wavelength-Routed Optical Networks,” IEEE/ACM Transactions on Networking, 10(3):351-367, 1998.
[15]R. Ramaswami and K. Sivarajan, “Routing and Wavelength Assignment in All-Optical Networks,” IEEE/ACM Transactions on Networking, 3(5):489-500, 1995.
[16]Y. Zhu, G. N. Rouskas, and H. G. Perros, “A Comparison of Allocation Policies in Wavelength Routing Networks,” Photonic Network Communications Journal, 2(3):265-293, 2000.
[17]M. Koubàa, N. Puech, and M. Gagnaire, “Routing and Wavelength Assignment of Scheduled and Random Lightpath Demands,” in Proceedings, IEEE Wireless and Optical Communications Networks, pp. 7-9, 2004.
[18]A. A. M. Saleh, “Transparent Optical Networking in Backbone Networks,” in OFC, pp. 62-64, 2000.
[19]I. Tomkos, “Transport Performance of WDM Metropolitan Area Transparent Optical Networks,” in OFC, pp. 350-352, 2002.
[20]K. C. Lee and V. O. K. Li, “A Wavelength Rerouting Algorithm in Wide-Area All-Optical Networks,” IEEE/OSA Journal of Lightwave Technology, 14(6):1218-1229, 1996.
[21]M. Koubàa and M. Gagnaire, “Lightpath Rerouting Strategies in WDM All-Optical Networks Under Scheduled and Random Traffic,” IEEE/OSA Journal of Optical Communications and Networking, 2(10):859-871, 2010.
[22]M. H. Ackroyd, “Call Repacking in Connecting Networks,” IEEE Transactions on Communications, 27(3):589-591, 1979.
[23]A. Girard and S. Hurtubise, “Dynamic Routing and Call Repacking in Circuit-Switched Networks,” IEEE Transactions on Communications, 31(12):1290-1294, 1983.
[24]K. C. Lee and V. O. K. Li, “A Circuit Rerouting Algorithm for All-Optical Wide-Area Networks,” in Proceedings, IEEE INFOCOM, pp. 954-961, 1994.
[25]G. Mohan and C. S. R. Murthy, “A Time Optimal Wavelength Rerouting Algorithm for Dynamic Traffic in WDM Networks,” IEEE/OSA Journal of Lightwave Technology, 17(3):406-417, 1999.
[26]X. Chu and J. Liu, “DLCR: A New Adaptive Routing Scheme in WDM Mesh Networks,” in Proceedings, IEEE International Conference on Communications, pp. 1797-1801, 2005.
[27]R. Datta, S. Ghose, and I. Sengupta, “A Rerouting Technique with Minimum Traffic Disruption for Dynamic Traffic in WDM Networks,” in Proceedings, IEEE Conference on Networks, pp. 425-430, 2003.
[28]G. Xue, “Optimal Lightpath Routing and Rerouting in WDM Networks,” in Proceedings, IEEE Globecom, pp. 2124-2128, 2001.
[29]W. Yao and B. Ramamurthy, “Rerouting Schemes for Dynamic Traffic Grooming in Optical WDM Mesh Networks,” in Proceedings, IEEE Globecom, pp. 1793-1797, 2004.
[30]Y. Wan and W. Liang, “Wavelength Rerouting in Survivable WDM Networks,” Lecture Notes in Computer Science, 3462:431-442, 2005.
[31]E. W. M. Wong, A. K. M. Chan, and T. S. P. Yum, “A Taxonomy of Rerouting in Circuit Switched Networks,” IEEE Communications Magazine, 37(11):116-122, 1999.
[32]A. Wason and R.S. Kaler, “Rerouting Technique with Dynamic Traffic in WDM Optical Networks,” Optical Fiber Technology, 16(1):950-954, 2010.
[33]A. Wason and R.S. Kaler, “Lightpath Rerouting Algorithm to Enhance Blocking Performance in All-optical WDM Network without Wavelength Conversion,” Optical Fiber Technology, 16(3):146-150, 2010.
[34]N. Amdouni, M. Koubàa, and T. Aguili, “Lightpath Rerouting Scheme for Dynamic Traffic in WDM All-Optical Networks,” in Proceedings, IEEE International Conference on Computer Systems and Industrial Informatics (ICCSII12), pp. 1-6, 2012.
[35]Q. D. Ho and M. S. Lee, “Connection Level Active Rerouting in WDM Mesh Networks with Traffic Grooming Capability,” in Proceedings, IEEE International Conference on Communications, volume 5, pp. 2415-2420, 2006.
[36]Q. D. Ho and M. S. Lee, “Source-initiated Active Rerouting in WDM Mesh Networks with Traffic Grooming Capability,” in Proceedings, The Joint International Conference on Optical Internet and Next Generation Network, pp. 100-104, 2006.
[37]X. Chu, T. Bu, and X Li, “A Study of Lightpath Rerouting Schemes in Wavelength-Routed WDM Networks,” in Proceedings, IEEE International Conference on Communications, pp. 2400-2405, 2007.
[38]X. Chu, H. Yin, and X. Li, “Lightpath Rerouting in Wavelength-Routed WDM Networks,” IEEE/OSA Journal of Optical Communications and Networking, 7(8):721-735, 2008.
[39]D. Eppstein, “Finding the k Shortest Path,” in Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 154-165, 1994.