Sciweavers

118 search results - page 9 / 24
» Performance of random walks in one-hop replication networks
Sort
View
BERTINORO
2005
Springer
14 years 2 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
IMC
2010
ACM
13 years 6 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
INFOCOM
2006
IEEE
14 years 2 months ago
Impact of Mobility on the Performance of Relaying in Ad Hoc Networks
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
IPPS
2007
IEEE
14 years 2 months ago
Effects of Replica Placement Algorithms on Performance of structured Overlay Networks
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
HOTOS
2003
IEEE
14 years 1 months ago
Secure Data Replication over Untrusted Hosts
Data replication is a widely used technique for achieving fault tolerance and improved performance. With the advent of content delivery networks, it is becoming more and more freq...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...