Abstract
In this paper, optimisation models and heuristic algorithms that address the off-line survivability-supported Traffic Engineering (TE) problem in multi-service backbone networks are presented. In such networks traffic demands with different Quality of Service (QoS) and survivability requirements (e.g. existence of a node disjoint backup path for each primary path) inhere. The optimisation models for engineering the QoS traffic with different survivability prerequisites and the Best-Effort (BE) traffic are based on novel admission control/routing Integer Linear Programming (ILP) and Linear Programming (LP) optimisation sub-problems, which are solved sequentially. LP relaxations of the ILP sub-problems are also provided. The optimisation models and heuristic algorithms are tested on two different networks and their performance is compared.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have