Skip to main content

Joint pushing and caching with a finite receiver buffer: Optimal policies and throughput analysis

Author(s): Chen, Wei; Poor, H Vincent

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr16t0gw4s
Abstract: Pushing and caching hold the promise of significantly increasing the throughput of content-centric wireless networks. However, the throughput gain of these techniques is limited by the buffer size of the receiver. To overcome this, this paper presents a Joint Pushing and Caching (JPC) method that jointly determines the contents to be pushed to, and to be removed from, the receiver buffer in each timeslot. An offline and two online JPC policies are proposed respectively based on noncausal, statistical, and causal content Request Delay Information (RDI), which predicts a user's request time for certain content. It is shown that the effective throughput of JPC is increased with the receiver buffer size and the pushing channel capacity. Furthermore, the causal feedback of user requests is found to greatly enhance the performance of online JPC without inducing much signalling overhead in practice.
Publication Date: May-2016
Citation: Chen, Wei, Poor, H Vincent. (2016). Joint pushing and caching with a finite receiver buffer: Optimal policies and throughput analysis. 2016 IEEE International Conference on Communications (ICC), 10.1109/icc.2016.7510697
DOI: doi:10.1109/icc.2016.7510697
Type of Material: Journal Article
Journal/Proceeding Title: 2016 IEEE International Conference on Communications (ICC)
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.