Performance Analysis of Routing and Protection Schemes for High Speed Networks

Abstract

Abstract

Management of high-speed networks becomes critical as traffic volume increases. Impact of failures is aggravated in networks carrying huge volume of data. Impact is more pronounced as level of multiplexing in high speed networks increase. It is important to deal with survivability of high speed networks in efficient manner in order to maintain high Quality of Service (QoS). In this paper, a performance analysis of routing and protection algorithms in optical networks has been performed. Routing algorithm for each routing technique has been analysed and compared on basis of performance metrics such as total recovery speed, capacity utilization, blocking probability, complexity, recovery path length, resource utilization ratio, cost etc. The present study indicates that recovery speed of Streams technique is comparable to dedicated path protection (DPP), capacity utilization of streams is better than DPP and it has least blocking probability among shared path protection (SPP) and DPP. Among Hamiltonian cycle protection techniques, Hamiltonian cycle neighbour capacity closure (HNC) offers least spare capacity. The analysis can be applied to differentiated service selection with optimal Quality of Service.

Keywords: Optical network, routing, protection, resource utilization ratio, blocking probability

Cite this Article

Himanshi Saini, Amit Kumar Garg. Performance Analysis of Routing and Protection Schemes for High Speed Networks. Journal of Web Engineering & Technology. 2017; 4(3): 11–18p.