@techreport{kwvanhove-sidrops-rpki-tree-hints-01,
    number =    {draft-kwvanhove-sidrops-rpki-tree-hints-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-kwvanhove-sidrops-rpki-tree-hints/01/},
    author =    {Koen van Hove},
    title =     {{Tree Hints for the Resource Public Key Infrastructure (RPKI)}},
    pagetotal = 9,
    year =      2021,
    month =     dec,
    day =       13,
    abstract =  {In the Resource Public Key Infrastructure (RPKI), holders of IP address space can become a Certification Authority (CA), optionally hosting their repository. They can also delegate (part of) their resources to subordinate CAs, who in turn may do the same. This CA hierarchy forms a tree structure. Relying Party (RP) software walks this tree and determines the current valid objects. An underlying assumption is that this tree is a reasonable size, and that the information can be processed within reasonable time. This assumption is not guaranteed to hold. This document describes two new extensions, "maxDescendants" and "maxVrps", that add constraints for use in RP processing that ensure this assumption holds.},
}