2017/02/26 by Sateesh Kumar Awasthi, Awasthi, Sateesh Kumar, Yatindra Nath Singh +1
Computer Science · #Caching and Content Delivery #Distributed and Parallel Computing Systems #Distributed systems and fault tolerance #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Peer-to-Peer Network Technologies
paper · pdf · doi:10.48550/arxiv.1702.07992
openalex publication_date 2017/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
To balance the load and to discourage the free-riding in peer-to-peer (P2P)\nnetworks, many incentive mechanisms and policies have been proposed in recent\nyears. Global peer ranking is one such mechanism. In this mechanism, peers are\nranked based on a metric called contribution index. Contribution index is\ndefined in such a manner that peers are motivated to share the resources in the\nnetwork. Fairness in the terms of upload to download ratio in each peer can be\nachieved by this method. However, calculation of contribution index is not\ntrivial. It is computed distributively and iteratively in the entire network\nand requires strict clock synchronization among the peers. A very small error\nin clock synchronization may lead to wrong results. Furthermore, iterative\ncalculation requires a lot of message overhead and storage capacity, which\nmakes its implementation more complex. In this paper, we are proposing a simple\nincentive mechanism based on the contributions of peers, which can balance the\nupload and download amount of resources in each peer. It does not require\niterative calculation, therefore, can be implemented with lesser message\noverhead and storage capacity without requiring strict clock synchronization.\nThis approach is efficient as there are very less rejections among the\ncooperative peers. It can be implemented in a truly distributed fashion with\nO(N) time complexity per peer.\n