Skip to main content

PCEP extension for multi-fiber existing in inter-domain link

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Jie Zhang , Jingjing Wang, Yongli Zhao , Shanguo Huang , Yun Bai, Zhihong Wang, Xuping Cao
Last updated 2013-07-13 (Latest revision 2013-01-09)
RFC stream (None)
Intended RFC status (None)
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:


Currently, most route computing algorithms only compute a shortest or an optimal path.The results of this computation just refer to link level, without consideration of fibers. But, in real networks, the link between two adjacent nodes always has multi-fibers. This condition above happens more frequently especially for the gateway nodes in the multi-domain network. Moreover, the number of links between two adjacent domains is always more than one. From the view of parent PCE, the two conditions above will be regarded as the problem of multi-fibers between adjacent nodes. However, most route computing algorithms always can not solve the problem of multi-fiber between adjacent nodes. As a result, parent PCE can not compute the route sequence with specific fibers. It brings distress and problems when parent PCE computing the loose route sequence. In order to solve the problems existing in real networks, an efficient solution will be proposed for parent PCE facing the multi- fiber between adjacent nodes. Some interface and structure will be expanded in this proposal.


Jie Zhang
Jingjing Wang
Yongli Zhao
Shanguo Huang
Yun Bai
Zhihong Wang
Xuping Cao

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