Abstract
In receiver-driven P2P streaming architectures, a client peer may get resources from one or more server peers. The optimal peer selection problem is to minimize the total streaming cost subject to the bandwidth requirement. However, P2P peers are usually selfish identities who seek to maximize their own benefits. In this paper, we analyze the optimal peer selection problem in a game theoretic approach and use the well-known VCG procedure to schedule the pricing policy. We inspirit the true revelation of server peers' cost value in order to minimize the total streaming cost. Our contributions also include a study of practical implementation of VCG and a discussion of the pricing mechanism in a repeated-game view.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
