Interdomain Path Computation for PCE-assisted Traffic Engineering

Abstract

Interdomain Traffic Engineering (TE) across domains employing Path Computation Elements should allow a source domain to select a good AS path, i.e. one likely to allow the actual setup of an interdomain tunnel. This is impossible if the AS path is computed online during path setup (which happens, e.g., in per-domain tunnel setup). On the other hand, the routes that a source domain learns from BGP are normally too few, and oblivious to TE constraints. In this paper, we present the Inter-AS Path Computation Protocol (IA-PCP), whose purpose is to compute a larger number of “good” AS paths, allowing a source to choose the suitable one among a larger set, so as to route PCE-assisted interdomain path computation. We show that, within a reasonable computation time, sending relatively few messages and preserving domain confidentiality, IA-PCP provides a source domain with a set of AS paths which closely approximates the one found exploiting full knowledge of the network AS-topology.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.4108/icst.broadnets2009.7262

• http://eudl.eu/pdf/10.4108/ICST.BROADNETS2009.7262

• http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005336388,

https://arpi.unipi.it/handle/11568/197834,

https://dblp.uni-trier.de/db/conf/broadnets/broadnets2009.html#BistiMS09,

https://eudl.eu/doi/10.4108/ICST.BROADNETS2009.7262,

https://academic.microsoft.com/#/detail/2153769283