Self-optimizing Peer-to-Peer Networks with Selfish Processes

Request patterns in peer-to-peer networks are not uniform, and the cost of communication depends on the traffic flows among peers. This paper illustrates how processes in an overlay network can use the information about traffic flow pattern and spontaneously adjust the topology to minimize their communication costs. Four different self-optimization protocols are presented. The selfish protocols allow peers to modify their routing tables to suit their individual needs, and are easy to implement, but the improvements are limited. Compared to this, the altruistic protocols that allow peers to adjust the routing tables based on the needs of other processes, promise a better performance. Since selfish peers may not comply, a penalty mechanism is proposed to discourage selfishness.

[1]  Stefan Schmid,et al.  On the topologies formed by selfish peers , 2006, PODC '06.

[2]  Sukumar Ghosh,et al.  Self-optimizing DHTs Using Request Profiling , 2004, OPODIS.

[3]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[4]  James Aspnes,et al.  Distributed Data Structures for Peer-to-Peer Systems , 2005, Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks.

[5]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[6]  Cheng-Zhong Xu,et al.  Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[7]  Stephan Eidenbenz,et al.  Equilibria in Topology Control Games for Ad Hoc Networks , 2003, DIALM-POMC '03.

[8]  Hector Garcia-Molina,et al.  Adaptive peer-to-peer topologies , 2004 .

[9]  Li Xiao,et al.  Distributed caching and adaptive search in multilayer P2P networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[10]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.