MARA

Maximum alternative routing algorithm

Yasuhiro Ohara, Shinji Imahori, Rodney D Van Meter

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

31 Citations (Scopus)

Abstract

In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3) maximizing the minimum max-flow as an extension of shortest path routing. A family of new algorithms called Maximum Alternative Routing Algorithms (MARAs) is described, proven formally to solve the problems optimally, and contrasted with existing multipath algorithms. MARAs are evaluated for the number of paths, the length of paths, the computational complexity, and the computation time, using simulations based on several real Internet Autonomous System (AS) network topologies. We show that MARAs run in sub-second times on moderate-speed processors and achieve a significant increase in the number of paths compared to existing multipath routing algorithms. These results should help further the process of deploying multipath routing in real-world networks.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages298-306
Number of pages9
DOIs
Publication statusPublished - 2009
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: 2009 Apr 192009 Apr 25

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period09/4/1909/4/25

Fingerprint

Routing algorithms
Fault tolerance
Computational complexity
Topology
Internet

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Ohara, Y., Imahori, S., & Van Meter, R. D. (2009). MARA: Maximum alternative routing algorithm. In Proceedings - IEEE INFOCOM (pp. 298-306). [5061933] https://doi.org/10.1109/INFCOM.2009.5061933

MARA : Maximum alternative routing algorithm. / Ohara, Yasuhiro; Imahori, Shinji; Van Meter, Rodney D.

Proceedings - IEEE INFOCOM. 2009. p. 298-306 5061933.

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

Ohara, Y, Imahori, S & Van Meter, RD 2009, MARA: Maximum alternative routing algorithm. in Proceedings - IEEE INFOCOM., 5061933, pp. 298-306, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 09/4/19. https://doi.org/10.1109/INFCOM.2009.5061933
Ohara Y, Imahori S, Van Meter RD. MARA: Maximum alternative routing algorithm. In Proceedings - IEEE INFOCOM. 2009. p. 298-306. 5061933 https://doi.org/10.1109/INFCOM.2009.5061933
Ohara, Yasuhiro ; Imahori, Shinji ; Van Meter, Rodney D. / MARA : Maximum alternative routing algorithm. Proceedings - IEEE INFOCOM. 2009. pp. 298-306
@inproceedings{3eb67aedb60d41eea2e337394db3eabb,
title = "MARA: Maximum alternative routing algorithm",
abstract = "In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3) maximizing the minimum max-flow as an extension of shortest path routing. A family of new algorithms called Maximum Alternative Routing Algorithms (MARAs) is described, proven formally to solve the problems optimally, and contrasted with existing multipath algorithms. MARAs are evaluated for the number of paths, the length of paths, the computational complexity, and the computation time, using simulations based on several real Internet Autonomous System (AS) network topologies. We show that MARAs run in sub-second times on moderate-speed processors and achieve a significant increase in the number of paths compared to existing multipath routing algorithms. These results should help further the process of deploying multipath routing in real-world networks.",
author = "Yasuhiro Ohara and Shinji Imahori and {Van Meter}, {Rodney D}",
year = "2009",
doi = "10.1109/INFCOM.2009.5061933",
language = "English",
isbn = "9781424435135",
pages = "298--306",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - MARA

T2 - Maximum alternative routing algorithm

AU - Ohara, Yasuhiro

AU - Imahori, Shinji

AU - Van Meter, Rodney D

PY - 2009

Y1 - 2009

N2 - In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3) maximizing the minimum max-flow as an extension of shortest path routing. A family of new algorithms called Maximum Alternative Routing Algorithms (MARAs) is described, proven formally to solve the problems optimally, and contrasted with existing multipath algorithms. MARAs are evaluated for the number of paths, the length of paths, the computational complexity, and the computation time, using simulations based on several real Internet Autonomous System (AS) network topologies. We show that MARAs run in sub-second times on moderate-speed processors and achieve a significant increase in the number of paths compared to existing multipath routing algorithms. These results should help further the process of deploying multipath routing in real-world networks.

AB - In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3) maximizing the minimum max-flow as an extension of shortest path routing. A family of new algorithms called Maximum Alternative Routing Algorithms (MARAs) is described, proven formally to solve the problems optimally, and contrasted with existing multipath algorithms. MARAs are evaluated for the number of paths, the length of paths, the computational complexity, and the computation time, using simulations based on several real Internet Autonomous System (AS) network topologies. We show that MARAs run in sub-second times on moderate-speed processors and achieve a significant increase in the number of paths compared to existing multipath routing algorithms. These results should help further the process of deploying multipath routing in real-world networks.

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

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

U2 - 10.1109/INFCOM.2009.5061933

DO - 10.1109/INFCOM.2009.5061933

M3 - Conference contribution

SN - 9781424435135

SP - 298

EP - 306

BT - Proceedings - IEEE INFOCOM

ER -