Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/6433
Title: | Distributed storage allocations for neighborhood-based data access | Authors: | Jakovetić, Dušan Minja, Aleksandar Bajović, Dragana Vukobratović, Dejan |
Issue Date: | 1-Jan-2015 | Journal: | 2015 IEEE Information Theory Workshop, ITW 2015 | Abstract: | © 2015 IEEE. We introduce a neighborhood-based data access model for distributed coded storage allocation. Storage nodes are connected in a generic network and data is accessed locally: a user accesses a randomly chosen storage node, which subsequently queries its neighborhood to recover the data object. We aim at finding an optimal allocation that minimizes the overall storage budget while ensuring recovery with probability one. We show that the problem reduces to finding the fractional dominating set of the underlying network. Furthermore, we develop a fully distributed algorithm where each storage node communicates only with its neighborhood in order to find its optimal storage allocation. The proposed algorithm is based upon the recently proposed proximal center method-an efficient dual decomposition based on accelerated dual gradient method. We show that our algorithm achieves a (1 + ε)-approximation ratio in O(d<inf>max</inf><sup>3/2</sup>/ε) iterations and per-node communications, where d<inf>max</inf> is the maximal degree across nodes. Simulations demonstrate the effectiveness of the algorithm. | URI: | https://open.uns.ac.rs/handle/123456789/6433 | ISBN: | 9781479955268 | DOI: | 10.1109/ITW.2015.7133126 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.