OSPF Flooding Reduction in Massively Scale Data Centers (MSDCs)
draft-xu-lsr-ospf-flooding-reduction-in-msdc-03
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2020-04-16 (latest revision 2019-10-14) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
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) | ||
https://www.ietf.org/archive/id/draft-xu-lsr-ospf-flooding-reduction-in-msdc-03.txt
Abstract
OSPF is one of the used 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 unnecessary link-state information flooding wastes the precious process resource of OSPF routers greatly due to the presence of too many OSPF neighbors for each OSPF router within the CLOS topology. This document proposes extensions to OSPF so as to reduce the OSPF flooding within such MSDC networks. 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.)