### Abstract

Original language | English |
---|---|

Publication status | Published - 2011 |

### Fingerprint

### Keywords

- Metarouting
- infrastructure routing
- distributed algorithm

### Cite this

}

**A Distributed Local-Optimum Distance Vector Algorithm for the Metarouting Approach.** / Dynerowicz, Seweryn; Colin, Jean-Noël; Schumacher, Laurent.

Research output: Other contribution

TY - GEN

T1 - A Distributed Local-Optimum Distance Vector Algorithm for the Metarouting Approach.

AU - Dynerowicz, Seweryn

AU - Colin, Jean-Noël

AU - Schumacher, Laurent

PY - 2011

Y1 - 2011

N2 - We present a formal distributed algorithm that can be used for the deployment of arbitrary routing policies in a network infrastructure that attempts to complete the ideas proposed by Griffin et al. We prove that our algorithm is based on a function that satisfies conditions proposed by Bertsekas. These conditions guarantee that the distributed version of the algorithm will converge and yield the same result as a centralized computation of the routing matrix. We also present a prototype in Haskell that illustrates the possibilities of defining policies and general computations on them.

AB - We present a formal distributed algorithm that can be used for the deployment of arbitrary routing policies in a network infrastructure that attempts to complete the ideas proposed by Griffin et al. We prove that our algorithm is based on a function that satisfies conditions proposed by Bertsekas. These conditions guarantee that the distributed version of the algorithm will converge and yield the same result as a centralized computation of the routing matrix. We also present a prototype in Haskell that illustrates the possibilities of defining policies and general computations on them.

KW - Metarouting

KW - infrastructure routing

KW - distributed algorithm

M3 - Other contribution

SN - 978-1-61284-231-8

ER -