Maximum Number of Paths Reached Notification for BGP

Status of This Memo

This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶

Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶

Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶

This Internet-Draft will expire on 22 January 2027.¶

Copyright Notice

Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶

This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶

Table of Contents

2. Requirements Language

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶

3. Maximum Number of Paths Reached Subcode

IANA has allocated the value TBD (see Section 6) for the "Maximum Number of Paths Reached" Cease NOTIFICATION message subcode. When a BGP speaker terminates a peering because the number of paths [RFC7911] received from the neighbor for one or more <AFI, SAFI> exceeds a locally configured upper bound, the BGP speaker SHOULD send a NOTIFICATION message with the error code "Cease" and the error subcode "Maximum Number of Paths Reached".¶

Following the format defined in [RFC4486], Section 4, the message MAY optionally include the Address Family information [RFC4760] and the upper bound in the "Data" field, as shown in Figure 1.¶

    +------------------------------------------------+
    | Address Family Identifier (2 octets)           |
    +------------------------------------------------+
    | Subsequent Address Family Identifier (1 octet) |
    +------------------------------------------------+
    | Paths upper bound (4 octets)                   |
    +------------------------------------------------+

The "Paths upper bound" field indicates the locally configured maximum number of paths, for the indicated <AFI, SAFI>, that triggered the termination. If a BGP speaker terminates a peering because the bound was exceeded for more than one <AFI, SAFI>, it MAY include the Data field for any one of them.¶

4. Operational Considerations

This subcode is meaningful only when BGP ADD-PATH [RFC7911] has been negotiated for at least one <AFI, SAFI> with the peer. A speaker that bounds only the number of prefixes continues to use the "Maximum Number of Prefixes Reached" subcode [RFC4486].¶

A receiver may bound the number of received paths in two distinct ways. An aggregate bound limits the total number of paths a receiver will accept from the peer for an <AFI, SAFI>, primarily to protect against resource exhaustion; for example, an implementation might provide a configuration knob that counts the additional paths toward a combined prefix-and-path limit, such as "neighbor X maximum-prefix 10 include-additional-paths". A per-prefix bound limits the number of paths accepted for a single prefix. The PATHS-LIMIT Capability [I-D.abraitis-idr-addpath-paths-limit], when supported by both peers, lets a receiver negotiate the per-prefix bound with the sender, so that the sender can avoid exceeding it in the first place. This subcode is the complementary enforcement signal for either kind of bound: it indicates termination when the number of received paths exceeds the receiver's locally configured upper bound, regardless of whether the PATHS-LIMIT Capability was negotiated, for example because the sender ignored it, or sent more paths than indicated.¶

Terminating the peering is the most disruptive response, because it discards all paths for all prefixes even when only a small number of prefixes exceed a per-prefix bound. Where feasible, a receiver SHOULD prefer graceful handling that preserves the session, as recommended in [I-D.ietf-idr-add-paths-guidelines], over termination. For a per-prefix bound in particular, such handling includes treating the affected prefixes as withdrawn, or accepting only the permitted number of paths for those prefixes and discarding the excess, while logging the event for the operator. A receiver SHOULD send this subcode only when its local policy does terminate the peering, for example when an aggregate bound is exceeded and preserving the session would risk resource exhaustion.¶

When BGP Graceful Restart with NOTIFICATION support has been negotiated, a speaker that sends or receives this subcode follows the procedures of [RFC8538]. A speaker whose local policy requires the immediate discard of the routes received from the peer uses the Hard Reset mechanism of [RFC8538], carrying the "Cease" code and "Maximum Number of Paths Reached" subcode in the Data field of the Hard Reset message.¶

5. Security Considerations

This document defines a subcode for the BGP Cease NOTIFICATION message that provides information to aid network operators in correlating network events and diagnosing BGP peering issues. This subcode is purely informational and has no impact on the BGP Finite State Machine beyond that already documented by [RFC4271], Sections 6.6 and 6.7.¶

6. IANA Considerations

IANA is requested to assign a value from the "BGP Cease NOTIFICATION message subcodes" registry, with the name "Maximum Number of Paths Reached" and a reference to this document.¶

Acknowledgements

TBD¶

Authors' Addresses