An Evaluation of Local Path ID Swapping in Computer Networks
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.
G. Markowsky and F. H. Moss, "An Evaluation of Local Path ID Swapping in Computer Networks," IEEE Transactions on Communications, vol. 29, no. 3, pp. 329-336, Institute of Electrical and Electronics Engineers (IEEE), Mar 1981.
The definitive version is available at http://dx.doi.org/10.1109/TCOM.1981.1094988
Keywords and Phrases
International Standard Serial Number (ISSN)
Article - Journal
© 1981 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.