Linear formulation for path shared protection

Pin Han Ho, J. Tapolcai, Hussein T. Mouftah, Chi Hsiang Yeh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

This paper investigates the problem of optimal diverse routing for shared path-based protection in the complete routing information scenario on mesh optical networks, where a novel Integer Linear Programming (ILP) formulation is introduced such that the least-cost link-disjoint working and protection path-pair can be derived in a single step. The proposed ILP formulation is characterized by the facts that it is solvable with the commercially available Linear Programming (LP) solvers and that it can deal with the dependency between working and spare capacity in the network, which is a step ahead of the most state-of-the-art techniques in the design of diverse routing algorithms for shared protection. To verify the proposed ILP, an experiment is conducted to compare it with four reported schemes for end-to-end shared protection on two network topologies, namely APF-PBC, MLR, ITSA, and ILP-2S, where blocking probability is taken as the performance metric with connection requests being dynamically launched into the networks. The simulation results show that the ILP formulation yields the best performance while the ILP-2S scheme investigating less network states yields the worst. We also use the results by the proposed ILP to evaluate the four heuristic-based schemes adopted in the simulation in terms of two performance indexes - the percentage of optimality (denoted as %opti) and the offset of optimality (denoted as Q).

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages1622-1627
Number of pages6
Volume3
Publication statusPublished - 2004
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

Other

Other2004 IEEE International Conference on Communications
CountryFrance
CityParis
Period6/20/046/24/04

Fingerprint

Linear programming
Blocking probability
Routing algorithms
Fiber optic networks
Topology
Costs
Experiments

Keywords

  • Integer Linear Programming (ILP)
  • Shared protection
  • Spare link-state
  • Survivable routing

ASJC Scopus subject areas

  • Media Technology

Cite this

Ho, P. H., Tapolcai, J., Mouftah, H. T., & Yeh, C. H. (2004). Linear formulation for path shared protection. In IEEE International Conference on Communications (Vol. 3, pp. 1622-1627)

Linear formulation for path shared protection. / Ho, Pin Han; Tapolcai, J.; Mouftah, Hussein T.; Yeh, Chi Hsiang.

IEEE International Conference on Communications. Vol. 3 2004. p. 1622-1627.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ho, PH, Tapolcai, J, Mouftah, HT & Yeh, CH 2004, Linear formulation for path shared protection. in IEEE International Conference on Communications. vol. 3, pp. 1622-1627, 2004 IEEE International Conference on Communications, Paris, France, 6/20/04.
Ho PH, Tapolcai J, Mouftah HT, Yeh CH. Linear formulation for path shared protection. In IEEE International Conference on Communications. Vol. 3. 2004. p. 1622-1627
Ho, Pin Han ; Tapolcai, J. ; Mouftah, Hussein T. ; Yeh, Chi Hsiang. / Linear formulation for path shared protection. IEEE International Conference on Communications. Vol. 3 2004. pp. 1622-1627
@inproceedings{250d51738070497a9c178eb4e0499be6,
title = "Linear formulation for path shared protection",
abstract = "This paper investigates the problem of optimal diverse routing for shared path-based protection in the complete routing information scenario on mesh optical networks, where a novel Integer Linear Programming (ILP) formulation is introduced such that the least-cost link-disjoint working and protection path-pair can be derived in a single step. The proposed ILP formulation is characterized by the facts that it is solvable with the commercially available Linear Programming (LP) solvers and that it can deal with the dependency between working and spare capacity in the network, which is a step ahead of the most state-of-the-art techniques in the design of diverse routing algorithms for shared protection. To verify the proposed ILP, an experiment is conducted to compare it with four reported schemes for end-to-end shared protection on two network topologies, namely APF-PBC, MLR, ITSA, and ILP-2S, where blocking probability is taken as the performance metric with connection requests being dynamically launched into the networks. The simulation results show that the ILP formulation yields the best performance while the ILP-2S scheme investigating less network states yields the worst. We also use the results by the proposed ILP to evaluate the four heuristic-based schemes adopted in the simulation in terms of two performance indexes - the percentage of optimality (denoted as {\%}opti) and the offset of optimality (denoted as Q).",
keywords = "Integer Linear Programming (ILP), Shared protection, Spare link-state, Survivable routing",
author = "Ho, {Pin Han} and J. Tapolcai and Mouftah, {Hussein T.} and Yeh, {Chi Hsiang}",
year = "2004",
language = "English",
volume = "3",
pages = "1622--1627",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Linear formulation for path shared protection

AU - Ho, Pin Han

AU - Tapolcai, J.

AU - Mouftah, Hussein T.

AU - Yeh, Chi Hsiang

PY - 2004

Y1 - 2004

N2 - This paper investigates the problem of optimal diverse routing for shared path-based protection in the complete routing information scenario on mesh optical networks, where a novel Integer Linear Programming (ILP) formulation is introduced such that the least-cost link-disjoint working and protection path-pair can be derived in a single step. The proposed ILP formulation is characterized by the facts that it is solvable with the commercially available Linear Programming (LP) solvers and that it can deal with the dependency between working and spare capacity in the network, which is a step ahead of the most state-of-the-art techniques in the design of diverse routing algorithms for shared protection. To verify the proposed ILP, an experiment is conducted to compare it with four reported schemes for end-to-end shared protection on two network topologies, namely APF-PBC, MLR, ITSA, and ILP-2S, where blocking probability is taken as the performance metric with connection requests being dynamically launched into the networks. The simulation results show that the ILP formulation yields the best performance while the ILP-2S scheme investigating less network states yields the worst. We also use the results by the proposed ILP to evaluate the four heuristic-based schemes adopted in the simulation in terms of two performance indexes - the percentage of optimality (denoted as %opti) and the offset of optimality (denoted as Q).

AB - This paper investigates the problem of optimal diverse routing for shared path-based protection in the complete routing information scenario on mesh optical networks, where a novel Integer Linear Programming (ILP) formulation is introduced such that the least-cost link-disjoint working and protection path-pair can be derived in a single step. The proposed ILP formulation is characterized by the facts that it is solvable with the commercially available Linear Programming (LP) solvers and that it can deal with the dependency between working and spare capacity in the network, which is a step ahead of the most state-of-the-art techniques in the design of diverse routing algorithms for shared protection. To verify the proposed ILP, an experiment is conducted to compare it with four reported schemes for end-to-end shared protection on two network topologies, namely APF-PBC, MLR, ITSA, and ILP-2S, where blocking probability is taken as the performance metric with connection requests being dynamically launched into the networks. The simulation results show that the ILP formulation yields the best performance while the ILP-2S scheme investigating less network states yields the worst. We also use the results by the proposed ILP to evaluate the four heuristic-based schemes adopted in the simulation in terms of two performance indexes - the percentage of optimality (denoted as %opti) and the offset of optimality (denoted as Q).

KW - Integer Linear Programming (ILP)

KW - Shared protection

KW - Spare link-state

KW - Survivable routing

UR - http://www.scopus.com/inward/record.url?scp=4143146640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4143146640&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:4143146640

VL - 3

SP - 1622

EP - 1627

BT - IEEE International Conference on Communications

ER -