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

Research output: Other contribution

Abstract

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.
Original languageEnglish
Publication statusPublished - 2011

Keywords

  • Metarouting
  • infrastructure routing
  • distributed algorithm

Fingerprint Dive into the research topics of 'A Distributed Local-Optimum Distance Vector Algorithm for the Metarouting Approach.'. Together they form a unique fingerprint.

  • Projects

    Cite this