# Using structural characteristics for autonomous operation

@article{Baquero1999UsingSC,
title={Using structural characteristics for autonomous operation},
author={Carlos Baquero and Francisco Moura},
journal={ACM SIGOPS Oper. Syst. Rev.},
year={1999},
volume={33},
pages={90-96}
}
• Published 1 October 1999
• Computer Science
• ACM SIGOPS Oper. Syst. Rev.
The majority of current mobile computing systems operate either in conjunction with a central network by some form of weak connectivity or tend to operate in total isolation and perform sporadic synchronization with a backup or a central network. These configurations miss an additional and very useful pattern of operation --- mobile to mobile interaction. Recent mobile devices have the capacity for direct communication among them, but this option is essentially neglected by the application…
26 Citations

## Figures from this paper

### Invariant preservation in geo-replicated data stores

A new consistency model is proposed that breaks apart from traditional knowledge that applications consistency is dependent on coordinating the execution of operations across replicas, and it is shown that it is possible to execute most operations with low latency and in an highly available way, while preserving application’s correctness.

### Pure Operation-Based Replicated Data Types

• Computer Science
ArXiv
• 2017
This work introduces pure op-based CRDTs, that can only send operations to other replicas, drawing a clear distinction from state-based ones.

### Delta state replicated data types

• Computer Science
J. Parallel Distributed Comput.
• 2018

### A comprehensive study of Convergent and Commutative Replicated Data Types

• Computer Science
• 2011
This paper formalises asynchronous object replication, either state based or operation based, and provides a sufficient condition appropriate for each case, and describes several useful CRDTs, including container data types supporting bothadd and remove operations with clean semantics, and more complex types such as graphs, montonic DAGs, and sequences.

### Proving the Safety of Highly-Available Distributed Objects

• Computer Science
ESOP
• 2020
This work proposes a proof methodology for establishing that a given object maintains a given invariant, taking into account any concurrency control, for the subclass of state-based distributed systems.

### APPLICATION AWARE FOR BYZANTINE FAULT TOLERANCE

This dissertation research investigated the use of Conflict-free Replicated Data Types (CRDTs) to construct highly concurrent Byzantine fault tolerance systems, which does not require exploiting too many application semantics since all operations are commutative.

### Efficient State-Based CRDTs by Delta-Mutation

• Computer Science
NETYS
• 2015
This work introduces Delta State Conflict-Free Replicated Datatypes ($$\delta$$-CRDT) that can achieve the best of both worlds: small messages with an incremental nature, disseminated over unreliable communication channels.

### Efficient state-based CRDTs by decomposition

• Computer Science
PaPEC '14
• 2014
This work introduces a decomposable version of state-based CRDTs, called Delta State-basedCRDTs (Δ-CRDT), and explores the minimal requirements that a communication algorithm must offer according to the guarantees provided by the underlying messaging middleware.

### Making operation-based CRDTs operation-based

• Computer Science
PaPEC '14
• 2014
The design space for operation-based solutions is explored, and the interaction with the middleware is leveraged by offering a technique that delivers very compact solutions, while only broadcasting operation names and arguments.

### Convergent and Commutative Replicated Data Types

• Computer Science
Bull. EATCS
• 2011
This paper formalises asynchronous object replication, either state based or oper- ation based, and provides a sufficient condition appropriate for each case, and describes several useful CRDTs, including container data types supporting both add and remove operations with clean semantics, and more complex types such as graphs and monotonic DAGs.

## References

SHOWING 1-10 OF 11 REFERENCES

### Implementation of the Ficus Replicated File System

• Computer Science
USENIX Summer
• 1990
The Ficus replicated le system for NFS is introduced and how it is layered on top of existing le systems is shown, in a manner analogous to object-oriented programming with inheritance.

### A Programming Methodology for Disconnected Operation

This paper presents a programming methodology that enables the programmer to write applications capable of adapting to disconnected operation, based on experience building a disconnected NFS filesystem (D-NFS) for portable computers.

### Building information systems for mobile environments

• Computer Science
CIKM '94
• 1994
This paper presents system support for maintaining the consistency of replicated data and for providing transaction schemas that account for the frequent but predictable disconnections, the mobility, and the vulnerability of the wireless environment.

### Flexible update propagation for weakly consistent replication

• Computer Science
SOSP
• 1997
The anti-entropy protocol is presented in detail, describing the design decisions and resulting features, and how it enables replica convergence, and updates can be propagated using floppy disks and similar transportable media.

### The Bayou Architecture: Support for Data Sharing Among Mobile Users

• Computer Science
1994 First Workshop on Mobile Computing Systems and Applications
• 1994
A fresh, bottom-up and critical look at the requirements of mobile computing applications and carefully pull together both new and existing techniques into an overall architecture that meets these requirements.

### Resolving File Conflicts in the Ficus File System

• Computer Science
USENIX Summer
• 1994
It is concluded from the experience that optimistic concurrency works well in at least one realistic environment, conflicts are rare, and a large proportion of those conflicts that do occur can be automatically solved without human intervention.

### Flexible and Safe Resolution of File Conflicts

• Computer Science
USENIX
• 1995
The design combines a rule-based approach to ASR selection with transactional encapsulation of ASR execution and shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness.

### Bluetooth: vision, goals, and architecture

• Computer Science
MOCO
• 1998
The vision and goals of the Bluetooth program are described, the radio-based technology is introduced and the technology itself is introduced.