346 search results - page 45 / 70 » Routing networks for distributed hash tables |
SERSCISA
2009
Springer
14 years 2 months ago
2009
Springer
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...