Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Joint Pushing and Caching with a Finite Receiver Buffer: Optimal Policies and Throughput Analysis (1602.04500v2)

Published 14 Feb 2016 in cs.IT and math.IT

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.

Citations (15)

Summary

We haven't generated a summary for this paper yet.