A Dual-end Recursive PCE-Based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths
draft-fuxh-pce-drpc-03

Document Type Expired Internet-Draft (individual)
Authors Xihua Fu  , Yuanlin Bao  , Yongli Zhao  , Jie Zhang 
Last updated 2012-03-26 (latest revision 2011-08-30)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-fuxh-pce-drpc-03.txt

Abstract

A dual-end recursive PCE-based computation procedure (DRPC) is proposed to compute shortest constrained inter-domain traffic engineering label switched paths based on BRPC in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. By recursively performing shortest path algorithm and transferring the segmental path computation result from both ends bi-directionally, they meet at one of the Middle PCEs, generating a directional shortest path graph into which the two shortest path trees are stitched together. Therefore, the end-to-end constrained inter- domain traffic engineering label switched path, even k shortest paths can be gained from the directional shortest path graph directly.

Authors

Xihua Fu (fu.xihua@zte.com.cn)
Yuanlin Bao (bao.yuanlin@zte.com.cn)
Yongli Zhao (yonglizhao@bupt.edu.cn)
Jie Zhang (lgr24@bupt.edu.cn)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)