Tuesday, 15 July 2014
Content Caching and Scheduling in Wireless Networks With Elastic and Inelastic Traffic
CONTENT CACHING AND SCHEDULING IN WIRELESS NETWORKS WITH ELASTIC AND INELASTIC TRAFFIC
The rapid growth of wireless content access implies the need for content placement and scheduling at wireless base stations. 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.
An abstraction of such a network is illustrated in Fig. 1. There
are multiple cellular base stations (BSs), each of which has a cache in which to store content. The content of the caches can be periodically refreshed through accessing a media vault. We divide users into different clusters, with the idea that all users in each cluster are geographically close such that they have statistically similar channel conditions and are able to access the same base stations. Note that multiple clusters could be present in the same cell based on the dissimilarity of their channel conditions to different base stations. The requests made by each cluster are aggregated at a logical entity that we call a front end (FE) associated with that cluster. The front end could be running on any of the devices in the cluster or at a base station, and its purpose is to keep track of the requests associated with the users of that cluster.
DISADVANTAGES OF EXISTING SYSTEM:
v The wireless network between the caches to the users has finite capacity.
v Each cache can only host a finite amount of content.
v Refreshing content in the caches from the media vault incurs a cost.
In this paper, we are interested in solving the joint content placement and scheduling problem for both elastic and inelastic traffic in wireless networks. In doing so, we will also determine the value of predicting the demand for different types of content and what impact it has on the design of caching algorithms..
ADVANTAGES OF PROPOSED SYSTEM:
v We use a request queue to implicitly determine the popularity of elastic content.
v It provides Energy efficiency nodes.
v Minimum cost.
Speed - 1.1 Ghz
RAM - 512 MB(min)
Hard Disk - 40 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - LCD/LED
Operating system : Windows XP.
Coding Language : .Net
Data Base : SQL Server 2005
Tool : VISUAL STUDIO 2008.
Navid Abedini and Srinivas Shakkottai, Member, IEEE, “Content Caching and Scheduling in Wireless Networks With Elastic and Inelastic Traffic” IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22, NO. 3, JUNE 2014