A Proximity-Aware Load Balancing in Peer-to-Peer Based Volunteer Computing Systems
Source: University of Western Ontario
One of the main challenges in peer-to-peer based volunteer computing systems is efficient resource discovery algorithm. Load balancing is a part of resource discovery algorithm and aims to minimize the overall response time of the system. This paper introduces an analytical model based on distributed parallel queues to optimize the average response time of the system in a distributed manner. The proposed resource discovery algorithm consists of two phases. In the first phase, it selects peers in a load-balanced manner based on QoS constraints of request. In the second phase, a proximity-aware feature is applied to select the peer with minimum communication overhead among selected peers in the first phase.