Abstract
Users in a cooperative computing environment always have a tendency to free-ride. One can employ incentive mechanisms to prevent such behavior. Some of the cooperative computing scenarios have the same access link shared between upload and download. In such a situation, increasing upload capacity decreases the download capacity and vice-versa. An optimal partitioning of link capacity between upload and download need to be done by each user to maximize its gain (i.e., download) from the network. We model this link capacity partitioning problem as a feedback control system, where feedback (resources received) decides the amount of resources to be uploaded by a user. The resulting algorithm called adaptive step size (ASZ) dynamically adjust the partitioning of link capacity to an optimal value. To compare this approach with others, a metric ‘level of optimality (U)’ is introduced. The U achieved by ASZ is closer to the optimal level than Reputation-Based Resource Allocation Policy (existing scheme), resulting in its better performance. ASZ is also integrated with BitTorrent and simulation results show that it increases the resources received by the users. ASZ can provide an efficient solution to the problem of optimal partitioning in real-life distributed networks due to its distributed implementation, robustness to changes in network dynamics, and compatibility with the existing partitioning schemes.

This publication has 20 references indexed in Scilit: