Message-switching protocols in distributed computer networks. (volumes i and ii)
Message-switching protocols in distributed computer networks. (volumes i and ii)
Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Burroughs integrated adaptive routing system (BIASTM)
ACM SIGCOMM Computer Communication Review
The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Adaptive routing in Burroughs network architecture
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Minimal Order Loop-Free Routing Strategy
IEEE Transactions on Computers
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks
IEEE Transactions on Computers
Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
A fast topology maintenance algorithm for high-bandwidth networks
IEEE/ACM Transactions on Networking (TON)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
IEEE Transactions on Parallel and Distributed Systems
Verification of a distributed algorithm (abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing topology maintenance protocols for high-speed networks
IEEE/ACM Transactions on Networking (TON)
A dynamically-directed switch model for MOS logic simulation
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A path-oriented routing strategy for packet switching networks with end-to-end protocols
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
IEEE Transactions on Computers
The design of a topology information maintenance scheme for a distributed computer network
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Analysis of routing table update activity after resource failure in a distributed computer network
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
PL/I compilation: an application of a microprocessor network
ACM SIGPC Notes
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Deadlock-free connection-based adaptive routing with dynamic virtual circuits
Journal of Parallel and Distributed Computing
Distributed Reconfiguration Strategies for Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
An architecture for routing in the ISO connectionless internet
ACM SIGCOMM Computer Communication Review
SNA routing: past, present, and possible future
IBM Systems Journal
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 48.23 |
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.