Title: Peers-for-peers (P4P): an efficient and reliable fault-tolerance strategy for cycle-stealing P2P applications

Authors: Ankur Gupta, Lalit K. Awasthi

Addresses: Department of Computer Science and Engineering, Model Institute of Engineering and Technology, B.C. Road, Jammu, J-K, 180001, India. ' Department of Computer Science and Engineering, National Institute of Technology, Hamirpur, Himachal Pradesh, 177005, India

Abstract: Cycle-stealing P2P applications need to contend with a transient node population, which requires specialised approaches to be formulated to achieve fault-tolerance. This research paper proposes the peers-for-peers (P4P), an efficient and reliable strategy, based on selecting suitable peers to provide fault-tolerance for P2P applications by redundantly storing check-pointing or message logging data, ensuring its survivability. The strategy is suitable for cycle-stealing P2P applications and is optimised to reduce the message exchange overheads compared to other existing approaches, while alleviating the need to retrieve/reconstruct check-pointing data thereby improving application performance. Simulation results establish the effectiveness of the strategy in choosing quality nodes which meet the application computing requirements and ensuring survivability of check-pointing data in the face of heavy node transience. A real-world implementation based on the JXTA framework establishes its applicability to cycle-stealing P2P applications.

Keywords: peer-to-peer; fault-tolerance; cycle-stealing P2P applications; peers-for-peers; P4P; simulation.

DOI: 10.1504/IJCNDS.2011.038525

International Journal of Communication Networks and Distributed Systems, 2011 Vol.6 No.2, pp.202 - 228

Received: 31 Aug 2009
Accepted: 20 Apr 2010
Published online: 26 Feb 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article