Abstract
Unstructured P2P networks, despite having good characteristics such as the nonexistence of a single point of failure, the high levels of anonymity in the search operations and the exemplary dependability, have been found to be much less scalable than first expected. The flooding protocol, which is used for the discovery of peers and for the main operation of searching, seems to be responsible for this weakness. The adoption of some major improvements, such as the distinction between Leaf-nodes and Ultra-Peers, has partially overcome the scalability problems, but there is still a need for further optimization. Our proposed idea, aims to improve the effectiveness of the hierarchical scheme by applying some new criteria in the selection of potentially promotable nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, A.H., Schroeder, A.M.: A Modified Depensation Model of Peer to Peer Networks: Systematic Catastrophes and other potential Weaknesses. AMATH, vol. 383 (June 2002)
The Gnutella v0.4 protocol Specification, http://www.clip2.com
Zeinalipour, D., Folias, T.: A quantitative Analysis of the Gnutella Network [4] Traffic. Dept. of CS & Engineering. University of California, Riverside (June 2002)
Massey, R., Bharath, S., Jain, A.: Gnutella-Pro:What bandwidth barrier?, http://www.cs.ucsd.edu/classes/wi01/cse222/projects/reports/gnutellapro-5.pdf
Schollmeier, R., Schollmeier, I.: Why Peer-to-Peer Does Scale:An analysis of P2P Traffic Patterns. In: Proceedings of 2nd International Conference on Peer-to-Peer Computing P2P 2002, IEEE, Los Alamitos (2002)
Pandurangan, G., Raghavan, P., Upfal, E.: Building Low-Diameter Peer-to-Peer Networks. IEEE Journal on Selected Areas in Communications (JSAC) 21(6), 995–1002 (2003)
Prinkey, M.: An Efficient Scheme for Query Processing on Peer-to-Peer Networks. Aeolus Research Inc., Technical report (August 2002)
Rohrs, C., Singla, A.: Ultrapeers: Another Step Towards Gnutella Scalability (November 2002), http://www.limewire.com/developer/Ultrapeers.html
Miller, E.: Compulsory Licensing - The Death of Gnutella and the Triumph of Google, Yale Law school web site, http://research.yale.edu/lawmeme/
Periorellis, P., et al.: Dealing with Complex Networks of Process Interactions: A Security Measure. In: Proceedings of the 9th IEEE International Conference on Engineering of Complex Computer Systems, Florence, Italy, April 14-16 (2004)
Ritter, J.: Why Gnutella Can’t Scale. No, Really (February 2001), http://www.darkridge.com/jpr5/doc/gnutella.html
Albert, R., Barabasi, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47–97 (2002)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Carre, A.: Graphs and Networks. Clarendon Press, Oxford (1979)
Zeinalipour-Yazti, D., Dikaiakos, M.: Design and Implementation of a Distributed Crawler and Filtering Processor. In: Halevy, A.Y., Gal, A. (eds.) NGITS 2002. LNCS, vol. 2382, pp. 58–74. Springer, Heidelberg (2002)
Moura, A., Lai, Y., Motter, A.: Signatures of small-world and scale-free properties in large computer programs. Physical Review. EÂ 68, 17102 (2003)
Jovanovic, M., Annexstein, F.S., Berman, K.A.: Modeling Peer-to-Peer Network Topologies through Small World Modelsand Power Laws. In: TELFOR, Belgrade, Yugoslavia (November 2001)
Yang, B., Garcia-Molina, H.: Designing a Super-Peer Network. In: Proceedings of the 19th International Conference on Data Engineering (ICDE), Bangalore, India, March 5-8, IEEE Computer Society, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pitsilis, G., Periorellis, P., Marshall, L. (2005). A Policy for Electing Super-Nodes in Unstructured P2P Networks. In: Moro, G., Bergamaschi, S., Aberer, K. (eds) Agents and Peer-to-Peer Computing. AP2PC 2004. Lecture Notes in Computer Science(), vol 3601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11574781_5
Download citation
DOI: https://doi.org/10.1007/11574781_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29755-0
Online ISBN: 978-3-540-31657-2
eBook Packages: Computer ScienceComputer Science (R0)