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.
| Original language | English (US) |
|---|---|
| Title of host publication | 2015 IEEE International Conference on Communications (ICC) |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 5517-5522 |
| Number of pages | 6 |
| ISBN (Print) | 9781467364324 |
| DOIs | |
| State | Published - Jun 2015 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): EE002355
Acknowledgements: 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.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.