Shortest Path Routing Extensions for BGP Protocol
draft-keyupate-lsvr-bgp-spf-00

Document Type Replaced Internet-Draft (lsvr WG)
Last updated 2018-04-26 (latest revision 2018-03-03)
Replaced by draft-ietf-lsvr-bgp-spf
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state Adopted by a WG
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-lsvr-bgp-spf
Consensus Boilerplate Unknown
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
https://www.ietf.org/archive/id/draft-keyupate-lsvr-bgp-spf-00.txt

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 (keyur@arrcus.com)
Acee Lindem (acee@cisco.com)
Shawn Zandi (szandi@linkedin.com)
Wim Henderickx (wim.henderickx@nokia.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)