Adaptive Caching Networks With Optimality Guarantees - 2018


We have a tendency to study the optimal placement of content over a network of caches, a problem naturally arising in several networking applications. Given a demand of content request rates and ways followed, we tend to would like to see the content placement that maximizes the expected caching gain, i.e., the reduction of routing prices because of intermediate caching. The offline version of this drawback is NP-arduous and, normally, the demand and topology might be a priori unknown. Hence, a distributed, adaptive approximation algorithm for inserting contents into caches is desired. We have a tendency to show that path replication, a straightforward algorithm frequently encountered in literature, will be arbitrarily suboptimal when combined with traditional eviction policies. We propose a distributed, adaptive algorithm that performs stochastic gradient ascent on a concave relaxation of the expected caching gain, and constructs a probabilistic content placement among a one-one/e factor from the optimal, in expectation. Motivated by our analysis, we have a tendency to also propose a novel greedy eviction policy to be used with path replication, and show through numerical evaluations that both algorithms considerably outperform path replication with traditional eviction policies over a broad array of network topologies.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :An Improved Adaptive P&O Technique for TwoStage Grid Interfaced SPVECSABSTRACT:This work presents an improved perturb and observe with adaptive perturbation size (IAP&O) algorithm for harnessing most power from
PROJECT TITLE :Capacity Maximizing Adaptive Power Splitting Protocol for Cooperative Energy Harvesting Communication Systems - 2018ABSTRACT:In this letter, we have a tendency to propose a unique power splitting (PS) protocol
PROJECT TITLE :Adaptive Contention Window Control Scheme in Wireless Ad Hoc Networks - 2018ABSTRACT:This competition mechanism of the IEEE 802.11 distributed coordination function (DCF) is understood to own some drawbacks, e.g.,
PROJECT TITLE :Adaptive Beamforming in an Impulsive Noise Environment Using Matrix Completion - 2018ABSTRACT:In this letter, a brand new approach is presented for sturdy adaptive beamforming in an impulsive noise environment.
PROJECT TITLE :Efficient System Tracking With Decomposable Graph-Structured Inputs and Application to Adaptive Equalization With Cyclostationary Inputs - 2018ABSTRACT:This Project introduces the graph-structured recursive least

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry