Title: An efficient flooding algorithm for improving network performance in optical WDM networks

Authors: M. Arunachalam; V. Rajamani

Addresses: Department of Computer Science and Engineering, K.L.N. College of Information Technology, Pottapalayam, Sivagangai, Tamilnadu, 630611, India ' Department of Electronics and Communication Engineering, Indra Ganesan College of Engineering, Manikandam, Tiruchirappalli, Tamilnadu, 620 012, India

Abstract: In any networking environment, network and resource information has to be maintained periodically for re-routing the traffic. Especially in fault tolerant optical networks, after the faults are detected and recovered, the network topology changes have to be constantly configured for correct light path decisions to be made. In order to maintain correct routing tables and also to prevent blocking of forthcoming calls by the failed connection, the flooding messages have been broadcast to all nodes. When every node in the network floods the messages, problems arise of excessive redundancy of messages, resource contention and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. In this paper, lazy flooding algorithm is analysed and simulated by comparing the performance of all-flooding method and threshold flooding. Here, instead of flooding for each channel status update, such as to be changed from available to occupy or vice versa, we hold the process of update till it reaches certain points. The simulation results shows that the proposed flooding method achieves reduced blocking probability with increased throughput thereby increasing the scalability of the network.

Keywords: optical networks; flooding; network blocking rate; throughput; flooding probability; network topology changes; simulation; WDM networks; wavelength-division multiplexing; network scalability.

DOI: 10.1504/IJCSE.2014.060675

International Journal of Computational Science and Engineering, 2014 Vol.9 No.3, pp.198 - 204

Received: 06 May 2011
Accepted: 08 Mar 2012
Published online: 24 May 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article