MPP: Optimal multi-path routing with protection

Tibor Cinkler, Laszlo Gyarmati

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

8 Citations (Scopus)

Abstract

Multi-Path Routing routes the upcoming demand over multiple paths. This is feasible in networks where the demand can be split into multiple parallel flows, i.e., the network is capable to perform inverse multiplexing (e.g., ngSDH and OTN via VCat) and where the connectivity of the topology also allows it. In this paper we propose the MPP (Multi-Path Protection) scheme, where the demand is not only routed, but also protected using multiple parallel paths. We give a Linear Programming (LP) formulation of the problem that finds the globally optimal solution. The main features of our approach are twofold. First, it always finds a trade-off between the number of parallel paths to be used and the total length of these paths while it balances the traffic optimally between them. Second, we use LP with real variables that is solvable in polynomial time instead of Integer LP (ILP) and still we are able to avoid branching of the flows in nodes different than the source and the target of the considered demand.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages165-169
Number of pages5
DOIs
Publication statusPublished - 12 Sep 2008
Externally publishedYes
EventIEEE International Conference on Communications, ICC 2008 - Beijing, China
Duration: 19 May 200823 May 2008

Other

OtherIEEE International Conference on Communications, ICC 2008
CountryChina
CityBeijing
Period19/5/0823/5/08

Fingerprint

Linear programming
Real variables
Parallel flow
Multiplexing
Topology
Polynomials

ASJC Scopus subject areas

  • Media Technology

Cite this

Cinkler, T., & Gyarmati, L. (2008). MPP: Optimal multi-path routing with protection. In IEEE International Conference on Communications (pp. 165-169). [4533074] https://doi.org/10.1109/ICC.2008.38

MPP : Optimal multi-path routing with protection. / Cinkler, Tibor; Gyarmati, Laszlo.

IEEE International Conference on Communications. 2008. p. 165-169 4533074.

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

Cinkler, T & Gyarmati, L 2008, MPP: Optimal multi-path routing with protection. in IEEE International Conference on Communications., 4533074, pp. 165-169, IEEE International Conference on Communications, ICC 2008, Beijing, China, 19/5/08. https://doi.org/10.1109/ICC.2008.38
Cinkler T, Gyarmati L. MPP: Optimal multi-path routing with protection. In IEEE International Conference on Communications. 2008. p. 165-169. 4533074 https://doi.org/10.1109/ICC.2008.38
Cinkler, Tibor ; Gyarmati, Laszlo. / MPP : Optimal multi-path routing with protection. IEEE International Conference on Communications. 2008. pp. 165-169
@inproceedings{a02e2fcffec04c798bc9409f50970847,
title = "MPP: Optimal multi-path routing with protection",
abstract = "Multi-Path Routing routes the upcoming demand over multiple paths. This is feasible in networks where the demand can be split into multiple parallel flows, i.e., the network is capable to perform inverse multiplexing (e.g., ngSDH and OTN via VCat) and where the connectivity of the topology also allows it. In this paper we propose the MPP (Multi-Path Protection) scheme, where the demand is not only routed, but also protected using multiple parallel paths. We give a Linear Programming (LP) formulation of the problem that finds the globally optimal solution. The main features of our approach are twofold. First, it always finds a trade-off between the number of parallel paths to be used and the total length of these paths while it balances the traffic optimally between them. Second, we use LP with real variables that is solvable in polynomial time instead of Integer LP (ILP) and still we are able to avoid branching of the flows in nodes different than the source and the target of the considered demand.",
author = "Tibor Cinkler and Laszlo Gyarmati",
year = "2008",
month = "9",
day = "12",
doi = "10.1109/ICC.2008.38",
language = "English",
isbn = "9781424420742",
pages = "165--169",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - MPP

T2 - Optimal multi-path routing with protection

AU - Cinkler, Tibor

AU - Gyarmati, Laszlo

PY - 2008/9/12

Y1 - 2008/9/12

N2 - Multi-Path Routing routes the upcoming demand over multiple paths. This is feasible in networks where the demand can be split into multiple parallel flows, i.e., the network is capable to perform inverse multiplexing (e.g., ngSDH and OTN via VCat) and where the connectivity of the topology also allows it. In this paper we propose the MPP (Multi-Path Protection) scheme, where the demand is not only routed, but also protected using multiple parallel paths. We give a Linear Programming (LP) formulation of the problem that finds the globally optimal solution. The main features of our approach are twofold. First, it always finds a trade-off between the number of parallel paths to be used and the total length of these paths while it balances the traffic optimally between them. Second, we use LP with real variables that is solvable in polynomial time instead of Integer LP (ILP) and still we are able to avoid branching of the flows in nodes different than the source and the target of the considered demand.

AB - Multi-Path Routing routes the upcoming demand over multiple paths. This is feasible in networks where the demand can be split into multiple parallel flows, i.e., the network is capable to perform inverse multiplexing (e.g., ngSDH and OTN via VCat) and where the connectivity of the topology also allows it. In this paper we propose the MPP (Multi-Path Protection) scheme, where the demand is not only routed, but also protected using multiple parallel paths. We give a Linear Programming (LP) formulation of the problem that finds the globally optimal solution. The main features of our approach are twofold. First, it always finds a trade-off between the number of parallel paths to be used and the total length of these paths while it balances the traffic optimally between them. Second, we use LP with real variables that is solvable in polynomial time instead of Integer LP (ILP) and still we are able to avoid branching of the flows in nodes different than the source and the target of the considered demand.

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

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

U2 - 10.1109/ICC.2008.38

DO - 10.1109/ICC.2008.38

M3 - Conference contribution

AN - SCOPUS:51249093657

SN - 9781424420742

SP - 165

EP - 169

BT - IEEE International Conference on Communications

ER -