Authors: Neeraj Kumar; Naveen Chilamkurti; Jongsung Kim
Addresses: 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
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.
Keywords: wavelength division multiplexing; WDM; wireless mesh networks; WMNs; linear programming; dynamic routing; capacity estimation; cost metrics; load utilisation.
International Journal of Internet Protocol Technology, 2011 Vol.6 No.4, pp.224 - 233
Available online: 05 Jun 2012 *Full-text access for editors Access for subscribers Purchase this article Comment on this article