Paper Info
Title
Polling-Based P2P File Sharing with High Success Rate and Low Communication Cost
Abstract
This paper proposes a polling-based consistency maintenance scheme for the Peer-to-Peer (P2P) file sharing of editable contents. The proposed scheme achieves a high success rate of the acquisition of the latest copy of shared files with low communication cost. In the following we first show that when several peers acquire a copy of shared files from the same replica peer, the minimum success rate is achieved by the peer with the maximum query rate regardless of the polling and the update intervals. We then design a distributed algorithm to maintain the correspondence between client and replica peers to minimize the average polling rate while keeping the average success rate to a designated value. The performance of the proposed algorithm is evaluated by simulation.
Year
DOI
Venue
2016
10.1109/CANDAR.2016.0060
2016 Fourth International Symposium on Computing and Networking (CANDAR)
Keywords
Field
DocType
P2P file sharing,editable contents,polling-based consistency maintenance
Replica,Computer science,Peer to peer computing,Computer network,Polling,Distributed algorithm,File sharing,Maintenance engineering,Distributed computing
Conference
ISSN
ISBN
Citations 
2379-1888
978-1-5090-2656-2
0
PageRank 
References 
Authors
0.34
8
2
Name
Order
Citations
PageRank
Kouhei Ootani100.34
Satoshi Fujita24618.99