2011
DOI: 10.1007/s11227-011-0708-z
|View full text |Cite|
|
Sign up to set email alerts
|

A novel dynamic network data replication scheme based on historical access record and proactive deletion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
35
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 71 publications
(35 citation statements)
references
References 13 publications
0
35
0
Order By: Relevance
“…Based on this model, they developed an algorithm to find near-optimal dynamic allocation solutions. Zhe Wang et al [26] have presented a dynamic data replication strategy based on two ideas. The first one employed historical access records which were useful for picking up a file to replicate.…”
Section: Related Work: a Brief Reviewmentioning
confidence: 99%
“…Based on this model, they developed an algorithm to find near-optimal dynamic allocation solutions. Zhe Wang et al [26] have presented a dynamic data replication strategy based on two ideas. The first one employed historical access records which were useful for picking up a file to replicate.…”
Section: Related Work: a Brief Reviewmentioning
confidence: 99%
“…DCs, within a DC in different nodes or at the client-side [4,4,15], whereas the focus of adaptive geo-replication is to decide what data, where the data is located within the overall system of DCs and how many replicas exist simultaneously, [1,2,10,12,18]. Both of these types maybe be combined to obtain further performance improvements.…”
Section: Classification Of Strategiesmentioning
confidence: 99%
“…Wang et al (2011) proposed an algorithm for dynamic data replication strategy .It employs historical access records which are useful for picking up a file to replicate. Next one is proactive deletion method [12], is applied to control the replica number to reach an optimal balance between the read and the write update overhead. This replication algorithm uses the popularity of the file to make replication decision.…”
Section: Related Workmentioning
confidence: 99%