Abstract
The concept of superpeer has been introduced to improve the performance of popular P2P applications. A superpeer is a “powerful” node that acts as a server for a set of clients, and as an equal with respect to other superpeers. By exploiting heterogeneity, the superpeer paradigm can lead to improved efficiency, without compromising the decentralized nature of P2P networks. The main issues in the construction of superpeer-based overlays are the selection of superpeers, and the association between superpeers and clients. Generally, superpeers are either run voluntarily (without an explicit selection process), or chosen among the “best” nodes in the network, for example those with the most abondant resources, such as bandwidth or storage. In several contexts, however, shared resources are not the only factor; latency between clients and superpeers may play an important role, for example in online games. This paper presents SG-2, a novel protocol for building and maintaining a proximity-aware superpeer topology. SG-2 uses a gossip-based protocol to spread messages to nearby nodes and a biology-inspired task allocation mechanism to promote the “best” nodes to superpeer status. The paper includes extensive simulation experiments to prove the efficiency, scalability and robustness of SG-2.
This work was partially supported by the FET unit of the European Commission through projects bison(IST-38923), delis (IST-01907) and cascadas (IST-27807).
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.
Similar content being viewed by others
References
Adler, M., Kumar, R., Ross, K.W., Rubenstein, D., Suel, T., Yao, D.D.: Optimal peer selection for p2p downloading and streaming. In: Proceedings of IEEE Infocom, Miami, FL (March 2005)
Baset, S., Schulzrinne, H.: An analysis of the skype peer-to-peer internet telephony protocol. Technical Report CUCS-039-04, Columbia University, Department of Computer Science, New York, NY (September 2004)
Bettner, P., Terrano, M.: 1500 Archers on a 28.8: Network Programming in Age Of Empires and Beyond. In: Proc. of the GDC 2001 (March 2001)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems. Oxford University Press, Inc., New York (1999)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in distributed hash tables. In: Babaoglu, O., Birman, K., Marzullo, K. (eds.) International Workshop on Future Directions in Distributed Computing (FuDiCo), pp. 52–55 (June 2002)
Costa, M., Castro, M., Rowstron, A., Key, P.: Pic: Practical internet coordinates for distance estimation. In: Proc. of ICDCS 2004 (2004)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: Proc. of the SIGCOMM 2004, Portland, Oregon (August 2004)
Eugster, P., Guerraoui, R., Handurukande, S.B., Kermarrec, A.-M., Massoulié, L.: Lightweight probabilistic broadcast. ACM Transactions on Computer Systems 21(4), 341–374 (2003)
Fasttrack Home Page, http://www.fasttrack.nu
Francis, P., Jamin, S., Jin, C., Jin, Y., Paxson, V., Raz, D., Shavitt, Y., Zhang, L.: IDMaps: a global internet host distance estimation service. In: Proc. of IEEE Infocom 1999 (1999)
Gautier, L., Diot, C.: MiMaze, a Multiuser Game on the Internet (1997), http://citeseer.ist.psu.edu/gautier97mimaze.html
Gnutella web site, http://gnutella.wego.com
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)
Jelasity, M., Kowalczyk, W., van Steen, M.: Newscast computing. Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (November 2003)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(1), 219–252 (2005)
Lehman, L., Lerman, S.: Pcoord: network position estimation using peer-to-peer measurements. In: Proc. of the 3rd IEEE International Symposium on Network Computing and Applications (NCA 2004) (2004)
Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the kazaa network (2003)
Montresor, A.: A Robust Protocol for Building Superpeer Overlay Topologies. In: Proc. of the 4th Int. Conf. on Peer-to-Peer Computing, Zurich, Switzerland. IEEE, Los Alamitos (to appear, 2004)
Ng, T., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proc. of IEEE Infocom (2002)
Peercast P2P Radio, http://www.peercast.org
Peersim Peer-to-Peer Simulator, http://peersim.sf.net
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Sheldon, N., Girard, E., Borg, S., Claypool, M., Agu, E.: The effect of latency on user performance in Warcraft 3. In: Proc. of the 2nd Workshop on Network and System Support for Games, pp. 3–14. ACM Press, New York (2003)
Singh, A., Haahr, M.: Creating an adaptive network of hubs using schelling’s model. Commun. ACM 49(3), 69–73 (2006)
Skype: Free internet telephony that just works, http://www.skype.com
Unreal networking protocol notes by tim sweeney, http://unreal.epicgames.com/Network.htm
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: IEEE International Conference on Data Engineering (2003), http://bpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2003-33&for%mat=pdf&compression=
Zanikolas, S., Sakellariou, R.: Towards a monitoring framework for worldwide grid information services. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 417–422. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jesi, G.P., Montresor, A., Babaoglu, O. (2006). Proximity-Aware Superpeer Overlay Topologies. In: Keller, A., Martin-Flatin, JP. (eds) Self-Managed Networks, Systems, and Services. SelfMan 2006. Lecture Notes in Computer Science, vol 3996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767886_4
Download citation
DOI: https://doi.org/10.1007/11767886_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34739-2
Online ISBN: 978-3-540-34740-8
eBook Packages: Computer ScienceComputer Science (R0)