Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Eventually-serializable data services
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
"-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
ACM Computing Surveys (CSUR)
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Decentralized access control in distributed file systems
ACM Computing Surveys (CSUR)
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
Probabilistic Estimation of Network Size and Diameter
LADC '09 Proceedings of the 2009 Fourth Latin-American Symposium on Dependable Computing
Policy-based access control for weakly consistent replication
Proceedings of the 5th European conference on Computer systems
Distributed local 2-connectivity test of graphs and applications
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The proliferation of connected device rises new challenges for data maintenance in terms of efficiency, scalability and security. In the context of data replication at a large scale, weak consistency has been adopted as a standard in uniformly trusted systems. Recently, a distributed framework has been proposed to handle untrusted systems, by adding access control at the file level. Yet, if no particular care is paid to the connectivity of the network used for replication, w.r.t. dynamically evolving access rights, updates at replicas may not propagate correctly. This paper proposes the design of a middleware application in charge of maintaining the connectivity of the overlay used for update propagation. We propose to improve the resilience of any overlay that may be disconnected as access right policies are modified or as critical nodes crash. This is achieved by reacting to a blocking node by rewiring the overlay in order to preserve at least one path between any pairs of replicas, while conserving the structural characteristics of the overlay. Simulations show that at a tunable overhead, connectivity is maintained, despite local decisions that would have otherwise disrupted the replication service.