Sciweavers

162 search results - page 1 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
INFOCOM
2009
IEEE
13 years 11 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
TON
2008
106views more  TON 2008»
13 years 4 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
LCN
2006
IEEE
13 years 10 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
CN
2006
113views more  CN 2006»
13 years 4 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
IPPS
2008
IEEE
13 years 11 months ago
An effective pointer replication algorithm in P2P networks
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
Jian Zhou, Laxmi N. Bhuyan, Anirban Banerjee