Shortcut Routing: Discovery and Routing over Large Public Data Networks
draft-ietf-iplpdn-shortcutrouting-02

Document Type Expired Internet-Draft (iplpdn WG)
Author Paul Francis 
Last updated 1993-01-28 (latest revision 1992-12-09)
Stream Internet Engineering Task Force (IETF)
Formats
Expired & archived
pdf htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
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-ietf-iplpdn-shortcutrouting-02.txt

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

Authors

Paul Francis (francis@works.ingrid.org)

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