期刊名称:International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN:2320-9798
电子版ISSN:2320-9801
出版年度:2019
卷号:7
期号:1
页码:341-350
DOI:10.15680/IJIRCCE.2019. 0701038
出版社:S&S Publications
摘要:The main aim of this study is to design conflict-free algorithm to minimize the download time of these
multiple files requested by the multiple network clients from the cloud or fog storage servers, using network coding.
The problem of reducing the download time of multiple files requested by multiple clients from multiple cloud/fog
storage servers. Given possible previous file downloads by the clients, network coding can be efficiently exploited to
expedite the download process. Since each client can tune to only one server at a time, the sets of clients served by the
different servers must be disjoint in order to guarantee a maximum reduction in download time. To accomplish disjoint
download mechanisms, a dual conflict network coding graph is proposed. Given the intractability of the long-term
optimal solution, we propose an online algorithm using the designed dual conflict graph. For the case of one file
request per client, both asymptotic lower and upper bounds of the performance of the proposed conflict-free algorithm
are derived.
关键词:Fog Computing; Cloud Computing; Fog Radio Access Networks; Network Coding;