Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Dynamic Routing and Wavelength Assignment Using Cost Based Heuristics in WDM Optical Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Dynamic routing and wavelength assignment problem in optical networks is a two-step problem that is influenced by the choice of a successful optimal path selection and wavelength assignment. Proper selection techniques reduce the number of wavelengths required in the network and thereby improves traffic grooming. Heuristic algorithms and integer linear programming models help in selection of route and wavelength separately. Hence, the computation time is large which makes the system slow. A cost function is computed which uses independent parameters in the network for the selection of route and wavelength for a call. The heuristic reduces computation time by combining the search of route and wavelength to be assigned. In addition, the network performance is analyzed with and without alternate routing along with proposed heuristics. The selection of proper route and wavelength finding technique is very essential since it improves the grooming factor of the network thereby allowing more traffic support by the network. Our objective is to investigate and propose a cost based heuristics for dynamic traffic routing and wavelength Assignment in WDM optical networks. For this we plan to develop cost functions and heuristics to compute the route and wavelength assignment strategy. Here, our objective is to reduce the computation time for selection of route and wavelength assignment strategy by weighted cost function. The function has to include network parameters for its processing. Our work provides an overview about DRWA by applying cost based heuristics in WDM networks. This paper explains the proposed cost function and its applications in line with selection of independent parameters. The details of other functions like cost function formulation, hop-based route assignment, available wavelength based route assignment, mathematical analysis of proposed cost function are also explained. Results and discussions based on the findings are presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Baroni, S., Eaves, J., Kumar, M., Qureshi, M., Rodriguez-Moral, A., & Sugerman, D. (2000). Analysis and design of backbone architecture alternatives for IP optical networking. IEEE Journal on Selected Areas in Communications, 18(10), 1980–1994. https://doi.org/10.1109/49.887918.

    Article  Google Scholar 

  2. Petale, S., Maurya, R. K., & Thangaraj, J. (2018). Improved connection establishment of dynamic traffic with queue in WDM optical networks. Wireless Personal Communications, 100(4), 1707–1725. https://doi.org/10.1007/s11277-018-5663-z.

    Article  Google Scholar 

  3. Ye, T., Zeng, Q., Su, Y., Leng, L., Wei, W., Zhang, Z., et al. (2004). On-line integrated routing in dynamic multifiber IP/WDM networks. IEEE Journal on Selected Areas in Communications, 22(9), 1681–1691.

    Google Scholar 

  4. Jukan, A., & van As, H. R. (2000). Service-specific resource allocation in WDM networks with quality constraints. IEEE Journal on Selected Areas in Communications, 18(10), 2051–2061.

    Article  Google Scholar 

  5. Modiano, E. (2001). Traffic grooming in WDM networks. IEEE Communications Magazine, 39(7), 124–129. https://doi.org/10.1109/35.933446.

    Article  Google Scholar 

  6. Dixit, S. (2004). IP over WDM: Building the next-generation optical internet. Hoboken: Wiley.

    Google Scholar 

  7. Ghani, N., Dixit, S., & Wang, T.-S. (2000). On IP-over-WDM integration. IEEE Communications Magazine, 38(3), 72–84.

    Google Scholar 

  8. Chatterjee, B. C., Sarma, N., & Sahu, P. P. (2012). Priority based routing and wavelength assignment with traffic grooming for optical networks. Journal of Optical Communications and Networking, 4(6), 480. https://doi.org/10.1364/jocn.4.000480.

    Article  Google Scholar 

  9. Xin, C., Wang, B., Cao, X., & Li, J. (2006). Logical topology design for dynamic traffic grooming in WDM optical networks. Journal of Lightwave Technology, 24(6), 2267–2275.

    Google Scholar 

  10. Zhu, K., Zang, H., & Mukherjee, B. (2002). Design of WDM mesh networks with sparse grooming capability. In Global Telecommunications Conference, 2002. GLOBECOM’02. IEEE (Vol. 3, pp. 2696–2700). IEEE.

  11. Zhu, K., & Mukherjee, B. (2002). Traffic grooming in an optical WDM mesh network. IEEE Journal on Selected Areas in Communications, 20(1), 122–133. https://doi.org/10.1109/49.974667.

    Article  Google Scholar 

  12. Garlick, R. M., & Barr, R. S. (2002). Dynamic wavelength routing in WDM networks via ant colony optimization. In International Workshop on Ant Algorithms (pp. 250–255). Springer.

  13. Markovic, G. Z., Acimovic-Raspopovic, V. S., & Teodorovic, D. B. (2007). An application of heuristic algorithm based on route minimum cost for RWA in all-optical WDM networks. In 2007 8th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, IEEE (pp. 397–400).

  14. Cavendish, D. (2000). Evolution of optical transport technologies: From SONET/SDH to WDM. IEEE Communications Magazine, 38(6), 164–172. https://doi.org/10.1109/35.846090.

    Article  Google Scholar 

  15. Sankaranarayanan, S., Subramaniam, S., Choi, H., & Choi, H.-A. (2007). Survivable traffic grooming in WDM ring networks. Journal of Communications and Networks, 9(1), 93–104.

    Google Scholar 

  16. Zhang, S., & Ramamurthy, B. (2003). Dynamic traffic grooming algorithms for reconfigurable sonet over WDM networks. IEEE Journal on Selected Areas in Communications, 21(7), 1165–1172.

    Google Scholar 

  17. Ngo, S.-H., Jiang, X., Horiguchi, S., & Guo, M. (2004). Dynamic routing and wavelength assignment in WDM networks with ant-based agents. In Embedded and Ubiquitous Computing (pp. 829–838). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_79.

  18. Yao, W., & Ramamurthy, B. (2004). Rerouting schemes for dynamic traffic grooming in optical WDM mesh networks. In IEEE Global Telecommunications Conference, 2004. GLOBECOM. (Vol. 3, pp. 1793–1797). IEEE.

  19. Ramaswami, R., & Sivarajan, K. N. (1995). Routing and wavelength assignment in all-optical networks. IEEE/ACM Transactions on Networking, 3(5), 489–500.

    Google Scholar 

  20. Wang, X., Brandt-Pearce, M., & Subramaniam, S. (2014). Distributed grooming, routing, and wavelength assignment for dynamic optical networks using ant colony optimization. IEEE/OSA Journal of Optical Communications and Networking, 6(6), 578–589.

    Google Scholar 

  21. Barry, R., & Subramaniam, S. (1997). The max sum wavelength assignment algorithm for WDM ring networks. In IEEE Conference on Optical Fiber Communication. OFC 97. (pp. 121–122).

  22. Thangaraj, J., Mankar, P. D., & Datta, R. (2010). Improved shared resource allocation strategy with SLA for survivability in WDM optical networks. Journal of Optics, 39(2), 57–75.

    Google Scholar 

  23. Singh, P., Sharma, A. K., & Rani, S. (2007). Routing and wavelength assignment in WDM networks with dynamic link weight assignment. Optik, 118(11), 527–532. https://doi.org/10.1016/j.ijleo.2006.05.014.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology (ISM), Dhanbad, Dhanbad, India

    Rakesh Kumar Maurya, Jaisingh Thangaraj & Vishnu Priye

Authors
  1. Rakesh Kumar Maurya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaisingh Thangaraj
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vishnu Priye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaisingh Thangaraj.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Maurya, R.K., Thangaraj, J. & Priye, V. Dynamic Routing and Wavelength Assignment Using Cost Based Heuristics in WDM Optical Networks. Wireless Pers Commun 115, 971–992 (2020). https://doi.org/10.1007/s11277-020-07607-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07607-5

Keywords

Search

Navigation