6th International ICST Conference on Broadband Communications, Networks, and Systems

Research Article

Interdomain Path Computation for PCE-assisted Traffic Engineering

Download560 downloads
  • @INPROCEEDINGS{10.4108/ICST.BROADNETS2009.7262,
        author={L. Bisti and E. Mingozzi and G. Stea},
        title={Interdomain Path Computation for PCE-assisted Traffic Engineering},
        proceedings={6th International ICST Conference on Broadband Communications, Networks, and Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2009},
        month={11},
        keywords={Interdomain Traffic Engineering AS path Path Computation Element},
        doi={10.4108/ICST.BROADNETS2009.7262}
    }
    
  • L. Bisti
    E. Mingozzi
    G. Stea
    Year: 2009
    Interdomain Path Computation for PCE-assisted Traffic Engineering
    BROADNETS
    IEEE
    DOI: 10.4108/ICST.BROADNETS2009.7262
L. Bisti1,*, E. Mingozzi1,*, G. Stea1,*
  • 1: Dipartimento di Ingegneria dell’Informazione, University of Pisa, Via Diotisalvi 2, 56122 Pisa – Italy
*Contact email: luca.bisti@iet.unipi.it, e.mingozzi@iet.unipi.it, g.stea@iet.unipi.it

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 PCEassisted 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.