메뉴 건너뛰기




Volumn , Issue , 2007, Pages 663-672

Optimal proactive caching in peer-to-peer network: Analysis and application

Author keywords

Peer to peer; Placement strategy; Web caching

Indexed keywords

FAULT TOLERANCE; KNOWLEDGE MANAGEMENT; TERNARY ALLOYS; TUNGSTEN ALLOYS;

EID: 63449122496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321533     Document Type: Conference Paper
Times cited : (28)

References (30)
  • 1
    • 63449114803 scopus 로고    scopus 로고
    • In http://squid.nlanr.net.
    • In http://squid.nlanr.net.
  • 2
    • 63449125617 scopus 로고    scopus 로고
    • In ftp://ircache.nlanr.net/Traces/DITL-2007-01-09.
    • In ftp://ircache.nlanr.net/Traces/DITL-2007-01-09.
  • 3
    • 63449139724 scopus 로고    scopus 로고
    • In http://ita.ee.lbl.gov/html/contrib/BU-Web-Client.html.
    • In http://ita.ee.lbl.gov/html/contrib/BU-Web-Client.html.
  • 7
    • 5044220540 scopus 로고    scopus 로고
    • Replication strategies in unstructured peer-to-peer networks
    • Edith Cohen and Scott Shenker. Replication strategies in unstructured peer-to-peer networks. In SIGCOMM, 2002.
    • (2002) SIGCOMM
    • Cohen, E.1    Shenker, S.2
  • 8
    • 34247141739 scopus 로고    scopus 로고
    • An optimal overlay topology for routing peer-to-peer searches
    • Brian F. Cooper. An optimal overlay topology for routing peer-to-peer searches. In Middleware, 2005.
    • (2005) Middleware
    • Cooper, B.F.1
  • 11
    • 0010300145 scopus 로고    scopus 로고
    • A scalable content-addressable network
    • Sylvia Ratnasamy etc. A scalable content-addressable network. In SIGCOMM, 2001.
    • (2001) SIGCOMM
    • Ratnasamy, S.1
  • 12
    • 0032178083 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area web cache sharing protocol
    • Li Fan, Pei Cao, Jussara M. Almeida, and Andrei Z. Broder. Summary cache: A scalable wide-area web cache sharing protocol. In SIGCOMM, pages 254-265, 1998.
    • (1998) SIGCOMM , pp. 254-265
    • Fan, L.1    Cao, P.2    Almeida, J.M.3    Broder, A.Z.4
  • 13
    • 0036953821 scopus 로고    scopus 로고
    • Squirrel: A decentralized peer-to-peer web cache
    • Sitaram Iyer, Antony I. T. Rowstron, and Peter Druschel. Squirrel: a decentralized peer-to-peer web cache. In PODC, pages 213-222, 2002.
    • (2002) PODC , pp. 213-222
    • Iyer, S.1    Rowstron, A.I.T.2    Druschel, P.3
  • 14
    • 33745630382 scopus 로고    scopus 로고
    • Baton: A balanced tree structure for peer-to-peer networks
    • H. V. Jagadish, Beng Chin Ooi, and Quang Hieu Vu. Baton: A balanced tree structure for peer-to-peer networks. In VLDB, 2005.
    • (2005) VLDB
    • Jagadish, H.V.1    Chin Ooi, B.2    Hieu Vu, Q.3
  • 16
    • 34848848003 scopus 로고    scopus 로고
    • Kache: Peer-to-peer web caching using kelips
    • June
    • Prakash Linga, Indranil Gupta, and Ken Birman. Kache: Peer-to-peer web caching using kelips. In In submission, June 2004.
    • (2004) In submission
    • Linga, P.1    Gupta, I.2    Birman, K.3
  • 17
    • 0036374187 scopus 로고    scopus 로고
    • Search and replication in unstructured peer-to-peer networks
    • Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker. Search and replication in unstructured peer-to-peer networks. In SIGMETRICS, 2002.
    • (2002) SIGMETRICS
    • Lv, Q.1    Cao, P.2    Cohen, E.3    Li, K.4    Shenker, S.5
  • 19
    • 84883600951 scopus 로고    scopus 로고
    • Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays
    • Venugopalan Ramasubramanian and Emin Gun Sirer. Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In NSDI, 2004.
    • (2004) NSDI
    • Ramasubramanian, V.1    Gun Sirer, E.2
  • 20
    • 27644465054 scopus 로고    scopus 로고
    • The design and implementation of a next generation name service for the internet
    • Venugopalan Ramasubramanian and Emin Gun Sirer. The design and implementation of a next generation name service for the internet. In SIGCOMM, 2004.
    • (2004) SIGCOMM
    • Ramasubramanian, V.1    Gun Sirer, E.2
  • 21
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
    • Antony I. T. Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, 2001.
    • (2001) Middleware
    • Rowstron, A.I.T.1    Druschel, P.2
  • 22
    • 0037542382 scopus 로고    scopus 로고
    • Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility
    • Antony I. T. Rowstron and Peter Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In SOSP, 2001.
    • (2001) SOSP
    • Rowstron, A.I.T.1    Druschel, P.2
  • 24
    • 0040911004 scopus 로고    scopus 로고
    • A survey of web caching schemes for the internet
    • Jia Wang. A survey of web caching schemes for the internet. In ACMComputer Communication Review, 1999.
    • (1999) ACMComputer Communication Review
    • Wang, J.1
  • 25
    • 63449119810 scopus 로고    scopus 로고
    • Allison Woodruff, Paul M. Aoki, Eric Brewer, Paul Gauthier, and Lawrence A. Rowe. An investigation of documents from the www. In In Proceedings ofthe Fifth International WWW Conference, page 963aV979, 1996.
    • Allison Woodruff, Paul M. Aoki, Eric Brewer, Paul Gauthier, and Lawrence A. Rowe. An investigation of documents from the www. In In Proceedings ofthe Fifth International WWW Conference, page 963aV979, 1996.
  • 26
    • 63449105507 scopus 로고    scopus 로고
    • Praveen Yalagandula and Mike Dahlin. A Scalable
    • Praveen Yalagandula and Mike Dahlin. A Scalable
  • 27
    • 63449117692 scopus 로고    scopus 로고
    • Distributed Information Management System. 34, pages 379-390, New York, NY, USA, 2004. ACM Press.
    • Distributed Information Management System. volume 34, pages 379-390, New York, NY, USA, 2004. ACM Press.
  • 30
    • 34548734105 scopus 로고    scopus 로고
    • Popularity biased random walks for peer-to-peer search under the square root principle
    • Ming Zhong and Kai Shen. Popularity biased random walks for peer-to-peer search under the square root principle. In IPTPS, 2006.
    • (2006) IPTPS
    • Zhong, M.1    Shen, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.