Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: Ranking-based Optimal Resource Allocation in
Peer-to-Peer Networks
Yonghe Yan, Adel El-Atawy, Ehab Al-Shaer
School of Computer Science, Telecommunication and Information Systems
DePaul University
Chicago, IL 60604, USA
Abstract--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

  

Source: Al-Shaer, Ehab - School of Computer Science, Telecommunications and Information Systems, DePaul University

 

Collections: Computer Technologies and Information Sciences