|
 ABSTRACT
In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a topology information scheme is that it may not involve a central controller. The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network. It is based on Baran's “Hot Potato Heuristic Routing Doctrine.” A correctness proof of this Topology Information Protocol is also presented.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Aupperle, E.M. The MERIT network re-examined. Digest of Papers, COMPCON 73, Feb. 1973, pp. 25-29.
|
| |
2
|
Baran, P. On distributed communication networks. IEEE Trans. Comm. Syst. CS-12 (March 1964), 109.
|
| |
3
|
Cocanower, A.B., Fischer, W., Gerstenberger, W.S., and Read, B.S. The communications computer operating system-the initial design. No. PB203 552, Nat. Tech. Inform. Service, Springfield, Va., Oct. 1970, p. 94.
|
| |
4
|
Frank, H., Kahn, R.E., and Kleinrock, L. Computer communication network design-experience with theory and practice. Proc. AFIPS 1972 SJCC, Vol. 40, AFIPS Press, Montvale, N.J.; pp. 255-270 (Contains an extensive bibliography on computer networks).
|
| |
5
|
Heart, F.W., Kahn, R.E., Ornstein, S.M., Crowther, W.R., and Walden, D.C. The interface message processor for the ARPA computer networks. Proc. AFIPS 1970 SJCC, Vol. 36, AFIPS Press, Montvale, N.J., pp. 551-567.
|
| |
6
|
Herzog, B. Computer networks. Proc. Int. Comptg. Symp., Venice, Italy, April 1972, pp. 12-14.
|
| |
7
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf