Full text
Publisher SiteSource
IEEE Transactions on Parallel and Distributed Systems
archiveVolume 16 , Issue 11 (November 2005)
table of contentsPages: 1078 - 1091
Year of Publication: 2005
ISSN:1045-9219
Authors
Zhenyun ZhuangMembers
Li Xiao IEEE
Yunhao Liu IEEE
Publisher
IEEE Press Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1
Additional Information:
abstract references cited by index terms review collaborative colleagues Tools and Actions:
Review this Article Save this Article to a Binder Display Formats:
BibTex EndNote ACM Ref DOI Bookmark:
10.1109/TPDS.2005.137ABSTRACTSuperpeer unstructured P2P systems have been found to be very effective by dividing the peers into two layers, superlayer and leaf-layer, in which message flooding is only conducted among superlayer and all leaf-peers are represented by corresponding superpeers. However, current superpeer systems do not employ any effective layer management schemes, so the transient and low-capacity peers are allowed to act as superpeers. Moreover, the lack of an appropriate size ratio maintenance mechanism on superlayer to leaf-layer makes the system's search performance far from being optimal. We present one workload model aimed at reducing the weighted overhead of a network. Using our proposed workload model, a network can determine an optimal layer size ratio between leaf-layer and superlayer. We then propose a Dynamic Layer Management algorithm, DLM, which can maintain an optimal layer size ratio and adaptively elect and adjust peers between superlayer and leaf-layer. DLM is completely distributed in the sense that each peer decides to be a superpeer or a leaf-peer independently without global knowledge. DLM could effectively help a superpeer P2P system maintain the optimal layer size ratio and designate peers with relatively long lifetime and large capacities as superpeers, and the peers with short lifetime and low capacities as leaf-peers under highly dynamic network situations. We demonstrate that the quality of a superpeer system is significantly improved under the DLM scheme by comprehensive simulations.
REFERENCESNote: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
1
“The Gnutella Protocol Specification 0.6,” http://rfc-gnutella. sourceforge.net, 2002.
2
“Regional Characteristics of P2P,” http://www.sandvine.com, 2003.
3
P. Backx T. Wauters B. Dhoedt and P. Demeester, “A Comparison of Peer-to-Peer Architectures,”
Proc. Eurescom Summit, 2002.
4
F.E. Bustamante and Y. Qiao, “Friendships that Last: Peer Lifespan and Its Role in P2P Protocols,”
Proc. Int'l Workshop Web Content Caching and Distribution, 2003.
5
B.F. Cooper and H. Garcia-Molina, “SIL: Modeling and Measuring Scalable Peer-to-Peer Search Networks,”
Proc. Int'l Workshop Databases, Information Systems, and Peer-to-Peer Computing, 2003.
6
Neil Daswani , Hector Garcia-Molina , Beverly Yang, Open Problems in Data-Sharing Peer-to-Peer Systems, Proceedings of the 9th International Conference on Database Theory, p.1-15, January 08-10, 2003 7
Z. Ge D.R. Figueiredo S. Jaiswal J. Kurose and D. Towsley, “Modeling Peer-Peer File Sharing Systems,”
Proc. IEEE INFOCOM, 2003.
8
Gnutella, http://gnutella.wego.com/, 2003.
9
Krishna P. Gummadi , Richard J. Dunn , Stefan Saroiu , Steven D. Gribble , Henry M. Levy , John Zahorjan, Measurement, modeling, and analysis of a peer-to-peer file-sharing workload, Proceedings of the nineteenth ACM symposium on Operating systems principles, October 19-22, 2003, Bolton Landing, NY, USA 10
Hung-Chang Hsiao , Chung-Ta King, A Tree Model for Structured Peer-to-Peer Protocols, Proceedings of the 3st International Symposium on Cluster Computing and the Grid, p.336, May 12-15, 2003 11
N. Leibowitz A. Bergman R. Ben-Shaul and A. Shavit, “Are File Swapping Networks Cacheable? Characterizing P2P Traffic,”
Proc. Seventh Int'l WWW Caching Workshop, Aug. 2002.
12
J. Liang R. Kumar and K.W. Ross, “Understanding KaZaA,” http://cis.poly.edu/~ross/papers/UnderstandingKaZaA.pdf, 2004.
13
Qin Lv , Pei Cao , Edith Cohen , Kai Li , Scott Shenker, Search and replication in unstructured peer-to-peer networks, Proceedings of the 16th international conference on Supercomputing, June 22-26, 2002, New York, New York, USA [doi>
10.1145/514191.514206]
14
Daniel A. Menascé , Lavanya Kanchanapalli, Probabilistic scalable P2P resource location services, ACM SIGMETRICS Performance Evaluation Review, v.30 n.2, September 2002 [doi>
10.1145/588160.588167]
15
Morpheus, http://www.morpheus.com/, 2004.
16
Mutella, http://mutella.sourceforge.net/, 2003.
17
Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Schenker, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States 18
Antony I. T. Rowstron , Peter Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, p.329-350, November 12-16, 2001 19
S. Saroiu P. Gummadi and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,”
Proc. Multimedia Computing and Networking, 2002.
20
Subhabrata Sen , Jia Wang, Analyzing peer-to-peer traffic across large networks, Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, November 06-08, 2002, Marseille, France [doi>
10.1145/637201.637222]
21
S. Singh S. Ramabhadran F. Baboescu and A.C. Snoeren, “The Case for Service Provider Deployment of Super-Peers in Peer-to-Peer Networks,”
Proc. Workshop Economics of Peer-to-Peer Systems, 2003.
22
A. Singla and C. Rohrs, “Ultrapeers: Another Step towards Gnutella Scalability,” Version 1.0.26, http://rfc-gnutella. sourceforge.net/src/Ultrapeers_1.0.html, Nov. 2002.
23
Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States 24
J. Xu A. Kumar and X. Yu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks,”
Proc. IEEE INFOCOM, 2003.
25
Beverly Yang , Hector Garcia-Molina, Improving Search in Peer-to-Peer Networks, Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02), p.5, July 02-05, 2002 26
B. Yang and H. Garcia-Molina, “Designing a Super-Peer Network,”
Proc. 19th Int'l Conf. Data Eng., Mar. 2003.
27
B.Y. Zhao L. Huang J. Stribling S.C. Rhea A.D. Joseph and J. Kubiatowicz, “Tapestry: A Resilient Global-scale Overlay for Service Deployment,”
IEEE J. Selected Areas in Comm., 2003.
CITED BYJinpeng Huai , Tianyu Wo , Yunhao Liu, Resource management and organization in CROWN grid, Proceedings of the 1st international conference on Scalable information systems, p.10-es, May 30-June 01, 2006, Hong Kong INDEX TERMSPrimary Classification: C.
Computer Systems Organization C.2
COMPUTER-COMMUNICATION NETWORKS C.2.4
Distributed SystemsAdditional Classification: C.
Computer Systems Organization C.2
COMPUTER-COMMUNICATION NETWORKS C.2.3
Network Operations Subjects:
Network management H.
Information Systems H.5
INFORMATION INTERFACES AND PRESENTATION (I.7) H.5.3
Group and Organization Interfaces Subjects:
Web-based interactionGeneral Terms: Design,
Experimentation,
Management,
Measurement,
PerformanceKeywords: Unstructured peer-to-peer,
superpeer architecture,
layer management,
workload analysis,
adaptive algorithms.REVIEW "Cui-Qing Yang : Reviewer"With the growing popularity of peer-to-peer (P2P) applications, such as Gnutella and KaZaA (FastTrack), traffic based on this activity is becoming the dominant traffic on the Internet. The original P2P networking protocol (Gnutella) is a true dist
more... 