Equal-Cost Multipath Considerations for BGP
draft-lapukhov-bgp-ecmp-considerations-00
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2017-05-04 (latest revision 2016-10-31) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
pdf
html
bibtex
|
||
| 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
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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)