Squirrel: a decentralized peer-to-peer web cache

By Sitaram Iyer, Antony Ian Taylor Rowstron, Peter Druschel. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2002

443 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/c80eedb8db4b1e39396b6490b85bd88d3203bb39

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Robert Morris
2. Emil Sit
3. John Risson
4. Tim Moors
5. Michael J. Freedman
6. Honghui Lu
7. Frank Dabek
8. Jinyang Li

Citations in the corpus

• Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Applications [1, 198-200] Memory [32, 90, 142, 201-222] File Systems Web Content Delivery Networks Directories Service Discovery Publish / Subscribe .”
• Democratizing Content Publication with Coral (2004, background): “Squirrel proposes web caching on a traditional DHT, although only for organization-wide networks [10].”
• A Self-Organizing Flock of Condors (2003, unknown): “These approaches have many applications ranging from distributed storage facilities [27], scalable group communication systems [4], decentralized p2p web caching [ 17 ], as well as enhancing the scalability of multi-hop routing protocols for mobile ad-hoc networks [16].”
• Peer-to-peer support for massively multiplayer games (2004, background): “0 20 40 60 80 100 Percentage of nodes [0-10] [10-20] [20-30] [30-40] [40-50] [50-60] [60-70] [70-80] [80-90] [90-100] [100-110] [110-120] [120-130] [130-140] [140-150] [150-160] [160-170] [170-180] [180-190] [190-200] [200-210] [210-220]”
• Symphony: Distributed Hashing in a Small World (2003, background): “The research community is working on a wide variety of peer to peer applications like persistent data storage (CFS [6], Farsite [3], Oceanstore [11], PAST [19]), event noti cation and application level multicast (Bayeux [23], Scribe [20] and CAN-based Multicast [17]), DNS [5], resource discovery [2]”
• Designing a DHT for Low Latency and High Throughput (2004, background): “A number of DHTs provide only a key location service, perhaps with a layer of indirection, and let each application decide where (or even whether) to store data [20, 28].”