Sciweavers

362 search results - page 6 / 73
» Using Erasure Codes Efficiently for Storage in a Distributed...
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Distributed storage codes reduce latency in vehicular networks
—We investigate the benefits of distributed storage using erasure codes for file sharing in vehicular networks through realistic trace-based simulations. We find that coding o...
Maheswaran Sathiamoorthy, Alexandros G. Dimakis, B...
AC
2003
Springer
14 years 26 days ago
Replication Strategies for Highly Available Peer-to-Peer Storage
We are investigating strategies for using replication to design and implement highly reliable peer-to-peer systems. In particular, we are comparing the use of whole object and blo...
Ranjita Bhagwan, David Moore, Stefan Savage, Geoff...
ISPA
2005
Springer
14 years 1 months ago
Redundancy Schemes for High Availability in DHTs
High availability in peer-to-peer DHTs requires data redundancy. This paper takes user download behavior into account to evaluate redundancy schemes in data storage and share syste...
Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
GLOBECOM
2010
IEEE
13 years 5 months ago
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
Frédéric Giroire, Julian Monteiro, S...
IWSOS
2009
Springer
14 years 6 days ago
Self-organized Data Redundancy Management for Peer-to-Peer Storage Systems
In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper...
Yaser Houri, Manfred Jobmann, Thomas Fuhrmann