Overheads Reduction for IS-IS Enabled Spine-Leaf Networks

Document Type Expired Internet-Draft (individual)
Last updated 2018-09-06 (latest revision 2018-03-05)
Stream (None)
Intended RFC status (None)
Expired & archived
plain text pdf html 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


When a Spine-Leaf topology adopts the Intermediate System to Intermediate System (IS-IS) routing protocol, the Leaf node receives Link State Packets (LSPs) from all the other nodes thus having the entire routing information of the topology. This is usually considered unnecessary and costly. This document describes a solution to this problem by utilizing IS-IS's inherent multi-level and area partition features, which requires that an IS-IS router SHOULD check a level-1 LSP's area addresses before advertising it to a neighbor.


Zhe Chen (chenzhe17@huawei.com)
Xiaohu Xu (xiaohu.xxh@alibaba-inc.com)
Dean Cheng (dean.cheng@huawei.com)

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