Sciweavers

133 search results - page 17 / 27
» A k-anonymous communication protocol for overlay networks
Sort
View
PODC
2004
ACM
14 years 28 days ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
WWIC
2004
Springer
138views Communications» more  WWIC 2004»
14 years 25 days ago
Connecting Wireless Sensornets with TCP/IP Networks
Wireless sensor networks are based on the collaborative efforts of many small wireless sensor nodes, which collectively are able to form networks through which sensor information c...
Adam Dunkels, Juan Alonso, Thiemo Voigt, Hartmut R...
CNSR
2005
IEEE
14 years 1 months ago
Shortest-Hop Based Reliable Network Multicast
Although many multicast communication protocols have been recommended at IETF, reliable multicast communications currently rely on programs built at the application layer, e.g., m...
Ka Lun Eddie Law, Daniel Siu
ICALP
2004
Springer
14 years 27 days ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler
22
Voted
P2P
2006
IEEE
120views Communications» more  P2P 2006»
14 years 1 months ago
Risk Driven Semantic P2P Service Retrieval
In this paper, we present a novel approach, named RS2D, to risk driven semantic service query routing in unstructured, so called pure P2P networks. Following the RS2D protocol, ea...
Matthias Klusch, Ulrich Basters