@techreport{ietf-iplpdn-shortcutrouting-02,
    number =    {draft-ietf-iplpdn-shortcutrouting-02},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-iplpdn-shortcutrouting/02/},
    author =    {Paul Francis},
    title =     {{Shortcut Routing: Discovery and Routing over Large Public Data Networks}},
    pagetotal = 35,
    year =      1993,
    month =     jan,
    day =       28,
    abstract =  {Various RFCs and Internet Drafts specify how to run IP or CLNP over various public data network services. These documents specify the encapsulation to be used, and sometimes specify protocol techniques to aid in discovery and routing functions. None of the specifications, however, solve the problem of discovery and routing in the full, especially with respect to scaling. This document extends these specifications by describing a general and scalable technique, called shortcut routing, for discovery and routing of any connectionless internet protocol over any switched data network (connectionless or connection-oriented).},
}