Loading...
Please wait, while we are loading the content...
Similar Documents
A proximity-aware load balancing in peer-to-peer based volunteer computing systems.
| Content Provider | CiteSeerX |
|---|---|
| Author | Ghafarian, Toktam Deldari, Hossein Javadi, Bahman Buyya, Rajkumar |
| Abstract | 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. Two dispatching strategies are proposed for the load balancing based on stochastic analysis of routing in the distributed parallel queues. These policies adopt probabilistic and deterministic sequences to redirect requests to the capable peers in the system. Simulation results show that the proposed resource discovery algorithm improves the response time of user’s requests by a factor of 1.8 under a moderate load. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Proximity-aware Load Balancing Volunteer Computing System Resource Discovery Algorithm Distributed Parallel Queue First Phase Moderate Load Capable Peer Distributed Manner Load Balancing Qos Constraint Main Challenge Load-balanced Manner Overall Response Time Response Time Proximity-aware Feature Second Phase Efficient Resource Discovery Algorithm Stochastic Analysis Simulation Result Average Response Time Analytical Model User Request Minimum Communication Overhead Deterministic Sequence |
| Content Type | Text |
| Resource Type | Article |