Sciweavers

118 search results - page 1 / 24
» Performance of random walks in one-hop replication networks
Sort
View
ICDCSW
2008
IEEE
13 years 11 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
CN
2010
51views more  CN 2010»
13 years 4 months ago
Performance of random walks in one-hop replication networks
Luis Rodero-Merino, Antonio Fernández Anta,...
INFOCOM
2005
IEEE
13 years 10 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
13 years 4 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
ADHOCNOW
2010
Springer
13 years 6 months ago
Coverage-Adaptive Random Walks for Fast Sensory Data Collection
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...