Advertisement

Dynamic Grooming with Capacity aware Routing and Wavelength Assignment for WDM based Wireless Mesh Networks

  • Neeraj Kumar
  • Naveen Chilamkurti
  • Jongsung Kim
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 107)

Abstract

Wavelength division multiplexing (WDM) based wireless mesh networks (WMNs) are emerging as a new technology having enormous resources such as bandwidth and high throughput to satisfy the end users requirements. In this paper, we propose a Dynamic Grooming with Capacity aware Routing and Wavelength (DGCRW) assignment algorithm for such networks. To choose an optimized route, a cost value (CV) metric is proposed as the existing routing metric hop count does not give optimal results in WMNs for some applications (Zhao et al., J sys softw 83:1318–1326, 2010). A Utilization Matrix (UM) having load value (LV) is constructed dynamically as the requests for path/(light path) construction flow through the nodes. Using UM, utilization rating (UR) for each link is calculated. Finally CV is calculated from UR. The minimum value of CV is chosen to construct the path between source and destination. The value of CV is compared with existing hop count metric. The proposed algorithm is simulated on WDM based NSFNet network. The results obtained show that the proposed algorithm is quite effective to route the packets to less congested path and has higher throughput and less blocking probability than the other proposed algorithms.

Keywords

WDM WMNs Routing 

References

  1. 1.
    Akyildiz I, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47:445–487MATHCrossRefGoogle Scholar
  2. 2.
    Subramanian A, Gupta H, Das S (2007) Minimum interference channel assignment in multi-radio wireless mesh networks. SECON, pp 481–490Google Scholar
  3. 3.
    Ramaswami R, Sivarajan KN (1998) Optical networks: a practical perspective. Morgan Kaufmann Publishers, Los AltosGoogle Scholar
  4. 4.
    Modiano E, Lin P (2001) Traffic grooming in WDM networks. IEEE Commun Mag 39(7):124–129CrossRefGoogle Scholar
  5. 5.
    Srinivasan R, Somani AK (2002) Request-specific routing in WDM grooming networks. In: Proceedings of the IEEE ICC’02, vol 5. New York, pp 2876–2880Google Scholar
  6. 6.
    Srinivasan R, Somani AK (2003) Dynamic routing in WDM grooming networks. Photonic Netw Commun 5(2):123–135CrossRefGoogle Scholar
  7. 7.
    Dutta R, Rouskas GN (2002) Traffic grooming in WDM networks, Past and future. IEEE Netw 16(6):46–56CrossRefGoogle Scholar
  8. 8.
    Zhu K, Mukherjee B (2002) Online approaches for provisioning connections of different bandwidth granularities in WDM mesh networks. In: Proceedings of theOFC’02, Anaheim, pp 549–551Google Scholar
  9. 9.
    Patrocinio Z, Mateus G (2003) A Lagrangian-based heuristic for traffic grooming in WDM optical networks. IEE GLOBECOM’03, San Francisco, pp 2767–2771Google Scholar
  10. 10.
    Zhu H, Zang H, Zhu K, Mukherjee B (2003) A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans Networking 11(2):285–299CrossRefGoogle Scholar
  11. 11.
    Huang X, Farahmand F, Jue JP (2004) Analgorithm for traffic grooming in WDM mesh networks with dynamically changing light-trees. GLOBECOM’04, Dallas, pp 1813–1817Google Scholar
  12. 12.
    Zhu H, Zang H, Mukherjee B (2002) Design of WDM mesh networks with sparse grooming capability. IEEE Globecom’02 3:2696–2700 NovemberGoogle Scholar
  13. 13.
    Zhu H, Zang H, Zhu K, Mukherjee B (2002) Dynamic traffic grooming in WDM mesh networks using a novel graph model. GLOBECOM’02, Taiwan, pp 2681–2685Google Scholar
  14. 14.
    Zhu H, Zang H, Zhu K, Mukherjee B (2003) Dynamic traffic grooming in WDM mesh networks using a novel graph model. Opt Netw Mag 4(3):65–75Google Scholar
  15. 15.
    Zhu H, Zang H, Zhu K, Mukherjee B (2003) A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE Trans Networking 11(2):285–299CrossRefGoogle Scholar
  16. 16.
    De T, Pal P, Sengupta A (2008) A genetic algorithm based approach for traffic grooming, routing and wavelength assignment in optical WDM mesh networks. In: Proceedings of IEEE ICON’08, December 2008Google Scholar
  17. 17.
    Choo MYH, Lee S, Lee TJ (2005) Chung Traffic grooming algorithms in shortest EDP stable in WDM mesh networks. In: Proceedings of ICCS’05, May 2005. Lecture Notes in Computer Science, vol 3516. pp 559–567Google Scholar
  18. 18.
    Prathombutr P, Stach J, Park EK (2005) An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. J Telecommun Sys 28:3–4, 369–386Google Scholar
  19. 19.
    Tanmay D, Jain P, Pal A (2010) Distributed dynamic grooming routing and wavelength assignment in wdm optical mesh networks. Photon Netw Commun 1–10Google Scholar
  20. 20.
    Zhu K, Mukherjee B (2003) A review of traffic grooming in WDM optical networks: architectures and challenges. Opt Netw Mag 4(2):55–64Google Scholar
  21. 21.
    Zhao L, Ahmed Y, Min G (2010) GLBM: a new QoS aware multicast scheme for wireless mesh networks. J sys softw 83:1318–1326CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Neeraj Kumar
    • 1
  • Naveen Chilamkurti
    • 2
  • Jongsung Kim
    • 3
  1. 1.School of Computer Science and EngineeringSMVD UniversityKatraIndia
  2. 2.Department of Computer EngineeringLaTrobe UniversityMelbourneAustralia
  3. 3.Division of e-businessKyungnam UniversityMasanKorea

Personalised recommendations