Author : Polanki Harish and Wilson Thomas

This project helps to improve Performance of Distributed Cooperative Caching by choosing appropriate object replacement algorithms in the Social wireless networks (SWNET). E- Object caching in such SWNETs are shown to be able to minimize the Object provisioning and maintenance cost which is based on the pricing and service dependences among different stakeholders including network communication service providers, Object providers (Server) and End users. Here we consider replacement of objects with respect to two dimensions. One is Frequency and another is Recency (freshness) factor of object requests. The efficiency of the algorithm lies in choosing which items to discard to make room for the new ones. So we use the concept of knapsack problem with respect to frequency and freshness of the objects. So nodes maintain their cache memories with more frequent and latest objects.

Keywords: Knapsack, 2-dimensional Cooperative caching, sharing, SWNET, freshness.

Article published in International Journal of Current Engineering and Technology, Vol.4, No.6 (Dec-2014)