GMPLS protocol was designed in order to apply label-switching techniques to different network technologies, such as time division multiplexing (TDM), wavelength routing and packet switching networks. Resource reservations are performed all along label switched paths (LSP). This paper proposes a novel constraint-based routing (CBR) algorithm for GMPLS networks. Our solution includes path computation and resources' assignment for both admission control and failure recovery mechanisms. Unlike other constraint-based routing protocols, our algorithm supports several classes of traffic with different failure recovery schemes. We investigated the performance of our algorithm through simulation works which are performed on a GMPLS optical network configured with the European reference core topology. Numerical results have shown that, compared to Constrained Shortest Path First (CSPF) routing, our solution enhances the success probability of path setup and optimizes the global performance in terms of queuing delay and bit loss ratio.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.