Efficient Implementation Method for Loop-free Criterion
draft-geng-iac-caba-00

Document Type Expired Internet-Draft (individual)
Authors Haijun Geng  , Han Zhang  , Xingang Shi  , Zhiliang Wang  , Xia Yin 
Last updated 2020-11-16 (latest revision 2020-05-12)
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-geng-iac-caba-00.txt

Abstract

[RFC5286] introduces Loop-Free Criterion (LFC) in detail, which is a technology for local fast rerouting when network failures occur. With LFC, alternate next hops are stored alongside with the default next hops in a routers forwarding table, and can be immediately activated to invoke a loop free repair path in face of link failure. As long as not introducing routing loops, these alternative next hops can also be used for multipath transmission if there are stringent demands on bandwidth or load balancing. However, in such link state networks, computing loop free alternates typically requires one or more rounds of full shortest path tree computation on a graph, and poses a heavy burden to both the processor load and the memory consumption of a network equipment. In this document, we describe an efficient Loop-free Criterion (LFC) implementation method which is based on incremental shortest path first (i-SPF), which is suitable for practical deployment in large scale networks. The computational complexity of the method is independent of the average node degree of the network.

Authors

Haijun Geng (genghaijun@sxu.edu.cn)
Han Zhang (zhhan@buaa.edu.cn)
Xingang Shi (shixg@cernet.edu.cn)
Zhiliang Wang (wzl@cernet.edu.cn)
Xia Yin (yxia@tsinghua.edu.cn)

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