This article describes the dynamic prefix tries, a novel data structure with algorithms for insertion, deletion, and retrieval to build and maintain a dynamic database of binary keys of arbitrary length. These tries extend the concepts of compact digital (Patricia) tries to support the storage of prefixes and to guarantee retrieval times at most linear in the length of the input key irrespective of the trie size, even when searching for longest-matching prefixes. The new design permits very efficient, simple and nonrecursive implementations of small code size and minimal storage requirements. Insert and delete operations have strictly local effects, and their particular sequence is irrelevant for the structure of the resulting trie, thus maintaining at all times the desired storage and computational efficiency. The algorithms have bees successfully employed in experimental communication systems and products for a variety of networking functions such as address resolution, maintenance and verification of access control lists, and high-performance routing tables in operating system kernels.

The multiprotocol transport networking (MPTN) architecture proposed in this paper is a general solution to providing interconnectivity for applications. The MPTN architecture provides a protocol-independent system interface that includes most functions provided by existing transport protocols. As a result, the MPTN architecture decouples higher-layer protocols, application programming interfaces, and applications from protocols at the transport layer and below. Using the MPTN architecture, current and new applications can function unmodified over any transport supported under the MPTN interface. In addition, MPTN transport-layer gateways provide an end-to-end communication facility across a number of networks running different protocols. Therefore, a collection of networks running different protocols can serve as a single logical network.>

A hierarchical decomposition of network nodes which permits the networkwide topology database and algorithms to be independent of node internals, yet allows (implicit) access to special intranodal features when required is described. A complementary procedure for the establishment of bandwidth-reserved connections is outlined that makes efficient use of this node structure to support network-level optimization through use of node-level features. Based on a significantly increased concurrency of path computation and bandwidth reservation, the execution time of the setup procedure is independent of the network's complexity (such as number of nodes and links) and is essentially bounded from above by the round-trip delay only.>

A comparative survey is presented of techniques used at the transport layer in eight representative protocols, most of which were designed to improve the protocol processing rate. The protocols are the relevant portions of the APPN, Datakit, Delta-t, NETBLT, OSI/TP4, TCP, VMTP, and XTP architectures. The protocols are described, and the functions under consideration are defined. No distinction is made as to whether these functions are carried out in a LAN, MAN, or WAN environment. The objective is to provide reliable, end-to-end transmission of data. The mechanisms required to support connection management, acknowledgements, flow control, and error handling are examined. Suitable techniques for designing light-weight transport protocols are identified. A discussion is presented as to which technique seems the most promising.>