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
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 for fault-tolerant distributed computing systems may have two models of communication such as, synchronous model and asynchronous model. In the large scale cluster computing systems having replicated services, the simultaneous group communication system is needed in order to support nearly simultaneous communication among multiple servers. In this paper, a distributed algorithm for simultaneous group communication in a close-group is proposed, where the group is formed using unidirectional virtual ring topology. The proposed algorithm achieves total ordering of messages among the nodes without saturating the network. The algorithm is implemented and the experimental results illustrate that the algorithm is scalable having comparatively lower message complexity per node. This paper describes the design and experimental evaluation of the algorithm.