Affiliation:
1. MERIT Computer Network, Minneapolis, MN
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Active Modular Environment for Robot Navigation;2021 IEEE International Conference on Robotics and Automation (ICRA);2021-05-30
2. Exploration of Time-Varying Connected Graphs with Silent Agents;Structural Information and Communication Complexity;2020
3. Efficient Distributed Query Processing;IEEE Transactions on Automation Science and Engineering;2016-07
4. Deadlock-free connection-based adaptive routing with dynamic virtual circuits;Journal of Parallel and Distributed Computing;2007-01
5. RANDOMIZED MOBILE AGENT BASED ROUTING IN WIRELESS NETWORKS;International Journal of Foundations of Computer Science;2001-06