Content caching & distribution Scheduling Using Elastic &Inelastic request

Abstract

In our work we aim at solving joint content placement as well as scheduling difficulty for elastic as well as inelastic traffic within wireless systems and in undertaking so, we determine value of predicting demand for several types of content and the impact it has on aiming of caching algorithms. Elastic requests are accumulated within a request queue by each request that occupy an exacting queue at every front end and the objective is to make available placement as well as scheduling algorithms that can execute any set of severely practical requests. The purpose of inelastic requests is to convince a convinced target delivery ratio of the entire requests that have to be met to make sure smooth play out.