Skip to main content

Stateless Best Effort Multicast Using MRH
draft-chen-pim-be-mrh-06

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Huaimo Chen , Donald E. Eastlake 3rd , Mike McBride , Yanhe Fan , Gyan Mishra , Yisong Liu , Aijun Wang , Xufeng Liu , Lei Liu
Last updated 2025-09-30 (Latest revision 2025-03-29)
RFC stream (None)
Intended RFC status (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

This document describes stateless best effort Multicast along the shortest paths to the egress nodes of a P2MP Path/Tree. The multicast data packet is encapsulated in an IPv6 Multicast Routing Header (MRH). The MRH contains the egress nodes represented by the indexes of the nodes and flexible bit strings for the nodes. The packet is delivered to each of the egress nodes along the shortest path. There is no state stored in the core of the network.

Authors

Huaimo Chen
Donald E. Eastlake 3rd
Mike McBride
Yanhe Fan
Gyan Mishra
Yisong Liu
Aijun Wang
Xufeng Liu
Lei Liu

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