Altruistic Routing in Structured P2P Networks
Request patterns in P2P networks are not uniform, and the cost of communication depends on the traffic flows among peers. This paper illustrates how the processes in an overlay network can use the information about traffic flow pattern to modify their routing tables and minimize their communication costs. Two different adaptation strategies: selfish and altruistic are described and analyzed. The selfish protocol modifies the routing tables to suit each process individual needs, and is easy to implement, but the improvements are limited. Compared to this, the altruistic protocol that adjusts routing tables based on the needs of other processes, promises a much better performance.