LS Flooding Reduction
draft-cc-lsr-flooding-reduction-00

The information below is for an old version of the document
Document Type None Internet-Draft (individual)
Last updated 2018-12-10
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Additional URLs
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Unknown state
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-cc-lsr-flooding-reduction-00.txt

Abstract

This document proposes an approach to flood link states on a topology that is a subgraph of the complete topology per underline physical network, so that the amount of flooding traffic in the network is greatly reduced, and it would reduce convergence time with a more stable and optimized routing environment. The approach can be applied to any network topology in a single area.

Authors

Huaimo Chen (huaimo.chen@huawei.com)
Dean Cheng (dean.cheng@huawei.com)
Mehmet Toy (mehmet.toy@verizon.com)
Yi Yang (yyietf@gmail.com)

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