CONTENT CACHING AND SCHEDULING IN WIRELESS NETWORKS WITH ELASTIC AND INELASTIC TRAFFIC

There is a huge growth in the wireless networks in current days. With this growth, accessing the content through wireless networks needs placing the content at the base stations and scheduling them. Users who are in the network are divided into groups based on the channel conditions, their requests are placed in the front end of the logical queue. All these requests are elastic and inelastic. These requests are placed in the queues which are known as requests queues and the deficit queues contains the deficits which are had in the in elastic services. The data which are stored in the cache are of limited size and they will be getting refreshed frequently to constant time intervals. This paper considering the two different models which will be concentrating on inelastic requests for streaming stored content and real-time streaming of events.  In this paper some of the suggestions are made which are used to design the optimal policies which are used to stabilize the request queues and to reduce the deficit to zer

Scheduling Cached-Content in Wireless Networks With Elastic and Inelastic Traffic

With the exponential growth of wireless content access, the need for content placement and scheduling at wireless base stations increased rapidly. We study a system under which users are divided into clusters based on their channel conditions, and their requests are represented by different queues at logical front ends. Requests might be elastic (implying no hard delay constraint) or inelastic (requiring that a delay target be met). Correspondingly, we have request queues that indicate the number of elastic requests, and deficit queues that indicate the deficit in inelastic service. Caches are of finite size and can be refreshed periodically from a media vault. We consider two cost models that correspond to inelastic requests for streaming stored content and real-time streaming of events, respectively. We design provably optimal policies that stabilize the request queues (hence ensuring finite delays) and reduce average deficit to zero [hence ensuring that the quality-of-service (QoS) target is met] at small cost. We illustrate our approach through simulations

The Role of Caching in Future Communication Systems and Networks

This paper has the following ambitious goal: to convince the reader that content caching is an exciting research topic for the future communication systems and networks. Caching has been studied for more than 40 years, and has recently received increased attention from industry and academia. Novel caching techniques promise to push the network performance to unprecedented limits, but also pose significant technical challenges. This tutorial provides a brief overview of existing caching solutions, discusses seminal papers that open new directions in caching, and presents the contributions of this special issue. We analyze the challenges that caching needs to address today, also considering an industry perspective, and identify bottleneck issues that must be resolved to unleash the full potential of this promising technique