Skip to main content

List Pagination for YANG-driven Protocols
draft-wwlh-netconf-list-pagination-00

Document Type Expired Internet-Draft (individual)
Authors Kent Watsen , Qin Wu , Olof Hagsand , Hongwei Li , Per Andersson
Last updated 2022-04-28 (Latest revision 2021-10-25)
Stream (None)
Formats
Expired & archived
plain text html xml 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-wwlh-netconf-list-pagination-00.txt

Abstract

In some circumstances, instances of YANG modeled "list" and "leaf- list" nodes may contain numerous entries. Retrieval of all the entries can lead to inefficiencies in the server, the client, and the network in between. This document defines a model for list pagination that can be implemented by YANG-driven management protocols such as NETCONF and RESTCONF. The model supports paging over optionally filtered and/or sorted entries. The solution additionally enables servers to constrain query expressions on some "config false" lists or leaf- lists.

Authors

Kent Watsen
Qin Wu
Olof Hagsand
Hongwei Li
Per Andersson

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