Conflict free network coding for distributed storage networks

Handle URI:
http://hdl.handle.net/10754/597831
Title:
Conflict free network coding for distributed storage networks
Authors:
Al-Habob, Ahmed A.; Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo
Abstract:
© 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side information, IDNC can speed up the current download process. However, transmission conflicts can occur since multiple servers can simultaneously send IDNC combinations of files to the same client, which can tune to only one of them at a time. To avoid such conflicts and design more efficient coded download patterns, we propose a dual conflict IDNC graph model, which extends the conventional IDNC graph model in order to guarantee conflict free server transmissions to each of the clients. We then formulate the download time minimization problem as a stochastic shortest path problem whose action space is defined by the independent sets of this new graph. Given the intractability of the solution, we design a channel-aware heuristic algorithm and show that it achieves a considerable reduction in the file download time, compared to applying the conventional IDNC approach separately at each of the servers.
Citation:
Al-Habob AA, Sorour S, Aboutorab N, Sadeghi P (2015) Conflict free network coding for distributed storage networks. 2015 IEEE International Conference on Communications (ICC). Available: http://dx.doi.org/10.1109/ICC.2015.7249201.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2015 IEEE International Conference on Communications (ICC)
KAUST Grant Number:
EE002355
Issue Date:
Jun-2015
DOI:
10.1109/ICC.2015.7249201
Type:
Conference Paper
Sponsors:
A.A. Al-Habob and S. Sorour would like to acknowledge the supportprovided by King Fahd University of Petroleum and Minerals (KFUPM) andKing Abdullah University of Science and Technology (KAUST) for fundingthis work through Research Institute project number EE002355.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorAl-Habob, Ahmed A.en
dc.contributor.authorSorour, Samehen
dc.contributor.authorAboutorab, Nedaen
dc.contributor.authorSadeghi, Parastooen
dc.date.accessioned2016-02-25T12:57:27Zen
dc.date.available2016-02-25T12:57:27Zen
dc.date.issued2015-06en
dc.identifier.citationAl-Habob AA, Sorour S, Aboutorab N, Sadeghi P (2015) Conflict free network coding for distributed storage networks. 2015 IEEE International Conference on Communications (ICC). Available: http://dx.doi.org/10.1109/ICC.2015.7249201.en
dc.identifier.doi10.1109/ICC.2015.7249201en
dc.identifier.urihttp://hdl.handle.net/10754/597831en
dc.description.abstract© 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side information, IDNC can speed up the current download process. However, transmission conflicts can occur since multiple servers can simultaneously send IDNC combinations of files to the same client, which can tune to only one of them at a time. To avoid such conflicts and design more efficient coded download patterns, we propose a dual conflict IDNC graph model, which extends the conventional IDNC graph model in order to guarantee conflict free server transmissions to each of the clients. We then formulate the download time minimization problem as a stochastic shortest path problem whose action space is defined by the independent sets of this new graph. Given the intractability of the solution, we design a channel-aware heuristic algorithm and show that it achieves a considerable reduction in the file download time, compared to applying the conventional IDNC approach separately at each of the servers.en
dc.description.sponsorshipA.A. Al-Habob and S. Sorour would like to acknowledge the supportprovided by King Fahd University of Petroleum and Minerals (KFUPM) andKing Abdullah University of Science and Technology (KAUST) for fundingthis work through Research Institute project number EE002355.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleConflict free network coding for distributed storage networksen
dc.typeConference Paperen
dc.identifier.journal2015 IEEE International Conference on Communications (ICC)en
dc.contributor.institutionKing Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabiaen
dc.contributor.institutionAustralian National University, Canberra, Australiaen
kaust.grant.numberEE002355en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.