A scalable content-addressable network
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker
- Computer ScienceConference on Applications, Technologies…
- 2001
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
GHT: a geographic hash table for data-centric storage
- S. Ratnasamy, B. Karp, S. Shenker
- Computer ScienceACM International Conference on Wireless Sensor…
- 28 September 2002
This paper describes GHT, a Geographic Hash Table system for DCS on sensornets, and demonstrates that GHT is the preferable approach for the application workloads predicted, offers high data availability, and scales to large sensornet deployments, even when nodes fail or are mobile.
A scalable content-addressable network
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker
- Computer ScienceConference on Applications, Technologies…
- 1 October 2001
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Making gnutella-like P2P systems scalable
- Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker
- Computer ScienceConference on Applications, Technologies…
- 25 August 2003
This work proposes several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems.
Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table
- S. Ratnasamy, B. Karp, Fang Yu
- Computer ScienceMob. Networks Appl.
- 1 August 2003
GHT, a Geographic Hash Table system for DCS on sensornets, is described, and it is demonstrated that GHT is the preferable approach for the application workloads, analytically predict, offers high data availability, and scales to large sensornet deployments, even when nodes fail or are mobile.
Making middleboxes someone else's problem: network processing as a cloud service
- Justine Sherry, Shaddi Hasan, Colin Scott, A. Krishnamurthy, S. Ratnasamy, V. Sekar
- Computer ScienceCCRV
- 13 August 2012
APLOMB solves real problems faced by network administrators, can outsource over 90% of middlebox hardware in a typical large enterprise network, and, in a case study of a real enterprise, imposes an average latency penalty of 1.1ms and median bandwidth inflation of 3.8%.
Topologically-aware overlay construction and server selection
- S. Ratnasamy, M. Handley, R. Karp, S. Shenker
- Computer ScienceProceedings.Twenty-First Annual Joint Conference…
- 7 November 2002
A binning scheme whereby nodes partition themselves into bins such that nodes that fall within a given bin are relatively close to one another in terms of network latency, which indicates that the performance of these applications can be significantly improved by even the rather coarse-grained knowledge of topology offered by this scheme.
The impact of DHT routing geometry on resilience and proximity
- K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, I. Stoica
- Computer ScienceConference on Applications, Technologies…
- 25 August 2003
The basic finding is that, despite the initial preference for more complex geometries, the ring geometry allows the greatest flexibility, and hence achieves the best resilience and proximity performance.
Beacon vector routing: scalable point-to-point routing in wireless sensornets
- Rodrigo Fonseca, S. Ratnasamy, I. Stoica
- Computer ScienceSymposium on Networked Systems Design and…
- 2 May 2005
We propose a practical and scalable technique for point-to-point routing in wireless sensornets. This method, called Beacon Vector Routing (BVR), assigns coordinates to nodes based on the vector of…
Application-Level Multicast Using Content-Addressable Networks
- S. Ratnasamy, M. Handley, R. Karp, S. Shenker
- Computer ScienceNetworked Group Communication
- 7 November 2001
This paper proposes an application-level multicast scheme capable of scaling to large group sizes without restricting the service model to a single source, and believes it offers the dual advantages of simplicity and scalability.
...
...