118 search results - page 14 / 24 » Performance of random walks in one-hop replication networks |
ANSS
2004
IEEE
14 years 6 days ago
2004
IEEE
We quantatively analyze the differences between a realistic mobility model, TRANSIMS, and several synthetic mobility models. New synthetic models were created by modifying the sta...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
WOSP
2005
ACM
14 years 2 months ago
2005
ACM
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
COMSWARE
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...