Distributed Backup through Information Dispersal | Zendy

Giampaolo Bella | Zendy; C. Pistagna | Zendy; Salvatore Riccobene | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Distributed Backup through Information Dispersal

Author(s) -

Giampaolo Bella,

C. Pistagna,

Salvatore Riccobene

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.11.046

Subject(s) - backup , computer science , service (business) , computer network , redundancy (engineering) , distributed computing , biological dispersal , node (physics) , computer security , database , operating system , business , engineering , population , demography , structural engineering , marketing , sociology

The formal aspects underlying a novel distributed backup service are discussed. Strength and originality of the service lie in the combined adoption of an established information dispersal algorithm with a simplified version of an existing location service. Information dispersal makes our service threshold-secure in that the backup owner only needs participation of a pre-established threshold number of nodes to recompose a distributed backup. This means that the service is highly available as it tolerates a number of node breakdowns. Even the right threshold number of nodes cannot retrieve the backup on their own initiative. The location service adopted allows our service to work over non-organized, flat networks. Indirect advantages are the optimization of the total redundancy of data and the efficient management of resources. Our service has reached the stage of a proof-of-concept implementation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research