Optimization Methods for Resilient Routing in Connection-Oriented Communication Networks

Problems related to routing in communication networks belong to the class of combinatorial optimization problems due to constrained network resources (mainly the limited capacity of network links). This chapter focuses on modeling the optimization problems related to resilient routing involving preplanned protection mechanisms in connection-oriented communication systems. In this context, several optimization models are defined to obtain the shortest sets of disjoint working and protection paths. It also explains the properties of optimization models related to sharing backup path resources and using other forms of protection structures, such as p-cycles. In its final part, this chapter explains the properties of the most relevant mathematical methods that can be used to solve the optimization problems addressed in this chapter.