Journal of Computer Science

REDUCING CALL BLOCKING PROBABILITY IN HYBRID MULTICAST WAVELENGTH DIVISION MULTIPLEXING NETWORKS USING WEIGHTED ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHM

D. V. Pradeep Sankar and K. Muneeswaran

DOI : 10.3844/jcssp.2014.224.232

Journal of Computer Science

Volume 10, Issue 2

Pages 224-232

Abstract

In the proposed work, the focus is on increasing the available wavelength in the all-optical networks, for which the Routing and Wavelength Assignment plays a vital role. In the earlier reported work, the wavelengths were assigned to the links which covers a set of destinations but not all the intended destinations. However this proposed work, attempts were made to create multiple spanning tree with minimum cost for reaching all the nodes in the network. Also, the delay (associated with transmission and propagation delay) was considered in the proposed work for demonstrating the Quality of Service. Experimentally the proposed algorithm works by means of constructing Multiple Minimum Spanning Trees (MMST) using Mayeda and Seshu algorithm considering the QoS parameter delay and avoids the call blocking probabilities. For the performance measurement, the parameters such as the cost and delay are considered and depending on the application they can be traded-off. The significance of the work lies in the optimization of the wavelength used in the fibre network, which mainly contributes to the backbone of the Internet. The experiments were conducted for the different scenarios of simulated network configuration and found to produce promising results compared to the existing work.

Copyright

© 2014 D. V. Pradeep Sankar and K. Muneeswaran. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.