Optimistic Scheduling with Geographically Replicated Services in the Cloud Environment (COLOR)

Authors:
Wenbo Zhu;Murray Woodside
Affiliations:
-;-
Venue:
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Year:
2012

Citing 10
Cited 1

Managing update conflicts in Bayou, a weakly connected replicated storage system

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Client-Access Protocols for Replicated Services

IEEE Transactions on Software Engineering
Principled design of the modern Web architecture

ACM Transactions on Internet Technology (TOIT)
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
Design and evaluation of a conit-based continuous consistency model for replicated services

ACM Transactions on Computer Systems (TOCS)
Generic Broadcast

Proceedings of the 13th International Symposium on Distributed Computing
Optimistic atomic broadcast: a pragmatic viewpoint

Theoretical Computer Science - Special issue: Distributed computing
Optimistic Active Replication

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Total order broadcast and multicast algorithms: Taxonomy and survey

ACM Computing Surveys (CSUR)
Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles

Scalable service-oriented replication with flexible consistency guarantee in the cloud

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a system model that unifies different optimistic algorithms designed for deploying geographically replicated services in a cloud environment. The proposed model thereby enables a generalized solution (COLOR) by which well-specified safety and timeliness guarantees are achievable in conjunction with tunable performance requirements. The proposed solution explicitly takes advantage of the unique client-cloud interface in specifying how the level of consistency violation may be bounded, for instance using probabilistic rollbacks or restarts as parameters. The solution differs from traditional Eventual Consistency models in that inconsistency is solved concurrently with online client-cloud interactions over strongly connected networks. We believe that such an approach will bring clarity to the role and limitations of the ever-popular Eventual Consistency model in cloud services.