Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Hybrid Checkpoint Protocol in Wireless LAN Environment
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
G2-P2P: a fully decentralised fault-tolerant cycle-stealing framework
ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
Context Aware Session Management for Services in Ad Hoc Networks
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
Coordination & Enterprise Wide P2P Computing
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 02
Peer-to-peer checkpointing arrangement for mobile grid computing systems
Proceedings of the 16th international symposium on High performance distributed computing
Peer enterprises: possibilities, challenges and some ideas towards their realization
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
An approach to fault tolerance in the cloud using the checkpointing technique
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
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.