Please use this identifier to cite or link to this item:
|Title:||Optimizing content retrieval delay for LT-based distributed cloud storage systems||Authors:||Cai, Jianfei
Foh, Chuan Heng
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Source:||Lu, H., Foh, C. H., Wen, Y., & Cai, J. (2012). Optimizing content retrieval delay for LT-based distributed cloud storage systems. 2012 IEEE Global Communications Conference (GLOBECOM), 1920-1925.||Abstract:||Among different setups of cloud storage systems, fountain-codes based distributed cloud storage system provides reliable online storage solution through placing coded content fragments into multiple storage nodes. Luby Transform (LT) code is one of the popular fountain codes for storage systems due to its efficient recovery. However, to ensure high success decoding of fountain codes based storage, retrieval of additional fragments is required, and this requirement introduces additional delay, which is critical for content retrieval or downloading applications. In this paper, we show that multiple-stage retrieval of fragments is effective to reduce the content-retrieval delay. We first develop a delay model for various multiple-stage retrieval schemes applicable to our considered system. With the developed model, we study optimal retrieval schemes given the success decodability requirement. Our numerical results demonstrate that the content-retrieval delay can be significantly reduced by optimally scheduling packet requests in a multi-stage fashion.||URI:||https://hdl.handle.net/10356/98525
|DOI:||10.1109/GLOCOM.2012.6503396||Rights:||© 2012 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.