Shortest Path Routing Extensions for BGP Protocol

Document Type Expired Internet-Draft (individual)
Authors Keyur Patel  , Acee Lindem  , Shawn Zandi  , Gunter Van de Velde 
Last updated 2018-07-16 (latest revision 2018-01-12)
Stream (None)
Intended RFC status (None)
Expired & archived
plain text pdf 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)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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.


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.)