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

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Author Petr Lapukhov 
Last updated 2017-05-04 (latest revision 2016-10-31)
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-00.txt

Abstract

BGP routing protocol defined in ([RFC4271]) employs tie-breaking logic to elect single best path among multiple possible. At the same time, it has been common in virtually all BGP implementations to allow for "equal-cost multipath" (ECMP) election and programming of multiple next-hops in routing tables. This documents summarizes some common considerations for the ECMP logic, with the intent of providing common reference on otherwise unstandardized feature.

Authors

Petr Lapukhov (petr@fb.com)

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