Files in this item



application/pdfRandPeer Member ... r to Peer Applications.pdf (186kB)
(no description provided)PDF


Title:RandPeer: Membership Management for QoS Sensitive Peer to Peer Applications
Author(s):Liang, Jin; Nahrstedt, Klara
Subject(s):software engineering
Quality of Service Peer-to-Peer Multimedia
Abstract:Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satis- fying quality of service (QoS). Previous approaches to building such overlays either involve a shared contact point, which results in non-scalable solutions, or rely on gossip style membership dissemination, which lacks QoS awareness. In this paper, we present a distributed membership service called RandPeer, which manages membership information on behalf of P2P applications, and allows peers to locate good neighbors based on their QoS characteristics. Using this service, P2P applica- tions can easily construct their overlays in a scalable and QoS aware fashion. We have implemented RandPeer and experimented in both local and wide area environments. Our results show that (1) RandPeer is scalable and robust to highly dynamic P2P memberships; (2) RandPeer has good lookup performance, both in terms of response time and the randomness of peer selection. The latter improves load balancing and failure resilience of P2P applica- tions; (3) when used to improve the performance of a mesh based P2P overlay, RandPeer achieves 10% im- provement in just 2 protocol rounds, which is more than 5 times faster than pure random neighbor selections.
Issue Date:2005-05
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2005-2576
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-17

This item appears in the following Collection(s)

Item Statistics