In the context of Arias, a distributed shared memory service with a persistent global address space, we have designed a generic framework for consistency protocols. We motivate the general design of Arias and the specific approach to consistency, which is to allow applications to choose the consistency protocol adapted to their data synchronization model. A simple entity, the zone, is introduce...

In this paper we provide a unified and flexible framework for study of the time consistency of risk and performance measures. The proposed framework integrates existing forms of time consistency as well as various connections between them. In our approach the time consistency is studied for a large class of maps that are postulated to satisfy only two properties – monotonicity and locality. Thi...

In this paper, we argue that enforcing routing consistency in keybased routing (KBR) protocols can simplify P2P application design and make structured P2P overlays suitable for more applications. We define two levels of routing consistency semantics, namely weakly consistent KBR and strongly consistent KBR. We focus on an algorithm that provides strong consistency based on group membership serv...

An ultimate goal for modern Internet services is the development of scalable, high-performance, highly-available and fault-tolerant systems. Replication is an important approach to achieve this goal. However, replication introduces the issue of consistency among replicas, which is further complicated by network partitions. Generally, higher consistency levels result in lower system availability...

Limitations of CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system design. We focus on the problem of what a designer should do if she has an algorithm that works correctly with sequential consistency but is faced with an underlying key-value store that provides a ...

Several proposed peer-to-peer networks use hypercube routing for scalability. Consistency of neighbor tables in hypercube routing guarantees the existence of a path from any source node to any destination node. Such consistency, however, can be broken by node failures. To improve the robustness of hypercube routing, we first generalize the concept of consistency to K-consistency, for K ≥ 1, whi...