About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
An Evaluation of Local Path ID Swapping in Computer Networks
Abstract
This paper analyzes a method for identifying end-to-end connections in computer networks which is designed to provide reductions in the sizes of the packet headers and routing tables stored in the nodes. The method, known as Local Path ID Swapping, uses a shortened connection identifier, called the LPID, in the message headers and routing tables. In general, the LPID field is swapped in the message header from node to node along the path of the route. Some analytical results are presented for evaluating the important tradeoffs involved in LPID swapping. Most notable is the tradeoff between the size of the LPID field and the number of connections which can be defined in the network. © 1981 IEEE