Optimal $$K$$ K -survivable backward-recursive path computation (BRPC) in multi-domain PCE-based networks

Abstract

The path computation element (PCE) enables optimal path computation in single-domain (G)MPLS networks. To overcome the lack of traffic engineering (TE) information in multi-domain networks and to preserve both computation optimality and domain confidentiality, the backward-recursive PCE-based computation (BRPC) procedure has been standardized. BRPC procedure is based on PCE protocol (PCEP) and enables synchronized computation of TE label-switched paths with the requested level of reliability and quality of service requirements (i.e., guaranteed bandwidth). In this paper, the problem of computing $$K$$ K -survivable optimal multi-domain paths by resorting to BRPC procedure is analyzed. Extensions to PCEP protocol are discussed to achieve path optimality when domain information is kept confidential. The optimality is theoretically proved, and the computational complexity is shown to be more efficient than existing approaches. The discussed extensions are experimentally validated in an MPLS network test bed based on commercial equipments and are shown to have performance comparable to standard PCEP approach.