Ranking-Based Optimal Resource Allocation in Peer-to-Peer Networks

—This paper presents a theoretic framework of optimal resource allocation and admission control for peer-topeer networks. Peer’s behavioral rankings are incorporated into the resource allocation and admission control to provide differentiated services and even to block peers with bad rankings. These peers may be free-riders or suspicious attackers. A peer improves her ranking by contributing resources to the P2P system or deteriorates her ranking by consuming services. Therefore, the ranking-based resource allocation provides necessary incentives for peers to contribute their resources to the P2P systems. We define a utility function which captures the best wish for the source peer to serve competing peers, who request services from the source peer. Although the utility function is convex, Harsanyi-type social welfare functions are devised to obtain a unique optimal resource allocation that achieves maxmin fairness. The parameters used in our model can be derived from the nature of...

• Type: Conference
• Year: 2007
• Where: INFOCOM
• Authors: Yonghe Yan, Adel El-Atawy, Ehab Al-Shaer
• Keywords: Admission Control, Communications, INFOCOM 2007, Optimal Resource Allocation, Resource Allocation