Skip to main content

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

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 state is "Active".
Expired & archived
Author Petr Lapukhov
Last updated 2018-05-03 (Latest revision 2017-10-30)
RFC stream (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

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

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 all practical BGP implementations to allow for "equal-cost multipath" (ECMP) path election and programming of multiple next-hops in routing tables. This documents provides some common considerations for the ECMP logic, with the intent of providing common reference on otherwise unstandardized feature.

Authors

Petr Lapukhov

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