Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
Lazy replication: exploiting the semantics of distributed services
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Exploiting locality in maintaining potential causality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Concerning the size of logical clocks in distributed systems
Information Processing Letters
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Horus: a flexible group communication system
Communications of the ACM
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Graph Algorithms
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Totally ordered multicast in large-scale systems
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Newtop: a fault-tolerant group communication protocol
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Causal separators for large-scale multicast communication
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
When designing communication protocols there is always a tradeoff between generality and performance. This chapter reports one approach to achieve right balance between these two aspects, using a network model that can be applied to the majority of existing large-scale networks based on reliable high-speed local-area networks interconnected by slower long-haul connections. The approach consists in making visible relevant topological aspects of the uderlying network infrastructure to the protocol designer, and is illustrated by several algorithms that use topology information to achieve improved performance.