Network Working Group S. Dikshit Internet-Draft Hewlett Packard Enterprise Intended status: Standards Track 20 November 2026 Expires: 24 May 2027 Cross-Publisher Causal Ordering for YANG-Push Datastore Telemetry draft-dikshit-netconf-yang-push-causal-ordering-02 Abstract In YANG-Push version 2, each publisher numbers its own notifications, and the numbers of two publishers are not comparable. When a single subscription is served by several publishers, for example on a multi- line-card router or a disaggregated routing stack, a collector cannot order updates across those publishers from the sequence numbers alone. This document defines an opt-in, coordination-free mechanism that carries a Comparability Scope, a coarse Causal-Epoch, and a per- publisher Local-Sequence-Number in the notification envelope. Publishers stay lock-free on the export fast path, and a collector reconstructs cross-publisher order within a bounded reordering window. A companion YANG module adds the subscription controls, the envelope metadata, and the capability discovery. The mechanism does not require synchronized clocks across publishers. 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 24 May 2027. Copyright Notice Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved. Dikshit Expires 24 May 2027 [Page 1] Internet-Draft YANG-Push Causal Ordering November 2026 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 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1. Requirements Language . . . . . . . . . . . . . . . . . . 3 1.2. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3 2. Problem Statement and Comparability Scope . . . . . . . . . . 3 3. High-Level Architecture . . . . . . . . . . . . . . . . . . . 4 4. Notification Metadata Model . . . . . . . . . . . . . . . . . 5 5. YANG Module . . . . . . . . . . . . . . . . . . . . . . . . . 6 6. Operational and Performance Considerations . . . . . . . . . 11 7. Security Considerations . . . . . . . . . . . . . . . . . . . 11 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 12 9.1. Normative References . . . . . . . . . . . . . . . . . . 12 9.2. Informative References . . . . . . . . . . . . . . . . . 13 Appendix A. Alternative Approaches Considered . . . . . . . . . 14 Appendix B. Changes Between Revisions . . . . . . . . . . . . . 15 Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 16 1. Introduction YANG-Push version 2 [I-D.ietf-netconf-yang-push-2] gives every notification a sequence number that is counted separately for each publisher within a subscription. Section 13 of that document states that sequence numbers from different publishers do not establish an ordering between their notifications, and it allows data to move from one publisher to another at a collection boundary. In a distributed network element, a single subscription can be served at the same time by several publishers, for example one per line card or per routing process. When their notifications arrive interleaved at a collector, the per-publisher sequence numbers alone cannot place the updates in one order across publishers. This document defines an opt-in, coordination-free mechanism for cross-publisher ordering. Publishers stay lock-free on the export fast path and carry three small metadata elements in the notification envelope: a Comparability Scope that bounds which notifications are compared, a coarse Causal-Epoch that advances only when causal state Dikshit Expires 24 May 2027 [Page 2] Internet-Draft YANG-Push Causal Ordering November 2026 is handed off across publishers, and a per-publisher Local-Sequence- Number. A collector reconstructs order within a Comparability Scope using a bounded reordering window. The mechanism does not require synchronized clocks across publishers. A companion YANG module (Section 5) adds the subscription opt-in, the envelope metadata, and capability discovery. 1.1. 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. 1.2. Terminology * Comparability Scope: a set of publishers and notifications whose updates are compared for cross-publisher ordering, identified by a Comparability Scope identifier. The scope aligns with [I-D.dikshit-nmop-telemetry-identifier-scoping] and [I-D.dikshit-netmod-comparability-scope-extension]. * Causal-Epoch: a coarse logical counter shared across publishers within a Comparability Scope. It advances only when causal state is handed off across a publisher boundary. * Local-Sequence-Number (Local-Seq): the strictly monotonic per- publisher counter used to detect loss and duplicates within a given publisher and Causal-Epoch. * Publisher: as defined in [I-D.ietf-netconf-yang-push-2]. * Collector: the receiver that consumes notifications and reconstructs order. 2. Problem Statement and Comparability Scope In distributed network elements, such as multi-line-card routers, disaggregated routing stacks, or replicated telemetry exporters, a single YANG-Push subscription may be served concurrently by multiple independent publishers. Existing notification sequence numbers are strictly local to each individual publisher process or transport session. When notifications from multiple publishers arrive interleaved at a collector, per-publisher sequence numbers cannot: Dikshit Expires 24 May 2027 [Page 3] Internet-Draft YANG-Push Causal Ordering November 2026 1. Establish causal or cross-publisher ordering across datastore updates. 2. Distinguish out-of-order delivery across publishers from genuine packet loss within a single publisher stream. To avoid imposing cross-publisher ordering overhead on unrelated telemetry, causal ordering is bounded to an explicit Comparability Scope, aligned with [I-D.dikshit-nmop-telemetry-identifier-scoping] and [I-D.dikshit-netmod-comparability-scope-extension]. Only notifications sharing the same Comparability Scope identifier are evaluated for cross-publisher causal ordering. 3. High-Level Architecture Enforcing a single globally incremented sequence number across distributed publishers would require synchronous inter-process locking or strict wall-clock synchronization on the telemetry export fast path, degrading throughput under high churn. Instead, this architecture decouples per-publisher loss detection from cross-publisher causal ordering by keeping publishers coordination-free on the fast path and offloading bounded reordering to the collector: Lock-free fast path (publishers) Collector engine ================================ ================ +---------------------------------+ | Publisher P1 (e.g. LC1 / RIBd) | | emits {Scope=S1,Epoch=12,Seq=1} |---+ +---------------------------------+ | +------------------------+ +-->| 1. group by Scope (S1) | causal state hand-off | | 2. order by (Epoch, | advances Epoch 12 -> 13 | | Local-Seq) | | | | 3. bounded watermark | v | | reordering window | +---------------------------------+ | +------------------------+ | Publisher P2 (e.g. LC2 / BGPd) |---+ | emits {Scope=S1,Epoch=13,Seq=1} | +---------------------------------+ Key design properties: * Zero per-notification cross-publisher locks: each publisher maintains its own local monotonic Local-Seq counter in O(1) without inter-process communication or atomic contention across line cards or processes. Dikshit Expires 24 May 2027 [Page 4] Internet-Draft YANG-Push Causal Ordering November 2026 * Coarse Causal-Epoch propagation: publishers share a Causal-Epoch counter that advances only when a causal state dependency crosses publisher boundaries, for example a RIB state installation that triggers a BGP update. The epoch piggybacks on existing control- plane state hand-offs rather than introducing per-packet coordination. * Two-tier ordering at the collector: the Causal-Epoch establishes a partial, causal ordering across distinct publishers within the same Comparability Scope, while the Local-Seq preserves exact per- publisher gap and duplicate detection within any given (Publisher, Causal-Epoch) pair. 4. Notification Metadata Model When cross-publisher causal ordering is negotiated or configured for a subscription, each exported YANG-Push notification carries three metadata elements within its notification envelope, extending [I-D.ietf-netconf-notif-envelope]: +------------------------------------------------------------+ | YANG-Push notification envelope (ietf-yp-notification) | +------------------------------------------------------------+ | comparability-scope-id (multi-publisher group identifier) | | causal-epoch (uint64; cross-publisher fence) | | local-sequence-number (uint64; per-publisher monotonic) | +------------------------------------------------------------+ | notification payload (datastore-changes / push-update) | +------------------------------------------------------------+ Subscription-level opt-in: support for causal ordering MUST be disabled by default and enabled explicitly per subscription via a boolean leaf (enable-causal-ordering), ensuring zero wire or CPU overhead for single-publisher subscriptions. The following example shows a push-change-update notification [RFC8641] carried in the envelope with the causal ordering metadata, using the JSON encoding of [RFC7951]: Dikshit Expires 24 May 2027 [Page 5] Internet-Draft YANG-Push Causal Ordering November 2026 { "ietf-yp-notification:envelope": { "event-time": "2026-11-20T09:30:00.12Z", "ietf-yp-notification:hostname": "pe-router-01", "ietf-yp-notification:sequence-number": 405, "ietf-yang-push-causal-ordering:causal-ordering": { "comparability-scope-id": "rib-vrf-red", "causal-epoch": "12", "local-sequence-number": "405" }, "contents": { "ietf-yang-push:push-change-update": { "id": 1011 } } } } 5. YANG Module This document defines the YANG 1.1 [RFC7950] module ietf-yang-push- causal-ordering. It imports common types from [RFC6991]. It augments ietf-subscribed-notifications [RFC8639] with the subscription opt-in controls, augments the YANG-Push notification envelope [I-D.ietf-netconf-notif-envelope] with the causal ordering metadata using the structure extension of [RFC8791], and augments the system and notification capabilities of [RFC9196] so that a client can discover support. file "ietf-yang-push-causal-ordering@2026-11-20.yang" module ietf-yang-push-causal-ordering { yang-version 1.1; namespace "urn:ietf:params:xml:ns:yang:ietf-yang-push-causal-ordering"; prefix yp-co; import ietf-yang-types { prefix yang; reference "RFC 6991: Common YANG Data Types"; } import ietf-subscribed-notifications { prefix sn; reference "RFC 8639: Subscription to YANG Notifications"; } Dikshit Expires 24 May 2027 [Page 6] Internet-Draft YANG-Push Causal Ordering November 2026 import ietf-yang-structure-ext { prefix sx; reference "RFC 8791: YANG Data Structure Extensions"; } import ietf-system-capabilities { prefix sysc; reference "RFC 9196: YANG Modules Describing Capabilities for Systems and Behavioral Change Management"; } import ietf-notification-capabilities { prefix notc; reference "RFC 9196: YANG Modules Describing Capabilities for Systems and Behavioral Change Management"; } import ietf-yp-notification { prefix ypn; reference "I-D.ietf-netconf-notif-envelope: Extensible YANG Model for YANG-Push Notifications"; } organization "IETF NETCONF (Network Configuration) Working Group"; contact "WG Web: WG List: Author: Saumya Dikshit "; description "This module defines YANG extensions for opt-in cross-publisher causal ordering in YANG-Push datastore telemetry without requiring synchronous locking across distributed publishers. Copyright (c) 2026 IETF Trust and the persons identified as authors of the code. All rights reserved. Redistribution and use in source and binary forms, with or without modification, is permitted pursuant to, and subject to the license terms contained in, the Revised BSD License set forth in Section 4.c of the IETF Trust's Legal Provisions Relating to IETF Documents Dikshit Expires 24 May 2027 [Page 7] Internet-Draft YANG-Push Causal Ordering November 2026 (https://trustee.ietf.org/license-info). This version of this YANG module is part of RFC XXXX (https://www.rfc-editor.org/info/rfcXXXX); see the RFC itself for full legal notices."; revision 2026-11-20 { description "Initial revision adding opt-in subscription causal ordering configuration and lock-free notification envelope metadata."; reference "draft-dikshit-netconf-yang-push-causal-ordering-02"; } feature causal-ordering { description "Indicates that the publisher supports opt-in cross-publisher causal ordering metadata on YANG-Push notifications."; } grouping causal-ordering-subscription-config { description "Subscription-level opt-in parameters for cross-publisher causal ordering."; leaf enable-causal-ordering { if-feature "causal-ordering"; type boolean; default "false"; description "When set to 'true', publishers serving this subscription include cross-publisher causal ordering metadata in emitted notification envelopes. Disabled by default to incur zero overhead on single-publisher subscriptions."; } leaf comparability-scope-id { when "../enable-causal-ordering = 'true'"; if-feature "causal-ordering"; type string { length "1..64"; } description "Identifier defining the multi-publisher comparability group. Notifications sharing the same scope identifier can be causally ordered by a collector."; } leaf max-skew-window { when "../enable-causal-ordering = 'true'"; if-feature "causal-ordering"; Dikshit Expires 24 May 2027 [Page 8] Internet-Draft YANG-Push Causal Ordering November 2026 type uint32; units "milliseconds"; default "50"; description "Recommended bounded reordering window hint for collectors processing interleaved streams within this comparability scope."; } } grouping causal-ordering-envelope-metadata { description "Lightweight, coordination-free metadata carried in the YANG-Push notification envelope when causal ordering is enabled."; leaf comparability-scope-id { type string { length "1..64"; } mandatory true; description "The comparability scope identifier shared by all publishers participating in the same causal ordering domain."; } leaf causal-epoch { type yang:counter64; mandatory true; description "Coarse logical epoch shared across publishers within the comparability scope. Increments only upon causal state hand-off across publishers, avoiding per-message locks."; } leaf local-sequence-number { type yang:counter64; mandatory true; description "Strictly monotonic per-publisher sequence counter used to detect packet loss and duplicates within a given (publisher, causal-epoch) tuple."; } } augment "/sn:subscriptions/sn:subscription" { description "Adds opt-in cross-publisher causal ordering controls to configured and dynamic subscriptions."; uses causal-ordering-subscription-config; Dikshit Expires 24 May 2027 [Page 9] Internet-Draft YANG-Push Causal Ordering November 2026 } augment "/sn:establish-subscription/sn:input" { description "Allows dynamic subscription RPC requests to opt into cross-publisher causal ordering."; uses causal-ordering-subscription-config; } augment "/sn:modify-subscription/sn:input" { description "Allows dynamic subscription modifications to update causal ordering parameters."; uses causal-ordering-subscription-config; } sx:augment-structure "/ypn:envelope" { description "Augments the extensible YANG-Push notification envelope with coordination-free cross-publisher causal ordering metadata when enabled for the subscription."; container causal-ordering { if-feature "causal-ordering"; presence "Present when cross-publisher causal ordering is enabled for the subscription."; description "Cross-publisher causal ordering metadata carried alongside event-time in the notification header."; uses causal-ordering-envelope-metadata; } } augment "/sysc:system-capabilities/notc:subscription-capabilities" + "/ypn:notification-metadata/ypn:metadata" { if-feature "causal-ordering"; description "Allows a client to discover whether the publisher supports cross-publisher causal ordering metadata in the notification envelope."; leaf causal-ordering-supported { type boolean; default "false"; description "Indicates whether the publisher supports emitting cross-publisher causal ordering metadata in the ietf-yp-notification envelope."; } Dikshit Expires 24 May 2027 [Page 10] Internet-Draft YANG-Push Causal Ordering November 2026 } } 6. Operational and Performance Considerations To ensure deterministic performance on resource-constrained network elements, deployments SHOULD apply the following operational controls: * Selective subscription enablement: operators SHOULD enable cross- publisher causal ordering only on subscriptions monitoring causally coupled distributed state, for example cross-line-card RIB and FIB or protocol state transitions, leaving high-volume interface counters in standard unordered mode. * Bounded collector reordering window: collectors MUST bound memory and reordering latency using a configurable watermark timer (max- skew-window). Notifications arriving past the watermark MAY be flagged as late rather than stalling downstream datastore ingestion indefinitely. * Clock independence: because ordering relies on logical causal epochs (Causal-Epoch) and local monotonic counters (Local-Seq), implementations do not require sub-millisecond PTP or NTP synchronization across publishers to guarantee causal consistency. 7. Security Considerations The YANG module defined in this document augments ietf-subscribed- notifications [RFC8639] with configurable subscription nodes (enable- causal-ordering, comparability-scope-id, and max-skew-window). These nodes are writable through configuration or through the dynamic subscription RPCs. The access control model of [RFC8341] SHOULD be used to restrict which clients can change them, because enabling or changing causal ordering affects the notifications a subscription emits. The causal ordering metadata is asserted by the publishers. A publisher that reports an incorrect Causal-Epoch or Local-Sequence- Number can cause a collector to order notifications incorrectly within a Comparability Scope. This relies on the same trust in the publisher as the existing per-publisher sequence number in [I-D.ietf-netconf-yang-push-2], and it does not affect notifications outside the Comparability Scope. Dikshit Expires 24 May 2027 [Page 11] Internet-Draft YANG-Push Causal Ordering November 2026 A collector MUST bound the reordering window (max-skew-window) so that interleaved or delayed notifications cannot cause unbounded buffering. Notifications arriving after the window MAY be flagged as late rather than held. The transport and authentication considerations of [I-D.ietf-netconf-yang-push-2] and [RFC8639] apply unchanged. 8. IANA Considerations This document requests IANA to register the following URI in the "ns" subregistry within the "IETF XML Registry" [RFC3688]: URI: urn:ietf:params:xml:ns:yang:ietf-yang-push-causal-ordering Registrant Contact: The IESG. XML: N/A; the requested URI is an XML namespace. This document requests IANA to register the following YANG module in the "YANG Module Names" registry [RFC6020]: Name: ietf-yang-push-causal-ordering Namespace: urn:ietf:params:xml:ns:yang:ietf-yang-push-causal-ordering Prefix: yp-co Reference: RFC XXXX 9. References 9.1. Normative References [I-D.ietf-netconf-notif-envelope] Feng, A. H., Francois, P., Graf, T., and B. Claise, "Extensible YANG Model for YANG-Push Notifications", Work in Progress, Internet-Draft, draft-ietf-netconf-notif- envelope-07, 31 October 2026, . [I-D.ietf-netconf-yang-push-2] Wilton, R., Keller, H., Claise, B., Aries, E., Cumming, J., and T. Graf, "YANG Datastore Telemetry (YANG Push version 2)", Work in Progress, Internet-Draft, draft-ietf- netconf-yang-push-2-01, 2 November 2026, . Dikshit Expires 24 May 2027 [Page 12] Internet-Draft YANG-Push Causal Ordering November 2026 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, . [RFC3688] Mealling, M., "The IETF XML Registry", BCP 81, RFC 3688, DOI 10.17487/RFC3688, January 2004, . [RFC6020] Bjorklund, M., Ed., "YANG - A Data Modeling Language for the Network Configuration Protocol (NETCONF)", RFC 6020, DOI 10.17487/RFC6020, October 2010, . [RFC6991] Schoenwaelder, J., Ed., "Common YANG Data Types", RFC 6991, DOI 10.17487/RFC6991, July 2013, . [RFC7950] Bjorklund, M., Ed., "The YANG 1.1 Data Modeling Language", RFC 7950, DOI 10.17487/RFC7950, August 2016, . [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, May 2017, . [RFC8341] Bierman, A. and M. Bjorklund, "Network Configuration Access Control Model", STD 91, RFC 8341, DOI 10.17487/RFC8341, March 2018, . [RFC8639] Voit, E., Clemm, A., Gonzalez Prieto, A., Nilsen-Nygaard, E., and A. Tripathy, "Subscription to YANG Notifications", RFC 8639, DOI 10.17487/RFC8639, September 2019, . [RFC8791] Bierman, A., Björklund, M., and K. Watsen, "YANG Data Structure Extensions", RFC 8791, DOI 10.17487/RFC8791, June 2020, . [RFC9196] Lengyel, B., Clemm, A., and B. Claise, "YANG Modules Describing Capabilities for Systems and Datastore Update Notifications", RFC 9196, DOI 10.17487/RFC9196, February 2022, . 9.2. Informative References Dikshit Expires 24 May 2027 [Page 13] Internet-Draft YANG-Push Causal Ordering November 2026 [Fidge1988] Fidge, C., "Timestamps in Message-Passing Systems That Preserve the Partial Ordering", 1988. [I-D.dikshit-netmod-comparability-scope-extension] Dikshit, D., "A YANG Extension for Declaring the Comparability Scope of Operational State", Work in Progress, Internet-Draft, draft-dikshit-netmod- comparability-scope-extension-04, 18 November 2026, . [I-D.dikshit-nmop-telemetry-identifier-scoping] Dikshit, D., "Scoping and Comparability Requirements for Exported Network Telemetry Identifiers", Work in Progress, Internet-Draft, draft-dikshit-nmop-telemetry-identifier- scoping-01, 4 September 2026, . [Kulkarni2014] Kulkarni, S., Demirbas, M., Madappa, D., Avva, B., and M. Leone, "Logical Physical Clocks and Consistent Snapshots in Globally Distributed Databases", 2014. [Mattern1989] Mattern, F., "Virtual Time and Global States of Distributed Systems", 1989. [RFC7951] Lhotka, L., "JSON Encoding of Data Modeled with YANG", RFC 7951, DOI 10.17487/RFC7951, August 2016, . [RFC8641] Clemm, A. and E. Voit, "Subscription to YANG Notifications for Datastore Updates", RFC 8641, DOI 10.17487/RFC8641, September 2019, . Appendix A. Alternative Approaches Considered Several primitives can order notifications across publishers. The table summarizes the trade-offs; n is the number of publishers in a Comparability Scope. Dikshit Expires 24 May 2027 [Page 14] Internet-Draft YANG-Push Causal Ordering November 2026 Approach State Cross-pub order Clock dep. ---------------------- ------- ---------------- ---------- Per-publisher counter O(1) none none (YANG-Push) Vector clock O(n) exact causality none Hybrid Logical Clock O(1) total, within loose sync clock offset Causal-Epoch + O(1)/ep partial, within none Local-Seq (this doc) a scope The per-publisher counter is kept for per-publisher loss detection. A vector clock [Fidge1988] [Mattern1989] gives exact causality, but its size grows with the number of publishers. A Hybrid Logical Clock [Kulkarni2014] is fixed in size but needs loosely synchronized clocks. The mechanism in this document keeps constant per-epoch state and needs no synchronized clocks, at the cost of ordering only within a Comparability Scope and only as fine as the Causal-Epoch hand-offs. Appendix B. Changes Between Revisions This section is to be removed before publishing as an RFC. From -01 to -02: * Replaced the Hybrid Logical Clock proposal with an opt-in, coordination-free model using a Comparability Scope, a Causal- Epoch, and a per-publisher Local-Sequence-Number. * Added a high-level architecture that keeps publishers lock-free on the fast path and moves bounded reordering to the collector (Section 3). * Added the notification envelope metadata model and a wire-encoded JSON example (Section 4). * Added the YANG module ietf-yang-push-causal-ordering, with the subscription opt-in, the envelope metadata, and the capability discovery of [RFC9196] (Section 5). * Added Operational and Performance Considerations (Section 6). * Changed the intended status to Standards Track and updated the Security and IANA Considerations. * Moved the comparison of ordering primitives to Appendix A. * Updated the author affiliation to Hewlett Packard Enterprise. Dikshit Expires 24 May 2027 [Page 15] Internet-Draft YANG-Push Causal Ordering November 2026 From -00 to -01: * Rebased on draft-ietf-netconf-yang-push-2, restated the problem around a hand-over example, and added the comparison of ordering primitives. Author's Address Saumya Dikshit Hewlett Packard Enterprise Mahadevpura Bangalore 560 048 Karnataka India Email: saumya.dikshit@hpe.com Dikshit Expires 24 May 2027 [Page 16]