|
Volumn , Issue , 2008, Pages 89-98
|
Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems
|
Author keywords
[No Author keywords available]
|
Indexed keywords
CLIENT SERVER COMPUTER SYSTEMS;
CODES (SYMBOLS);
COMPUTER NETWORKS;
COMPUTER SYSTEMS;
DATA STORAGE EQUIPMENT;
HIERARCHICAL SYSTEMS;
INTERNET;
PROGRAMMING THEORY;
QUALITY ASSURANCE;
REDUNDANCY;
CODING TECHNIQUES;
COMPLEX OPERATIONS;
CPU POWERS;
DESIGN SPACES;
DISTRIBUTED STORAGE SYSTEMS;
ERASURE CODES;
ERASURE CODING;
HIERARCHICAL CODES;
MULTIPLE COMPONENTS;
NETWORK BANDWIDTHS;
NETWORK TRAFFICS;
NEW CLASSES;
PEER TO PEERS;
PEER-TO-PEER SYSTEMS;
REDUNDANCY SCHEMES;
REDUNDANT DATUMS;
REPLICATED DATUMS;
STORAGE SYSTEMS;
RELIABILITY;
|
EID: 55149104671
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/P2P.2008.9 Document Type: Conference Paper |
Times cited : (56)
|
References (13)
|