Publication Type : Conference Paper
Publisher : TISC
Source : TISC 2011 - Proceedings of the 3rd International Conference on Trendz in Information Sciences and Computing, Chennai, p.194-198 (2011)
Url : http://www.scopus.com/inward/record.url?eid=2-s2.0-84860006904&partnerID=40&md5=5e07b60562b4e5cd4b2ce2e43f7572e2
ISBN : 9781467301329
Keywords : Blocking probability, Distributed management, Dynamics, grooming, Information science, survivability, Traffic speed, Wavelength division multiplexing, WDM networks
Campus : Bengaluru
School : School of Engineering
Department : Electronics and Communication
Year : 2011
Abstract : In this paper, we have designed a distributed dynamic survivable RWA protocol based on automatic updation (ADDR). The updation mechanism involves calculation of number of free wavelengths and shortest distance at the source node to identify the optimal and backup lightpath to reduce the congestion and delay in the network. As soon as the request approaches the node, it is served with the best lightpath with the help of the data available in the node table which reduces the setup time. Backup lightpath is used for survivability. The selection of backup lightpath is done in such a way that there is no shared link between the primary and backup lightpath but it can be shared with another backup lightpath. Grooming is used for low speed traffics to reduce the connection request blocking. By simulation results, we showed that our proposed protocol has low blocking probability.
Cite this Research Publication : Dr. T. K. Ramesh, Janani, R., Kiran, S. P., Swapna, T., and Vaya, P. R., “Automated Distributed Dynamic Survivable RWA Protocol for WDM Networks”, in TISC 2011 - Proceedings of the 3rd International Conference on Trendz in Information Sciences and Computing, Chennai, 2011, pp. 194-198.