Sciweavers

162 search results - page 5 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
TPDS
2008
199views more  TPDS 2008»
13 years 7 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
INFOCOM
2012
IEEE
11 years 9 months ago
Network optimization for DHT-based applications
—P2P platforms have been criticized because of the heavy strain that some P2P services can inflict on costly interdomain links of network operators. It is therefore necessary to...
Yi Sun, Yang Richard Yang, Xiaobing Zhang, Yang Gu...
INFOCOM
2008
IEEE
14 years 1 months ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li
CONCURRENCY
2008
71views more  CONCURRENCY 2008»
13 years 7 months ago
Gossip-based search selection in hybrid peer-to-peer networks
We present GAB, a search algorithm for hybrid P2P networks, that is, networks that search using both flooding and a DHT. GAB uses a gossip-style algorithm to collect global statis...
M. Zaharia, S. Keshav
DAGSTUHL
2006
13 years 8 months ago
On the Topologies Formed by Selfish Peers
Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not contributing any resources to the network. Various mechanisms have been designed to overcom...
Stefan Schmid, Thomas Moscibroda, Roger Wattenhofe...