Scalable and efficient multipath routing: Complexity and algorithms

J. Tapolcai, Gabor Retvari, Peter Babarczi, Erika R. Berczi-Kovacs, Panna Kristof, Gabor Enyedi

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

6 Citations (Scopus)

Abstract

A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by only two forwarding table entries per destination. Building on prior work on minimum length redundant trees, we show that the underlying mathematical problem is NP-complete and we present heuristic algorithms that improve the known complexity bounds from cubic to the order of a single shortest path search. Finally, by extensive simulations we find that it is possible to very closely attain the absolute optimal path length with our algorithms (the gap is just 1 - 5%), eventually opening the door for wide-scale multipath routing deployments.

Original languageEnglish
Title of host publicationProceedings - International Conference on Network Protocols, ICNP
PublisherIEEE Computer Society
Pages376-385
Number of pages10
Volume2016-March
ISBN (Print)9781467382953
DOIs
Publication statusPublished - Mar 18 2016
Event23rd IEEE International Conference on Network Protocols, ICNP 2015 - San Francisco, United States
Duration: Nov 10 2015Nov 13 2015

Other

Other23rd IEEE International Conference on Network Protocols, ICNP 2015
CountryUnited States
CitySan Francisco
Period11/10/1511/13/15

Fingerprint

Heuristic algorithms
Computational complexity

Keywords

  • Independent spanning trees
  • Minimal path length
  • Not-all-equal 3SAT
  • Protection routing
  • Redundant trees

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Tapolcai, J., Retvari, G., Babarczi, P., Berczi-Kovacs, E. R., Kristof, P., & Enyedi, G. (2016). Scalable and efficient multipath routing: Complexity and algorithms. In Proceedings - International Conference on Network Protocols, ICNP (Vol. 2016-March, pp. 376-385). [7437145] IEEE Computer Society. https://doi.org/10.1109/ICNP.2015.44

Scalable and efficient multipath routing : Complexity and algorithms. / Tapolcai, J.; Retvari, Gabor; Babarczi, Peter; Berczi-Kovacs, Erika R.; Kristof, Panna; Enyedi, Gabor.

Proceedings - International Conference on Network Protocols, ICNP. Vol. 2016-March IEEE Computer Society, 2016. p. 376-385 7437145.

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

Tapolcai, J, Retvari, G, Babarczi, P, Berczi-Kovacs, ER, Kristof, P & Enyedi, G 2016, Scalable and efficient multipath routing: Complexity and algorithms. in Proceedings - International Conference on Network Protocols, ICNP. vol. 2016-March, 7437145, IEEE Computer Society, pp. 376-385, 23rd IEEE International Conference on Network Protocols, ICNP 2015, San Francisco, United States, 11/10/15. https://doi.org/10.1109/ICNP.2015.44
Tapolcai J, Retvari G, Babarczi P, Berczi-Kovacs ER, Kristof P, Enyedi G. Scalable and efficient multipath routing: Complexity and algorithms. In Proceedings - International Conference on Network Protocols, ICNP. Vol. 2016-March. IEEE Computer Society. 2016. p. 376-385. 7437145 https://doi.org/10.1109/ICNP.2015.44
Tapolcai, J. ; Retvari, Gabor ; Babarczi, Peter ; Berczi-Kovacs, Erika R. ; Kristof, Panna ; Enyedi, Gabor. / Scalable and efficient multipath routing : Complexity and algorithms. Proceedings - International Conference on Network Protocols, ICNP. Vol. 2016-March IEEE Computer Society, 2016. pp. 376-385
@inproceedings{758f1fb5d0364b77893920e76e3701b4,
title = "Scalable and efficient multipath routing: Complexity and algorithms",
abstract = "A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by only two forwarding table entries per destination. Building on prior work on minimum length redundant trees, we show that the underlying mathematical problem is NP-complete and we present heuristic algorithms that improve the known complexity bounds from cubic to the order of a single shortest path search. Finally, by extensive simulations we find that it is possible to very closely attain the absolute optimal path length with our algorithms (the gap is just 1 - 5{\%}), eventually opening the door for wide-scale multipath routing deployments.",
keywords = "Independent spanning trees, Minimal path length, Not-all-equal 3SAT, Protection routing, Redundant trees",
author = "J. Tapolcai and Gabor Retvari and Peter Babarczi and Berczi-Kovacs, {Erika R.} and Panna Kristof and Gabor Enyedi",
year = "2016",
month = "3",
day = "18",
doi = "10.1109/ICNP.2015.44",
language = "English",
isbn = "9781467382953",
volume = "2016-March",
pages = "376--385",
booktitle = "Proceedings - International Conference on Network Protocols, ICNP",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Scalable and efficient multipath routing

T2 - Complexity and algorithms

AU - Tapolcai, J.

AU - Retvari, Gabor

AU - Babarczi, Peter

AU - Berczi-Kovacs, Erika R.

AU - Kristof, Panna

AU - Enyedi, Gabor

PY - 2016/3/18

Y1 - 2016/3/18

N2 - A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by only two forwarding table entries per destination. Building on prior work on minimum length redundant trees, we show that the underlying mathematical problem is NP-complete and we present heuristic algorithms that improve the known complexity bounds from cubic to the order of a single shortest path search. Finally, by extensive simulations we find that it is possible to very closely attain the absolute optimal path length with our algorithms (the gap is just 1 - 5%), eventually opening the door for wide-scale multipath routing deployments.

AB - A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by only two forwarding table entries per destination. Building on prior work on minimum length redundant trees, we show that the underlying mathematical problem is NP-complete and we present heuristic algorithms that improve the known complexity bounds from cubic to the order of a single shortest path search. Finally, by extensive simulations we find that it is possible to very closely attain the absolute optimal path length with our algorithms (the gap is just 1 - 5%), eventually opening the door for wide-scale multipath routing deployments.

KW - Independent spanning trees

KW - Minimal path length

KW - Not-all-equal 3SAT

KW - Protection routing

KW - Redundant trees

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

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

U2 - 10.1109/ICNP.2015.44

DO - 10.1109/ICNP.2015.44

M3 - Conference contribution

AN - SCOPUS:84969752648

SN - 9781467382953

VL - 2016-March

SP - 376

EP - 385

BT - Proceedings - International Conference on Network Protocols, ICNP

PB - IEEE Computer Society

ER -