Enhanced BRPC routing procedure for PCE based inter-domain routing

Authors:
Rong Fu;Michael S. Berger
Affiliations:
Department of Photonics Engineering, Technical University of Denmark, Denmark;Department of Photonics Engineering, Technical University of Denmark, Denmark
Venue:
ICCOM'10 Proceedings of the 14th WSEAS international conference on Communications
Year:
2010

Citing 2
Cited 0

Distributed schemes for diverse path computation in multidomain MPLS networks

IEEE Communications Magazine
Open issues in interdomain routing: a survey

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

IETF proposes Backward-Recursive PCE (Path Computation Element)-based Computation (BRPC) procedure to compute shortest constrained Traffic Engineering Label Switched Paths (TE LSPs) across domains with predetermined sequences. However, computing TE LSPs over predetermined domain paths imposes limitations on load-balancing of inter-domain networks. Hence, we enhance BRPC procedure with the ability to maintain and exchange the metrics of inter-domain path information. Therefore PCEs are able to compute BRPC domain paths dynamically. In our project, we implement a PCE based inter-domain routing OPNET model. The model simulates two scenarios including BRPC routing procedures across pre-determined domain sequence and dynamically computed domain sequence. The connection blocking probabilities from different scenarios are measured as indicator of the TE improvement that the dynamic domain sequence brings.