Equal-Cost Multipath Considerations for BGP
draft-lapukhov-bgp-ecmp-considerations-05

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Authors Petr Lapukhov  , Jeff Tantsura 
Last updated 2021-05-19 (latest revision 2020-11-15)
Stream (None)
Formats
Expired & archived
pdf htmlized bibtex
Additional Resources
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
https://www.ietf.org/archive/id/draft-lapukhov-bgp-ecmp-considerations-05.txt

Abstract

BGP (Border Gateway Protocol) [RFC4271] employs tie-breaking logic to select a single best path among multiple paths available, known as BGP best path selection. At the same time, it has become a common practice to allow for "equal-cost multipath" (ECMP) selection and programming of multiple next-hops in routing tables. This document summarizes some common considerations for the ECMP logic when BGP is used as the routing protocol, with the intent of providing common reference for otherwise unstandardized set of features.

Authors

Petr Lapukhov (petr@fb.com)
Jeff Tantsura (jefftant.ietf@gmail.com)

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