Considerations for On-Demand Retrieval of Multiple RPKI Object Types
draft-shi-sidrops-rpki-on-demand-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Jiayi Shi , Libin Liu , Lancheng Qin , Dan Li | ||
| Last updated | 2026-09-02 (Latest revision 2026-03-01) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| 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 is available in these formats:
Abstract
Currently, Relying Parties (RPs) retrieve the complete set of RPKI objects from repositories. This all-or-nothing model increases network traffic, synchronization latency, and computational overhead. This document examines these limitations and outlines directions for enabling more selective and efficient RPKI data access.
Authors
Jiayi Shi
Libin Liu
Lancheng Qin
Dan Li
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)