Adaptive Capacity Partitioning in Cooperative Computing to Maximize Received Resources
Open Access
- 3 July 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 3551-3565
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.Keywords
This publication has 20 references indexed in Scilit:
- Cooperative Computing for Autonomous Data Centers2015
- Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip AlgorithmIEEE Transactions on Knowledge and Data Engineering, 2015
- Finding your Way in the FogACM SIGCOMM Computer Communication Review, 2014
- Reputation-Assisted Utility Maximization Algorithmsfor Peer-to-Peer Networks2008
- Reciprocal resource sharing in P2P environments2005
- Overcoming free-riding behavior in peer-to-peer systemsACM SIGecom Exchanges, 2005
- The Eigentrust algorithm for reputation management in P2P networks2003
- Performance guarantees for Web server end-systems: a control-theoretical approachIEEE Transactions on Parallel and Distributed Systems, 2002
- CDMA/TDD system for wireless multimedia services with traffic unbalance between uplink and downlinkIEEE Journal on Selected Areas in Communications, 1999
- Tuning of PID controllers based on gain and phase margin specificationsAutomatica, 1995