239 search results - page 4 / 48 » Random walks in a supply network |
TC
2008
13 years 7 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
— 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...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
EWSN
2010
Springer
14 years 4 months ago
2010
Springer
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
TOCS
2008
13 years 7 months ago
2008
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...