Random Articles
Reseach Article
Cooperative Cache implementation using Dynamic Hash Scheme in Partitioned Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 58 - Number 22 |
| Year of Publication: 2012 |
| Authors: Mehdi Mohtashamzadeh |
10.5120/9433-3855
|
Mehdi Mohtashamzadeh . Cooperative Cache implementation using Dynamic Hash Scheme in Partitioned Networks. International Journal of Computer Applications. 58, 22 ( November 2012), 40-43. DOI=10.5120/9433-3855
Abstract
Caching is a popular mechanism for enhancing performance of memory access speed. To achieve such enhancement, cached data should have enough locality in time. Locality is an inseparable property of data in standalone computers, but do network traffic patterns have sufficient locality so that caches can take advantage from? Although individual IP addresses do not show significant locality, IP prefixes in a network (especially close to hosts which comprise hot documents) are dominantly repetitive and local, so caches may work based on IP prefixes instead of entire IP addresses. Considering the locality of IP prefixes, there is still another challenge which should be overcome. According to memory constraints hosts are faced with, caches can include limited proportion of information that they really need to. To acquire non-cached information, nodes have to communicate with corresponding servers which is time and resource consuming. To effectively deal with such issue networks can be enhanced with cooperative caching by which every node provides its cache contents to others when they submit requests. This paper outlines an improved cooperative caching method which functions based on IP prefixes to divide network to several partitions. Experiments indicate that the proposed mechanism would noticeably improve cache hit, cache load, and CPU load parameters.
References
- M. Dahlin, R. Wang, T. E. Anderson, and D. A. Patterson. Cooperative caching: Using remote client memory to improve ?le system performance. In OSDI'94, 1994.
- Edge Side Includes - Standard Speci?cation. http://www. esi. org.
- IBM WebSphere Edge Server. http://www3. ibm. com/software/webservers/edgeserver/.
- L. Gao, M. Dahlin, A. Nayate, J. Zheng, and A. Iyengar. Application Speci?c Data eplication for Edge Services. In WWW-2003.
- C. Yuan, Y. Chen, and Z. Zhang. Evaluation of Edge Caching/Of?oading for Dynamic Content Delivery. In WWW-2003.
- D. Karger, A. Sherman, A. Berkheimer, B. Bogstad, R. Dhanidina, K. Iwamoto, B. Kim, L. Matkins, and Y. Yerushalmi. Web Caching with Consistent Hashing. In WWW-8, 1997.
- R. Tewari, M. Dahlin, H. Vin, and J. Kay. Beyond Hierarchies: Design Considerations for Distributed Caching on the Internet. In ICDCS-1999.
- A. Wolman, G. M. Voelkar, N. Sharma, N. Cardwell, A. Karlin, and H. M. Levy. On the scale and performance of cooperative web proxy caching. In SOSP 1999.
- S. Shah, K. Ramamritham, and P. Shenoy. Resilient and Coherence Preserving Dissemination of Dynamic Data Using Cooperating Peers. IEEE-TKDE, July 2004.
- L. Ramaswamy, L. Liu, and A. Iyengar. Cache Clouds: Cooperative Caching of Dynamic Documents in Edge Networks. 25th IEEE International Conference on Distributed Computing Systems (ICSCS'05).
- W. -S. Li, W. -P. Hsiung, D. V. Kalshnikov, R. Sion, O. Po, D. Agrawal, and K. S. Candan. Issues and Evaluations of Caching Solutions for Web Application Acceleration. In VLDB-2002.
- D. A. Menasce. Scaling Web Sites Through Caching. IEEEInternet Computing, August 2003.
- J. Yin, L. Alvisi, M. Dahlin, and A. Iyengar. Engineering Web Cache Consistency. ACM-TOIT, August 2002.
- H. Liu, "Routing pre?x caching in network processor design," in Proc. ICCCN, Phoenix, AZ, 2001.
- University of Oregon Route Views Project, http://www. antc. uoregon. edu/route-views/
- H. Liu, "Reducing Routing Table Size using Ternary-CAM", Proc. Hot Interconnect, Stanford, 2001.
Index Terms
Keywords