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
Mechanisms that enforce bounds on packet lifetimes
ACM Transactions on Computer Systems (TOCS)
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
Group routing without group routing tables: an exercise in protocol design
Computer Communications
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilization of loop-free redundant routing
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 14.98 |
We present a family of group routing protocols for a network of processes. The task of these protocols 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. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of request/reply messages with their parent. To choose the processes that constitute the tree, we take advantage of the existing unicast routing protocol in the network. In addition, our family of group routing protocols distinguishes itself from other group routing protocols in three ways. First, the protocols are proven correct. Second, the protocols preserve the integrity of the group tree as it adapts to changes in the unicast routing tables, even in the presence of temporary unicast routing loops. Third, data messages are propagated along the entire group tree, even while the tree adapts to changes in the unicast routing tables.