202 search results - page 5 / 41 » Dynamic and Redundant Data Placement |
HOTOS
2003
IEEE
14 years 23 days ago
2003
IEEE
Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to ...
DSN
2008
IEEE
13 years 9 months ago
2008
IEEE
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
NCA
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
TMC
2010
13 years 5 months ago
2010
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
MDM
2010
Springer
13 years 5 months ago
2010
Springer
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...