Sciweavers

456 search results - page 39 / 92
» On Routing in Distributed Hash Tables
Sort
View
SIGCOMM
2009
ACM
14 years 5 months ago
Hash, don't cache: fast packet forwarding for enterprise edge routers
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
Minlan Yu, Jennifer Rexford
ICPADS
2005
IEEE
14 years 4 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
IC
2009
13 years 8 months ago
Efficient Distributed Search for Multicast Session Keywords
mDNS is a proposed DNS-aware, hierarchical, and scalable multicast session directory architecture that enables multicast session registration and makes them discoverable in real ti...
Piyush Harsh, Richard Newman
SASO
2008
IEEE
14 years 5 months ago
Using Global Information for Load Balancing in DHTs
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...
Mikael Högqvist, Seif Haridi, Nico Kruber, Al...
SIGCOMM
2005
ACM
14 years 4 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...