Sciweavers

456 search results - page 75 / 92
» On Routing in Distributed Hash Tables
Sort
View
SIGCOMM
1999
ACM
15 years 4 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
ICDCS
2007
IEEE
15 years 6 months ago
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
Zhenhui Shen, Srikanta Tirthapura
ICDCSW
2006
IEEE
15 years 5 months ago
Network-Aware Overlays with Network Coordinates
Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates...
Peter R. Pietzuch, Jonathan Ledlie, Michael Mitzen...
GIS
2005
ACM
16 years 25 days ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 11 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth