Novel approach for cooperative caching in distributed environment

In the present systems that implement cooperative caching the web based associations and their processes are typical. With the usual download model, a user downloads contents directly from a Content Provider’s (CP) server over a Communication Service Provider’s (CSP) network. Downloading content through Content Service Provider’s network involves a cost which must be paid either by end users or by the content provider. The existing systems that usually implement did not solve the budding problems associated with distributed collaboration environments. Suppleness in composition models is limited since sudden changes require change of the entire process. Such changes may cause exceptions disturbing the normal execution of the process. Thus an optimal model is needed to resolve the problems associated with the cooperative caching mechanism. This paper focus on such an optimal model that reduces the cost involved while downloading the required web content by the user.

[1]  Alec Wolman,et al.  On the scale and performance of cooperative Web proxy caching , 1999, SOSP.

[2]  Françoise Sailhan,et al.  Cooperative Caching in Ad Hoc Networks , 2003, Mobile Data Management.

[3]  Sunil Karforma,et al.  A prototype design for DRM based credit card transaction in E-commerce , 2008, UBIQ.

[4]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Michael Dahlin,et al.  Coordinated Placement and Replacement for Large-Scale Distributed Caches , 2002, IEEE Trans. Knowl. Data Eng..

[6]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[7]  Chi-Yin Chow,et al.  GroCoca: group-based peer-to-peer cooperative caching in mobile environment , 2007, IEEE Journal on Selected Areas in Communications.

[8]  Chi-Yin Chow,et al.  Cache signatures for peer-to-peer cooperative caching in mobile environments , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[9]  Marina Thottan,et al.  Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Edith Cohen,et al.  Evaluating Server-Assisted Cache Replacement in the Web , 1998, ESA.

[11]  Azer Bestavros,et al.  Mistreatment in Distributed Caching Groups: Causes and Implications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Kay A. Robbins,et al.  A viability analysis of cooperative proxy caching , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[14]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[15]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[16]  Hassnen Hazen Azez Optimal Cooperative Caching In Social Wireless Networks , 2014 .

[17]  Christos H. Papadimitriou,et al.  Selfish caching in distributed systems: a game-theoretic analysis , 2004, PODC '04.

[18]  Sandeep K. S. Gupta,et al.  Improving on-demand data access efficiency in MANETs with cooperative caching , 2009, Ad Hoc Networks.

[19]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[20]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.