Sciweavers

339 search results - page 10 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
IMC
2006
ACM
14 years 1 months ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...
INFOCOM
2011
IEEE
12 years 11 months ago
Hidden communication in P2P networks Steganographic handshake and broadcast
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
Raphael Eidenbenz, Thomas Locher, Roger Wattenhofe...
ICPP
2009
IEEE
13 years 5 months ago
Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopte...
Lluis Pamies-Juarez, Pedro García Ló...
ICNP
2002
IEEE
14 years 13 days ago
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
IPPS
2007
IEEE
14 years 1 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...