A novel fairness based criticality avoidance routing algorithm for wavelength routed optical networks

Abstract

In conventional RWA algorithms the shorter lightpaths fragment the available wavelengths resulting in a higher blocking probability for longer hopcount lightpaths. In this paper we study a novel routing algorithm, which uses traffic classification to classify different hop count connection requests to provide fairness among short and long hop count traffic requests. Also our routing algorithm uses the link criticality information which is related to the number of available wavelengths on a link to provide load balancing over all the links in a network.