An Incentive Based Routing Algorithm for Improving Message Forwarding in Structured Peer-to-Peer Networks
Shuai Zhou, G. Rogers, M. Hogan, Sébastien Ardon, Tianrui Hu, Aruna Prasad Seneviratne · 2007
Much of existing research work in peer-to-peer networks is focused on architecture and protocols. All make assumptions that nodes in the network will operate for the common good without any self- interests. However, most nodes in peer-to-peer networks act selfishly in the reality, which makes the "doing-the-common-good" assumption invalid. One of the major challenges in peer-to-peer networks is how to manage self-interest to encourage nodes to follow the designed protocols. In this paper, we propose an incentive based routing algorithm for improving message forwarding in structured peer-to-peer networks. Using a parameter, called Participation Willingness (PW), we are able to introduce incentives for all network nodes. Furthermore, we apply the PW value to the routing algorithm of Chord and perform a simulation study. Simulation results showed that the proposed algorithm provides performance improvement over the original Chord routing algorithm.