期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：6
DOI：10.15680/ijircce.2015.0306251
出版社：S&S Publications
摘要：Caching is a key technique for improving the data retrieval performance of mobile clients in mobileenvironments. The emergence of robust and reliable technologies now brings to reality what we call "cooperativecaching‖ in which mobile clients can access data items from the cache in their neighbouring peers. We discusscooperative caching in mobile environments and propose a cooperative caching scheme for mobile systems. With ourmodel, we extend beyond these populations to project cooperative caching behaviour in regions with millions ofclients. Overall, we demonstrate that cooperative caching has performance benefits only within limited populationbounds. Then optimal cooperative caching policy for minimizing electronic content provisioning cost in SocialWireless Networks (SWNETs). To reduce user-perceived latency in retrieving documents on the World Wide Web, acommonly used technique is caching both at the client's browser and more gainfully (due to sharing) at a proxy. Theeffectiveness of Web caching hinges on the replacement policy that determines the relative value of caching differentobjects. An important component of such policy is to predict next-request times. Using various Web server logs, wecompared existing cache replacement policies with our server-assisted schemes. The first issue is whether Web requestsfrom a fixed user community are distributed. It relates to a number of studies on the characteristics of Web proxytraces, which have shown that the hit-ratios and temporal locality of the traces exhibit certain asymptotic properties thatare uniform across the different sets of the traces. We find that the model yields asymptotic behavior that are consistentwith the experimental observations, suggesting that the various observed properties of hit-ratios and temporal localityare indeed inherent to Web accesses observed. Finally, we revisit Web cache replacement and show that the algorithmthat is suggested by this simple model performs best on real trace data.
