Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Erasure Codes

Chapter 26
Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications
Erasure code transforms a message of n blocks into a message with more than n blocks – thus introducing redundancy, such that the original message can be recovered from an arbitrary subset (typically of size n) of those blocks.
Published in Chapter:
Maintaining Redundancy in Peer-to-Peer Storage Systems
Anwitaman Datta (NTU Singapore, Singapore), Di Wu (Polytechnic Institute of NYU, USA), Liu Xin (NTU Singapore, Singapore), and Adam Wierzbicki (PJIIT, Poland)
Copyright: © 2010 |Pages: 19
DOI: 10.4018/978-1-61520-686-5.ch026
Abstract
Peer-to-Peer (P2P) storage systems leverage the combined storage capacity of a network of storage devices (peers) contributed typically by autonomous end-users as a common pool of storage space to store and share content. A major challenge in such a system comprising of autonomous participants is to guarantee quality of service in terms of persistence and availability of the stored content. This chapter focuses on the different possible design choices for maintaining redundancy in P2P storage systems, including algorithm details of maintenance mechanisms, analytical models to understand system’s dynamics, empirical results from simulation experiments as well as experiences from prototype deployments.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR