Advertisement

A Distance-Based Adaptive Traffic Grooming Algorithm in Large EON Under Dynamic Traffic Model

  • Prasanta MajumdarEmail author
  • Tanmay De
Conference paper
  • 10 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1119)

Abstract

The recently emergent technology in optical communication is the elasticity introduced in spectrum domain which provides exact amount of spectrum resources allocation incurred by a data transportation requirement under Elastic Optical Networks (EON). However, in the field of dynamic traffic grooming under EON, to initiate a source to destination data-stream transportation, routing process uses the traditional Dijsktra’s shortest path algorithm followed by required spectrum allocation in the traditional multi-hop elastic lightpath algorithm(MEL). Here, it is worth mentioning that an established elastic lightpath along a source to destination shortest path is always utilized to setup a multi\(hop\ elastic\ lightpath\) regardless the distance it covers. In this study, source to destination shortest path length/distance is considered to setup a mel and a \(threshold\ path\ length\)\((\kappa )\) initialized to the diameter of a graph (i.e. the physical topology) is considered as key aspect. In this research work, the prime objective is to achieve a trade-off in between number of hops and cost incurred by a traffic demand. However, toward the fulfillment of objective proposed in this study, a series of simulations has been executed and we note a significant reduction in hop counts in association with a very little reduction in network throughput.

Keywords

Elastic light-trail Threshold shortest path length (TSPLDynamic traffic grooming Orthogonal frequency division multiplexing (OFDMElastic optical networks (EON

References

  1. 1.
    Patel, A., Ji, P., Jue, J., Wang, T.: Survivable transparent flexible optical WDM (FWDM) networks. In: Optical Fiber Communication Conference Electronic, Los Angeles, CA, USA (2011). ISBN 978-1-55752-906-0Google Scholar
  2. 2.
    Morea, A., Rival, O.: Advantages of elasticity versus mixed data-rate schemes for restorable optical networks.In: Proceedings of European Conference and Exposition on Optical Communications (2010)Google Scholar
  3. 3.
    Gumaste, A., et al.: An autonomic virtual topology design and two-stage scheduling algorithm for light-trail WDM networks. IEEE/OSA J. Opt. Commun. Netw. 3(4), 372–389 (2011).  https://doi.org/10.1364/JOCN.3.000372CrossRefGoogle Scholar
  4. 4.
    Gumaste, A., Das, T., Vaishampayan, R., Wang, J., Somali, A.: Extending light-trails to regional networks: multi-hop light-trails (MLT)–system design and performance. IEEE/OSA J. Opt. Commun. Netw. 4(12), 1046–1061 (2012).  https://doi.org/10.1364/JOCN.4.001046CrossRefGoogle Scholar
  5. 5.
    Sone, Y., Watanabe, A., Imajuku, W., Tsukishima, Y., Kozicki, B., Takara, H., Jinno, M.: Highly survivable restoration scheme employing optical bandwidth squeezing in spectrum-sliced elastic optical path (SLICE) network. In: Proceedings of Optical Fiber Communication Conference, San Diego, California United States (2009). ISBN: 978-1-55752-865-0Google Scholar
  6. 6.
    Majumdar, P., Pal, A., De, T.: Extending light-trail into elastic optical networks for dynamic traffic grooming. Opt. Switch. Netw. 20, 1–15 (2015).  https://doi.org/10.1016/j.osn.2015.10.005CrossRefGoogle Scholar
  7. 7.
    Majumdar, P., De, T.: De-multiplexing the required spectrum in a traffic demand into multiple non-adjacent granular spectrums for dynamic traffic grooming in EON. Opt. Switch. Netw. 33, 143–160 (2018).  https://doi.org/10.1016/j.osn.2018.04.001CrossRefGoogle Scholar
  8. 8.
    Dallaglio, M., Giorgetti, A., Sambo, N., Cugini, F., Castoldi, P.: Provisioning and restoration with sliceability in GMPLS-based elastic optical networks [Invited]. IEEE/OSA J. Opt. Commun. Netw. 7(2), A309A317 (2015).  https://doi.org/10.1364/JOCN.7.00A309
  9. 9.
    Majumdar, P., De, T.: An alternative minimum cost route setup algorithm in a large EON for long-haul traffic under dynamic traffic grooming, Article reference: YJNCA2359. J. Netw. Comput. Appl. 140, 65–86 (2019).  https://doi.org/10.1016/j.jnca.2019.04.016CrossRefGoogle Scholar
  10. 10.
    De, T., Jain, P., Pal, A.: Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks. Photon Netw. Commun. 21(2), 117–126 (2012).  https://doi.org/10.1007/s11107-010-0286-7CrossRefGoogle Scholar
  11. 11.
    Liu, M., Tornatore, M., Mukherjee, B.: Survivable traffic grooming in elastic optical networks shared protection. J. Lightwave Technol. 31(6), 903–909 (2013).  https://doi.org/10.1109/JLT.2012.2231663CrossRefGoogle Scholar
  12. 12.
    Georges, AN., Babri, M., Kora, AD, Faye, RM., Aka, B., Lishou, C.: An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networks. J. Digital Commun. Netw. 3(1), 11–18 (2017).  https://doi.org/10.1016/j.dcan.2016.05.001. ISSN:2352-8648
  13. 13.
    DAanko, M., Mikac, B., Furdek, M.: Dedicated path protection for optical networks based on function programmable nodes. J. Opt. Switch. Netw. 27, 79–87 (2018).  https://doi.org/10.1016/j.osn.2017.09.001. ISSN:1573-4277
  14. 14.
    Mata, J., de Miguel, I., Durán, RJ., Merayo, N., Singh, SK., Jukan, A., Chamania, M.: Artificial intelligence (AI) methods in optical networks: a comprehensive survey. J. Opt. Switch. Netw. 28, 43–57 (2018).  https://doi.org/10.1016/j.osn.2017.12.006. ISSN:1573-4277

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Dr. B. C. Roy Engineering CollegeDurgapurIndia
  2. 2.National Institute of TechnologyDurgapurIndia

Personalised recommendations