Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast gossiping for the hypercube
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Fast gossiping with short unreliable messages
Proceedings of the international workshop on Broadcasting and gossiping 1990
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Masking the overhead of protocol layering
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Computer networks (3rd ed.)
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing permutations and 2---1 routing requests in the hypercube
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Optimal Algorithms for Disemination of Information in Generalized Communication Modes
PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Hierarchical Message Stability Tracking Protocols
Hierarchical Message Stability Tracking Protocols
The Ensemble System
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
RELACS: A Communications Infrastructure for Constructing Reliable Applications in Large-Scale Distributed Systems
Scalable message stability detection protocols
Scalable message stability detection protocols
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
A virtual circle-based clustering algorithm with mobility prediction in large-scale MANETs
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
This paper proposes to use a logical hypercube structure for detecting message stability in distributed systems. In particular, a stability detection protocol that uses such a superimposed logical structure is presented, and its scalability is being compared with other known stability detection protocols. The main benefits of the logical hypercube approach are scalability, fault-tolerance, and refraining from overloading a single node or link in the system. These benefits become evident both by an analytical comparison and by simulations. Another important feature of the logical hypercube approach is that the performance of the protocol is in general not sensitive to the topology of the underlying physical network.