Skip to main content

Avoiding Traffic Black-Holes for Route Aggregation in IS-IS

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Zhe Chen , Xiaohu Xu , Dean Cheng
Last updated 2019-03-10 (Latest revision 2018-09-06)
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:


When the Intermediate System to Intermediate System (IS-IS) routing protocol is adopted by a highly symmetric network such as the Leaf- Spine or Fat-Tree network, the Leaf nodes (e.g., Top of Rack switches in datacenters) are recommended to be prevented from receiving other nodes' explicit routes in order to achieve scalability. However, such a setup would cause traffic black-holes or suboptimal routing if link failure happens in the network. This document introduces INFINITE cost to IS-IS LSPs to solve this problem.


Zhe Chen
Xiaohu Xu
Dean Cheng

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