The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Distributed core multicast (DCM): a multicast routing protocol for many groups with few receivers
ACM SIGCOMM Computer Communication Review
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Newtop: a fault-tolerant group communication protocol
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
A one-round algorithm for virtually synchronous group communication in wide area networks
A one-round algorithm for virtually synchronous group communication in wide area networks
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Lightweight application level multicast tunnelling using mTunnel
Computer Communications
Using dynamic configuration to manage a scalable multimedia distribution system
Computer Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The group communication algorithms are employed in fault-tolerant distributed computing systems, where the members of a group coordinate by using multicast messages. The messages need to be totally ordered at the nodes in order to maintain global consistency among the nodes. In the large scale distributed systems having replicated servers, the asynchronous as well as simultaneous group communication mechanism is required. This paper proposes a distributed algorithm intended to unidirectional virtual ring for asynchronous and simultaneous group communication in a close group maintaining totally ordered as well as atomic communication. The algorithm is easy to implement and computationally inexpensive having reduced overall message complexity. The algorithm is implemented in distributed system setup in large scale and the experimental results illustrate that algorithm is scalable, where the message complexity per node is comparatively lower. This paper describes the design, analysis and experimental validation of the algorithm.