Multipath routing can provide a better solution for several of the current BGP's problems in the inter-domain scenario by allowing a cleaner separation between routing and traffic engineering and better failure containment. The separation between routing control logic and data forwarding, and the use of software defined networking principles open space to easier deployments of new routing protocols at the inter-domain level. This paper explores the potential of using a multipath policy based inter-domain routing algorithm based on an algebraic model. The algorithm establishes multiple paths to a destination following a policy-based architecture and works with simple destination-based hop-by-hop forwarding. We focus on the definition of algebraic models for the links, their composition and the resulting path's ranking. Our algorithm addresses the most common situations in the Internet and we include others not so common as backup links and sibling relations. We prove the correctness of the algorithm under conditions that open several implementation options and describe how it can use multipath for failure containment, using the extra paths to make each failure less important. The paper finishes with the presentation of some experimental results that illustrate the algorithm capabilities.
|Title of host publication||IEEE International Conference on Communications|
|Publication status||Published - 1 Jan 2014|
|Event||IEEE International Conference on Communications (ICC) - |
Duration: 1 Jan 2014 → …
|Conference||IEEE International Conference on Communications (ICC)|
|Period||1/01/14 → …|