Routing in WDM based wireless mesh networks with capacity estimation

Authors:
Neeraj Kumar;Naveen Chilamkurti;Jongsung Kim
Affiliations:
Department of Computer Science and Engineering, Thapar University, Patiala (Punjab), 147004, India.;Department of Computer Science and Computer Engineering, La Trobe University, Melbourne, 3086, Australia.;Department of E-Business, Kyungnam University, 449 Woryeong-dong, Masan, Changwon, Gyeongnam, 631-701, Korea
Venue:
International Journal of Internet Protocol Technology
Year:
2011

Citing 10
Cited 0

Optical networks: a practical perspective

Optical networks: a practical perspective
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
GLBM: A new QoS aware multicast scheme for wireless mesh networks

Journal of Systems and Software
Traffic grooming based on shortest path in optical WDM mesh networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Traffic grooming algorithm using shortest EDPs table in WDM mesh networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Traffic grooming in WDM networks

IEEE Communications Magazine
A novel all-optical transport network with time-shared wavelength channels

IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to support and provide resources to various applications, in this paper, we propose a dynamic dynamic routing for WDM based wireless mesh networks (WMNs). To choose an optimised route, cost metric (CM) and load utilisation matrix (LUM) are constructed dynamically. Using LUM, load utilisation rating (LUR) for each link is calculated. At last, CM is calculated from LUR. The minimum value of CM is chosen to construct the path between source and destination. The value of CM is compared with existing hop count metric. The proposed algorithm is simulated on two well-known WDM-based networks, NSFNet and EON. 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.