Sciweavers

39 search results - page 8 / 8
» Constructing Optimal IP Routing Tables
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
P2P
2003
IEEE
108views Communications» more  P2P 2003»
13 years 9 months ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
SIGCOMM
2009
ACM
13 years 10 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
SPAA
2003
ACM
13 years 9 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder