Skip to main content

An Algorithm Based on Next Shortest Path in Large EON Under Dynamic Traffic Grooming

  • Conference paper
  • First Online:
Progress in Computing, Analytics and Networking

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1119))

  • 537 Accesses

Abstract

The elastic light-trail is one of the cutting-edge technologies implemented in Elastic Optical Networks (EON). The elasticity in an elastic light-trail or lightpath is facilitated by orthogonal frequency division multiplexing. However, in general, to serve a traffic demand generated dynamically in a communication network, a source-destination path is determined by Dijsktra’s shortest path algorithm. Afterwards, a various spectrum allocation procedures are applied and corresponding data transportation is executed for a certain time duration. In the field of dynamic traffic grooming under EON, Minimized Multihop Elastic Lightpath–(mMEL) and Multihop Elastic Lightpath–(MEL) are fundamental algorithms toward the fulfillment of traffic grooming objective. In this study, we investigate the aforesaid algorithms deeply and proposed an innovative algorithm-Multihop Next Shortest Elastic Lightpath–(MNSEL) that utilize next shortest path to minimize and maximize hop counts and network throughput simultaneously, respectively. The fundamental concept in our research study is the next shortest path which is determined recursively until the source-destination route setup process is met, when the shortest path fails to setup the route depending upon a few criteria. However, here, a thorough and rigorous measurement of the efficiency obtained under the proposed algorithm has been performed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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.001046

    Article  Google Scholar 

  2. 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.005

    Article  Google Scholar 

  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.000372

    Article  Google Scholar 

  4. 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.001

    Article  Google Scholar 

  5. 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-0

    Google Scholar 

  6. 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 

  7. 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-0

    Google Scholar 

  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), A309–A317 (2015). https://doi.org/10.1364/JOCN.7.00A309

  9. 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-7

    Article  Google Scholar 

  10. 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.016

    Article  Google Scholar 

  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.2231663

    Article  Google Scholar 

  12. Georges, A.N., Babri, M, Kora, A.D., Roger, M.F., 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. 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. Mata, J., de Miguel, I., Durán, R.J., Merayo, N., Singh, S.K., 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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prasanta Majumdar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Majumdar, P., De, T. (2020). An Algorithm Based on Next Shortest Path in Large EON Under Dynamic Traffic Grooming. In: Das, H., Pattnaik, P., Rautaray, S., Li, KC. (eds) Progress in Computing, Analytics and Networking. Advances in Intelligent Systems and Computing, vol 1119. Springer, Singapore. https://doi.org/10.1007/978-981-15-2414-1_22

Download citation

Publish with us

Policies and ethics