2009
DOI: 10.1007/978-3-642-05148-7_46
|View full text |Cite
|
Sign up to set email alerts
|

Reliable Communication Infrastructure for Adaptive Data Replication

Abstract: In this paper, we propose a data replication algorithm adaptive to unreliable environments. The data replication algorithm, named Adaptive Data Replication (ADR), has already an adaptiveness mechanism encapsulated in its dynamic replica placement strategy. Our extension of ADR to unreliable environments provides a data replication solution that is adaptive both in terms of replica placement and in terms of request routing. At the routing level, this solution takes the unreliability of the environment into acco… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Other research efforts focused on distributed adaptive data replication. In [16] the replication scheme adapts to the read-write pattern, whereas in [3] the objective is to adapt to the read-write pattern while coping with an unreliable environment. Similar to our solution, these approaches define the replication scheme as a connected subtree.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Other research efforts focused on distributed adaptive data replication. In [16] the replication scheme adapts to the read-write pattern, whereas in [3] the objective is to adapt to the read-write pattern while coping with an unreliable environment. Similar to our solution, these approaches define the replication scheme as a connected subtree.…”
Section: Related Workmentioning
confidence: 99%
“…Considering processes and links reliable is a strong assumption. In [3] we proposed a communication infrastructure for supporting data replication in an environment where processes and links fail probabilistically. We plan to study ways to adapt the results in [3] to ScaleStream.…”
Section: Future Workmentioning
confidence: 99%