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

7 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

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