Skip to main content
placeholder image

Excess capacity planning for the protection of virtual paths

Conference Paper


Abstract


  • In this paper, the problem of allocation of excess capacity to the physical layer for semi-dedicated VP protection scheme has been studied. In the case of a link failure, the semi-dedicated protection scheme will allocate reserve capacity in the remaining links to the protection of Virtual Paths whose working paths have been affected. The paper develops three solution strategies for excess bandwidth calculation. The Optimal solution can be obtained by an integer linear programming model that will be unsuitable for large problems. A heuristic based on decomposition of the optimal solution to a series of smaller integer linear programming problems is presented. A simpler heuristic based on K-edge-disjoint shortest paths problem is developed which has O(n 4) complexity where n is the number of nodes in the network.

Publication Date


  • 1998

Citation


  • Ouveysi, I., & Safaei, F. (1998). Excess capacity planning for the protection of virtual paths. In Conference Record / IEEE Global Telecommunications Conference Vol. 5 (pp. 3058-3061).

Scopus Eid


  • 2-s2.0-0032261155

Start Page


  • 3058

End Page


  • 3061

Volume


  • 5

Abstract


  • In this paper, the problem of allocation of excess capacity to the physical layer for semi-dedicated VP protection scheme has been studied. In the case of a link failure, the semi-dedicated protection scheme will allocate reserve capacity in the remaining links to the protection of Virtual Paths whose working paths have been affected. The paper develops three solution strategies for excess bandwidth calculation. The Optimal solution can be obtained by an integer linear programming model that will be unsuitable for large problems. A heuristic based on decomposition of the optimal solution to a series of smaller integer linear programming problems is presented. A simpler heuristic based on K-edge-disjoint shortest paths problem is developed which has O(n 4) complexity where n is the number of nodes in the network.

Publication Date


  • 1998

Citation


  • Ouveysi, I., & Safaei, F. (1998). Excess capacity planning for the protection of virtual paths. In Conference Record / IEEE Global Telecommunications Conference Vol. 5 (pp. 3058-3061).

Scopus Eid


  • 2-s2.0-0032261155

Start Page


  • 3058

End Page


  • 3061

Volume


  • 5