Identification of efficient peers in P2P computing system for real time applications

TL;DR

This paper proposes an algorithm to identify reliable peers in P2P systems for real-time applications by evaluating availability, credibility, computation time, and turnaround time to ensure predictable performance.

Contribution

It introduces a novel algorithm that jointly evaluates multiple peer properties to select efficient peers for real-time P2P computing tasks.

Findings

The algorithm effectively identifies reliable peers for real-time tasks.

It improves the predictability of performance in P2P systems.

The method includes a new way to calculate turnaround time at the application level.

Abstract

Currently the Peer to Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real time applications. Strict deadline of scientific and real time applications require predictable performance in such applications. We propose an algorithm to identify the group of reliable peers, from the available peers on the Internet, for the processing of real time applications tasks. The algorithm is based on joint evaluation of peer properties like peer availability, credibility, computation time and the turnaround time of the peer with respect to the task distributor peer. Here we also define a method to calculate turnaround time on task distributor peers at application level.