DocumentCode :
128308
Title :
Restorable routing algorithm in optical networks by reducing blocking probability
Author :
Kumar, Ravindra ; Kaur, Navjot
Author_Institution :
Dept. of Comput. Sci. & Eng., D.A.V. Inst. of Eng. & Technol., Jalandhar, India
fYear :
2014
fDate :
6-8 March 2014
Firstpage :
1
Lastpage :
7
Abstract :
Restorability of a network refers to a capability of a network to provide continuous service in the presence of failures and it also defines how a network restores to the actual position after overcoming a failure. In a WDM network, a single channel may be carrying no of gigabits of data per second. A single failure may cause a disturbance in a large amount of services. A network that is built on fiber-optics technology sends data digitally in the form of light through connected fiber. Optical networks increase the Transmission capacity and speed of the network. This paper presents a restorable routing algorithm that reduces blocking probability and compares the proposed work with the conventional algorithms. In this work, we have presented a quick and efficient heuristic for restorable routing.
Keywords :
optical fibre networks; probability; telecommunication network reliability; telecommunication network routing; wavelength division multiplexing; WDM network; blocking probability reduction; fiber-optic technology; network restorability; network speed; optical networks; restorable routing algorithm; transmission capacity; wavelength division multiplexing; Optical fiber networks; Optical fibers; Probability; Routing; Wavelength division multiplexing; Bandwidth; OADMs; OLTs; OXCs; Optical fiber; Optical network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Engineering and Computational Sciences (RAECS), 2014 Recent Advances in
Conference_Location :
Chandigarh
Print_ISBN :
978-1-4799-2290-1
Type :
conf
DOI :
10.1109/RAECS.2014.6799624
Filename :
6799624
Link To Document :
بازگشت