Routing Techniques Used in Computer Communication Networks

TLDR

The paper surveys routing in networks such as TYMNET, ARPANET, and TRANSPAC, and in architectures like IBM SNA and DEC DNA, noting that their routing algorithms generally belong to the shortest‑path class. The study provides an overview of routing procedures employed in various operating networks and two commercial network architectures. The authors describe two shortest‑path algorithms—one for centralized computation and one for distributed computation—after outlining routing procedures in general. The modified algorithms form the foundation of the routing algorithms actually deployed in the examined networks.

Abstract

An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures. The networks include TYMNET, ARPANET, and TRANSPAC. The network architectures discussed are the IBM SNA and the DEC DNA. The routing algorithms all tend to fall in the shortest path class. In the introductory sections, routing procedures in general are discussed, with specialization to shortest path algorithms. Two shortest path algorithms, one appropriate for centralized computation, the other for distributed computation, are described. These algorithms, in somewhat modified form, provide the basis for the algorithms actually used in the networks discussed.