Skip to main content

BGP Link-State Shortest Path First (SPF) Routing

The information below is for an old version of the document.
Document Type This is an older version of an Internet-Draft whose latest revision is Expired
Authors Keyur Patel , Acee Lindem , Shawn Zandi , Wim Henderickx
Last updated 2022-01-02 (Latest revision 2021-07-01)
Replaces draft-keyupate-lsvr-bgp-spf
Stream Internet Engineering Task Force (IETF)
Expired & archived
OPSDIR Last Call Review Incomplete, due 2021-06-17
Stream WG state In WG Last Call
Document shepherd Victor Kuarsingh
Shepherd write-up Show Last changed 2020-05-26
IESG IESG state Expired (IESG: Dead)
Consensus boilerplate Yes
Telechat date (None)
Responsible AD Alvaro Retana
Send notices to Gunter Van de Velde <>,,

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:


Many Massively Scaled Data Centers (MSDCs) have converged on simplified layer 3 routing. Furthermore, requirements for operational simplicity have led 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 extensions to BGP to use BGP Link-State distribution and the Shortest Path First (SPF) algorithm used by Internal Gateway Protocols (IGPs) such as OSPF. In doing this, it allows BGP to be efficiently used as both the underlay protocol and the overlay protocol in MSDCs.


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