Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Protocol verification made simple: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Elements of network protocol design
Elements of network protocol design
Reverse path forwarding of broadcast packets
Communications of the ACM
Stepwise Assertional Design of Distance-Vector Routing Algorithms
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
The Request Reply Family of Group Routing Protocols
IEEE Transactions on Computers
A routing protocol for dynamic and large computer networks with clustering topology
Computer Communications
| Hi-index | 0.25 |
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of processes is constructed in the network, ensuring that each group member is included in the tree. To build this tree, the group routing protocol relies upon the local unicast routing tables of each process. Thus, group routing is accomplished by composing two protocols: an underlying unicast routing protocol, whose detailed behavior is unknown but its basic properties are given, and a protocol that builds a group tree based upon the unicast routing tables. The group routing protocol is developed in three steps. First, a simple protocol is obtained, and is proven correct. Then, the protocol is refined twice. Each refined protocol improves upon its predecessor by satisfying all of the predecessor's properties plus some additional stronger properties. The final protocol has the property of adapting the group tree to changes in the unicast routing tables without compromising the integrity of the group tree, even in the presence of unicast routing loops.