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.
Keywords
Computer scienceShortest path problemLink-state routing protocolStatic routingPrivate Network-to-Network InterfaceRouting domainEqual-cost multi-path routingComputer networkRouting (electronic design automation)Routing tableDistributed computingPolicy-based routingComputationIBMMetricsK shortest path routingRouting protocolTheoretical computer scienceAlgorithm
Affiliated Institutions
Related Publications
Geographic routing for wireless networks
Distributed shortest-path routing protocols for wired networks either describe the entire topology of a network or provide a digest of the topology to every router. They continu...
A loop-free extended Bellman-Ford routing protocol without bouncing effect
Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-p...
GPSR
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to ma...
A unified approach to loop-free routing using distance vectors or link states
We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorit...
A routing protocol for packet radio networks
Abstract : The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on...
Publication Info
- Year
- 1980
- Type
- article
- Volume
- 28
- Issue
- 4
- Pages
- 539-552
- Citations
- 242
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
242
OpenAlex
Cite This
Moshe Schwartz,
Thomas Stern
(1980).
Routing Techniques Used in Computer Communication Networks.
IRE Transactions on Communications Systems
, 28
(4)
, 539-552.
https://doi.org/10.1109/tcom.1980.1094690
Identifiers
- DOI
- 10.1109/tcom.1980.1094690