OSPF Flooding Reduction in MSDC
draft-xu-lsr-ospf-flooding-reduction-in-msdc-01

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2019-04-21 (latest revision 2018-10-18)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Additional URLs
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-xu-lsr-ospf-flooding-reduction-in-msdc-01.txt

Abstract

OSPF is commonly used as an underlay routing protocol for MSDC (Massively Scalable Data Center) networks. For a given OSPF router within the CLOS topology, it would receive multiple copies of exactly the same LSA from multiple OSPF neighbors. In addition, two OSPF neighbors may send each other the same LSA simultaneously. The unneccessary link-state information flooding wastes the precious process resource of OSPF routers greatly due to the fact that there are too many OSPF neighbors for each OSPF router within the CLOS topology. This document proposes some extensions to OSPF so as to reduce the OSPF flooding within MSDC networks greatly. The reduction of the OSPF flooding is much beneficial to improve the scalability of MSDC networks. These modifications are applicable to both OSPFv2 and OSPFv3.

Authors

Xiaohu Xu (xiaohu.xxh@alibaba-inc.com)
Luyuan Fang (luyuanf@gmail.com)
Jeff Tantsura (jefftant.ietf@gmail.com)
Shaowen Ma (mashao@juniper.net)

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