Title
When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
Abstract
The concept of distributed storage networks (DSNs) mostly follows two main modeling assumptions: Any k out of n surviving nodes should be able to reconstruct the protected file; and if one node fails, the replacement node can access d helper nodes to repair its content either functionally or exactly. Two major existing approaches for DSNs are the so-called regenerating codes (RCs) and locally repa...
Year
DOI
Venue
2018
10.1109/TIT.2017.2780230
IEEE Transactions on Information Theory
Keywords
Field
DocType
Peer-to-peer computing,Maintenance engineering,Encoding,Indexes,Network coding,Distributed databases,Computer network reliability
Linear network coding,Discrete mathematics,Existential quantification,Computer science,Distributed data store,Peer to peer computing,Theoretical computer science,Distributed database,Decoding methods,Maintenance engineering,Encoding (memory)
Journal
Volume
Issue
ISSN
64
3
0018-9448
Citations 
PageRank 
References 
1
0.36
0
Authors
2
Name
Order
Citations
PageRank
Imad Ahmad172.91
Chih-Chun Wang279555.20