Shortest Path Routing Extensions for BGP Protocol
draft-ietf-lsvr-bgp-spf-04
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| Authors | Keyur Patel , Acee Lindem , Shawn Zandi , Wim Henderickx | ||
| Last updated | 2019-06-23 (Latest revision 2018-12-20) | ||
| Replaces | draft-keyupate-lsvr-bgp-spf | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Reviews |
RTGDIR Early review
(of
-02)
by Dan Frost
Has issues
|
||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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:
Abstract
Many Massively Scaled Data Centers (MSDCs) have converged on simplified layer 3 routing. Furthermore, requirements for operational simplicity have lead many of these MSDCs to converge on BGP as their single routing protocol for both their fabric routing and their Data Center Interconnect (DCI) routing. This document describes a solution which leverages BGP Link-State distribution and the Shortest Path First (SPF) algorithm similar to Internal Gateway Protocols (IGPs) such as OSPF.
Authors
Keyur Patel
Acee Lindem
Shawn Zandi
Wim Henderickx
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)