Skip to search formSkip to main contentSkip to account menu

A scalable content-addressable network

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.
View on ACM (opens in a new tab)

GHT: a geographic hash table for data-centric storage

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.
View on ACM (opens in a new tab)

A scalable content-addressable network

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.
View via Publisher (opens in a new tab)

Making gnutella-like P2P systems scalable

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.
View on ACM (opens in a new tab)

Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table

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.
View on Springer (opens in a new tab)

Making middleboxes someone else's problem: network processing as a cloud service

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%.
View on ACM (opens in a new tab)

Topologically-aware overlay construction and server selection

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.
View on IEEE (opens in a new tab)

The impact of DHT routing geometry on resilience and proximity

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.
View on ACM (opens in a new tab)

Beacon vector routing: scalable point-to-point routing in wireless sensornets

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…
View on ACM (opens in a new tab)

Application-Level Multicast Using Content-Addressable Networks

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.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)