Deterministic Upstream Neighbor Selection for PIM Joins
draft-ietf-pim-deterministic-ecmp-00
| Document | Type |
Expired Internet-Draft
(pim WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Bill Fenner , Santosh Kumar , Stig Venaas | ||
| Last updated | 2025-11-09 (Latest revision 2025-05-08) | ||
| Replaces | draft-fenner-pim-deterministic-ecmp | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
In densely interconnected networks, a PIM node may have many choices as to what upstream neighbor to send a JOIN message to, for a given source and group. This document describes a mechanism for multiple nodes (e.g., leaf nodes in a data center) to pick the same upstream node (e.g., spine node) to avoid redundant traffic flows.
Authors
Bill Fenner
Santosh Kumar
Stig Venaas
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)