Skip to main content

List Pagination for YANG-driven Protocols

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
Authors Kent Watsen , Qin Wu , Olof Hagsand , Hongwei Li , Per Andersson
Last updated 2023-09-12 (Latest revision 2023-03-11)
Replaces draft-wwlh-netconf-list-pagination
RFC stream Internet Engineering Task Force (IETF)
Additional resources Mailing list discussion
Stream WG state WG Document
Document shepherd (None)
IESG IESG state Expired
Consensus boilerplate Unknown
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:


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.


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.)