Skip to main content

Prefix Unreachable Announcement
draft-wang-lsr-prefix-unreachable-annoucement-08

Document Type Expired Internet-Draft (individual)
Authors Aijun Wang , Gyan Mishra , Zhibo Hu, Yaqun Xiao
Last updated 2022-04-18 (Latest revision 2021-10-15)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text htmlized pdfized bibtex
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 can be found at:
https://www.ietf.org/archive/id/draft-wang-lsr-prefix-unreachable-annoucement-08.txt

Abstract

This document describes a mechanism to solve an existing issue with Longest Prefix Match (LPM), that exists where an operator domain is divided into multiple areas or levels where summarization is utilized. This draft addresses a fail-over issue related to a multi areas or levels domain, where a link or node down event occurs resulting in an LPM component prefix being omitted from the FIB resulting in black hole sink of routing and connectivity loss. This draft introduces a new control plane convergence signaling mechanism using a negative prefix called Prefix Unreachable Announcement Mechanism(PUAM), utilized to detect a link or node down event and signal the RIB that the event has occurred to force immediate control plane convergence.

Authors

Aijun Wang
Gyan Mishra
Zhibo Hu
Yaqun Xiao

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