• Publications
  • Influence
A scalable content-addressable network
Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems.Expand
  • 5,868
  • 788
A scalable content-addressable network
Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems.Expand
  • 2,297
  • 127
GHT: a geographic hash table for data-centric storage
Making effective use of the vast amounts of data gathered by large-scale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work hasExpand
  • 995
  • 127
Making gnutella-like P2P systems scalable
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms.Expand
  • 1,254
  • 121
Making middleboxes someone else's problem: network processing as a cloud service
Modern enterprises almost ubiquitously deploy middlebox processing services to improve security and performance in their networks. Despite this, we find that today's middlebox infrastructure isExpand
  • 657
  • 73
Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table
Making effective use of the vast amounts of data gathered by large-scale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. ForExpand
  • 613
  • 67
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 ofExpand
  • 376
  • 62
The impact of DHT routing geometry on resilience and proximity
The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly networks. In thisExpand
  • 672
  • 59
Topologically-aware overlay construction and server selection
A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, theExpand
  • 921
  • 57
Reducing Network Energy Consumption via Sleeping and Rate-Adaptation
We present the design and evaluation of two forms of power management schemes that reduce the energy consumption of networks. The first is based on putting network components to sleep during idleExpand
  • 709
  • 51