Sciweavers

346 search results - page 43 / 70
» Routing networks for distributed hash tables
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
NSDI
2004
13 years 9 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
MOBILITY
2009
ACM
14 years 2 months ago
Feasibility evaluation of a communication-oriented P2P system in mobile environments
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
Zhonghong Ou, Erkki Harjula, Otso Kassinen, Mika Y...
JAIR
1998
195views more  JAIR 1998»
13 years 7 months ago
AntNet: Distributed Stigmergetic Control for Communications Networks
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo syst...
Gianni Di Caro, Marco Dorigo
ANCS
2007
ACM
13 years 11 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan