ShanghaiTech University Knowledge Management System
Reduce Transmission Delay for Caching-Aided Two-Layer Networks | |
2019 | |
会议录名称 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
![]() |
ISSN | 2157-8095 |
页码 | 2019-2023 |
发表状态 | 已发表 |
DOI | 10.1109/ISIT.2019.8849624 |
摘要 | In this paper, we consider a two-layer caching-aided network, where a single server consisting of a library of N files connects with multiple relays, each equipped with a cache memory of M-1 files and each relay connects with a distinct set of users, each equipped with a cache memory of M-2 files. We design a caching scheme that exploits the spared transmission time resource by constructing a concurrent transmission between the two layers. It is shown that the caching scheme is order optimal and achieves an additive parallel gain compared to the previously known caching scheme. Also, we show that for the two-relay case, if each relay's caching size M-1 equals to 0:382 N, our scheme achieves the optimal delay as M-1 = N, implying that increasing the relay's cache size will not always reduce the transmission delay. |
关键词 | Caching relay network delay |
会议地点 | Paris, France |
会议日期 | 7-12 July 2019 |
URL | 查看原文 |
收录类别 | EI ; CPCI-S ; CPCI |
WOS研究方向 | Computer Science |
WOS类目 | Computer Science, Information Systems ; Computer Science, Theory & Methods |
WOS记录号 | WOS:000489100302023 |
出版者 | IEEE |
EI主题词 | Information theory ; Network layers |
原始文献类型 | Proceedings Paper |
来源库 | IEEE |
引用统计 | 正在获取...
|
文献类型 | 会议论文 |
条目标识符 | https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/80395 |
专题 | 信息科学与技术学院_硕士生 信息科学与技术学院_PI研究组_吴幼龙组 信息科学与技术学院_本科生 |
通讯作者 | Wang, Ke; Wu, Youlong |
作者单位 | ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai, Peoples R China |
第一作者单位 | 信息科学与技术学院 |
通讯作者单位 | 信息科学与技术学院 |
第一作者的第一单位 | 信息科学与技术学院 |
推荐引用方式 GB/T 7714 | Wang, Ke,Wu, Youlong,Chen, Jiahui,et al. Reduce Transmission Delay for Caching-Aided Two-Layer Networks[C]:IEEE,2019:2019-2023. |
条目包含的文件 | ||||||
文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 |
修改评论
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。