Thumbnail
Access Restriction
Subscribed

Author Tajibnapis, William D.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Correctness proofs ♦ Network topology ♦ Routing problem in networks ♦ Distributed operating system ♦ Distributed control ♦ Traffic control ♦ Computer networks ♦ Store and forward message switching ♦ Distributed computer network ♦ Store and forward packet switching
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.
Description Affiliation: MERIT Computer Network, Minneapolis, MN (Tajibnapis, William D.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 7
Page Count 9
Starting Page 477
Ending Page 485


Open content in new tab

   Open content in new tab
Source: ACM Digital Library