An Optimized Time-constraint Job Distribution Scheme in Group based P2P Networks

Peer-to-peer (P2P) technology benefits from a tractable and flexible job distribution scheme. However due to the dynamic nature of P2P, the optimal decision point of job scheduling is still unpredictable and some DLT-like heuristics are not sufficient to be a promising candidate for this role. As a reason of that, in this paper we have proposed the optimized time-constraint job distribution scheme in group based P2P networks. This scheme supports the hybrid type of jobs according to divisibility property. Also, it provides the methodology (3 phase-algorithms) which guarantees efficient job distribution under the condition of minimum completion time of executing jobs. Through the simulation in the aspects of balancing and minimum completion time, we will discuss about its performance evaluation.