A Reputation-Based Network Bandwidth Allocation Mechanism
Xinkao Liao, Lisheng Wang
Abstract
Xinkao Liao, Lisheng Wang
Abstract
No fair bandwidth allocation will damage the interests of the contribution node and cause its income not matching its contribution. That will damage the fairness of bandwidth allocation. In this paper, we research the problem of bandwidth allocation in a network swarm and proposed a reputation-based bandwidth resource allocation algorithm with punishment incentives. Finally, the experimental result shows that the algorithm can efficiently inhibit the free-rider. It can also improve bandwidth allocation fairness and the enthusiasm of the contribution node.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
No fair bandwidth allocation will damage the interests of the contribution node and cause its income not matching its contribution. That will damage the fairness of bandwidth allocation. In this paper, we research the problem of bandwidth allocation in a network swarm and proposed a reputation-based bandwidth resource allocation algorithm with punishment incentives. Finally, the experimental result shows that the algorithm can efficiently inhibit the free-rider. It can also improve bandwidth allocation fairness and the enthusiasm of the contribution node.
Key concepts: Bandwidth allocation, Dynamic bandwidth allocation, Bandwidth (computing), Computer science, Reputation, Incentive, Computer network, Resource allocation