Ranking-Based Optimal Resource Allocation in Peer-to-Peer Networks
Ranking-Based Optimal Resource Allocation in Peer-to-Peer Networks
复制标题
DOI：
10.1109/infcom.2007.132
复制
发表时间：
2007-05
期刊：
影响因子：
--
通讯作者：
Yonghe Yan;A. El-Atawy;E. Al-Shaer
中科院分区：
文献类型：
--
作者：
Yonghe Yan;A. El-Atawy;E. Al-Shaer
提出了一种点对点网络资源最优分配和准入控制的理论框架。将Peer的行为排名纳入资源分配和准入控制，提供差异化服务，甚至屏蔽排名较差的Peer。这些对等体可能是搭便车者或可疑的攻击者。一个对等体通过向P2P系统贡献资源来提高自己的排名，或者通过消耗服务来降低自己的排名。因此，基于排名的资源分配为对等体向P2P系统贡献资源提供了必要的激励。我们定义了一个实用函数，它捕获了源对等体为竞争对等体提供服务的最佳愿望，这些竞争对等体向源对等体请求服务。虽然效用函数是凸函数，但设计了哈尔萨尼型社会福利函数，以获得唯一的实现最大最小公平的最优资源配置。我们的模型中使用的参数可以从服务的性质中派生出来，也可以由源对等体选择。不需要从单个对等体泄露任何私人信息。这可以防止自私的对等体为了自己的利益而策略性地玩弄系统，欺骗资源分配机制。资源分配和准入控制是完全分布式和线性可扩展的。
This paper presents a theoretic framework of optimal resource allocation and admission control for peer-to-peer 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 max-min fairness. The parameters used in our model can be derived from the nature of the services or chosen by the source peer. No private information is required to reveal from individual peers. This prevents selfish peers to play the system strategically and cheat the resource allocation mechanism for their own benefits. The resource allocation and admission control are fully distributed and linearly scalable.