A Catalog-Based Caching Strategy for Structured P2P Systems

  • Mile Arnedo
  • Maria del Pilar Villamil
  • Ricardo Villanueva
  • Harold Castro
  • Laurent d’Orazio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6265)

Abstract

Cache attempts to improve performance in P2P systems in three ways: improve response time, availability and load balancing. Despite their benefits, some proposals are very coupled with the application level and cannot be easily implemented in other environments, other use pre-defined structures difficult to maintain, or assume peers are physically homogeneous. So, the search for portable and flexible strategies remains an open problem. In this paper we present a caching strategy for improving response time during a query execution using a catalog with information of neighbors cached items, allowing the interaction between different cache levels. A performance evaluation using grids is provided to verify the improvement achieved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bhattacharjee, B., Chawathe, S., Gopalakrishnan, V., Keleher, P., Silaghi, B.: Efficient peer-to-peer searches using result-caching. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 225–236. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    d’Orazio, L., Jouanot, F., Denneulin, Y., Labbé, C., Roncancio, C., Valentin, O.: Distributed semantic caching in grid middleware. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 162–171. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Deb, S., Linga, P., Rastogi, R., Srinivasan, A.: Accelerating lookups in P2P systems using peer caching. In: ICDE 2008, pp. 1003–1012. IEEE, Los Alamitos (2008)Google Scholar
  4. 4.
    Fan, L., Cao, P., Almeida, J., Broder, A.: Summary Cache: A scalable wide-area web cache sharing protocol. In: SIGCOMM 2000, pp. 281–293. IEEE, Los Alamitos (2000)Google Scholar
  5. 5.
    Gómez, C.E., del Pilar Villamil, M., Castro, H.E., d’Orazio, L.: DHTCache: A distributed service to improve the selection of cache configurations within a highly-distributed context. In: Hameurlain, A., Tjoa, A.M. (eds.) Globe 2009. LNCS, vol. 5697, pp. 48–59. Springer, Heidelberg (2009)Google Scholar
  6. 6.
    Qian, W., Xu, L., Zhou, S., Zhou, A.: CoCache: query processing based on collaborative caching in P2P systems. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 498–510. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Rao, W., Chen, L., Wai-Chee, A., Bu, Y.: Optimal proactive caching in peer-to-peer network: analysis and application. In: CIKM 2007, pp. 663–672. ACM, New York (2007)CrossRefGoogle Scholar
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Sanchez-Artigas, M., Garcia-Lopez, P., Skarmeta, A.: On the relationship between caching and routing in DHTs. In: WI-IAT 2007, pp. 415–418. IEEE, Los Alamitos (2007)Google Scholar
  10. 10.
    Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. In: TNET 2003, pp. 17–32. IEEE, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mile Arnedo
    • 1
  • Maria del Pilar Villamil
    • 1
  • Ricardo Villanueva
    • 1
  • Harold Castro
    • 1
  • Laurent d’Orazio
    • 2
  1. 1.University of Los AndesColombia
  2. 2.University Blaise PascalFrance

Personalised recommendations