Shortest Path Routing Extensions for BGP Protocol
draft-keyupate-idr-bgp-spf-04
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Keyur Patel , Acee Lindem , Shawn Zandi , Gunter Van de Velde | ||
| Last updated | 2018-07-16 (Latest revision 2018-01-12) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| 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:
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 algorithm similar to Internal Gateway Protocols (IGPs) such as OSPF.
Authors
Keyur Patel
Acee Lindem
Shawn Zandi
Gunter Van de Velde
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)