Abstract
Peer-to-peer (P2P) technology has undergone rapid growth, producing new protocols and applications, many of which enjoy considerable commercial success and academic interest. Yet, P2P applications are often based on complex protocols, whose behavior is not completely understood. We believe that in order to enable an even more widespread adoption of P2P systems in commercial and scientific applications, what is needed is a modular paradigm in which well-understood, predictable components with clean interfaces can be combined to implement arbitrarily complex functions. The goal of this paper is to promote this idea by describing our initial experiences in this direction. Our recent work has resulted in a collection of simple and robust components, which include aggregation and membership management. This paper shows how to combine them to obtain a novel load-balancing algorithm that is close to optimal with respect to load transfer. We also describe briefly our simulation environment, explicitly designed to efficiently support our modular approach to P2P protocol design.
This work was partially supported by the Future & Emerging Technologies unit of the European Commission through Project BISON (IST-2001-38923).
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
Barak, A., Shiloh, A.: A Distributed Load Balancing Policy for a Multicomputer. Software Practice and Experience 15(9), 901–913 (1985)
Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a Common API for Structured Peer-to-Peer Overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Management. In: Proc. of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC 1987), Vancouver, August 1987, pp. 1–12. ACM Press, New York (1987)
Druschel, P., Rowstron, A.: PAST: A Persistent Anonymous Store. In: HotOS VIII (May 2001)
Foster, A., Iamnitchi, A.: On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Jelasity, M., Kowalczyk, W., van Steen, M.: Newscast Computing (submitted for publication)
Jelasity, M., Montresor, A.: Epidemic-Style Proactive Aggregation in Large Overlay Networks (2004) (to appear)
Joseph, S.: An Extendible Open-Source Simulator. P2P Journal (November 2003)
Kok, P., Loh, K., Hsu, W.J., Wentong, C., Sriskanthan, N.: How Network Topology Affects Dynamic Load Balancing. IEEE Parallel & Distributed Technology 4(3) (September 1996)
Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing. Technical Report HPL-2002-57, HP Labs, Palo Alto (2002)
Network Simulator 2, http://www.isi.edu/nsnam/ns/
Peterson, L., Anderson, T., Culler, D., Roscoe, T.: A Blueprint for Introducing Disruptive Technology into the Internet. In: Proc. of the First ACM Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ (October 2002)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load Balancing in Structured P2P Systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Rowstron, A., Kermarrec, A.-M., Castro, M., Druschel, P.: Scribe: The Design of a Large-scale Event Notification Infrastructure. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, pp. 30–43. Springer, Heidelberg (2001)
Schlosser, M., Kamvar, S.: Simulating a file-sharing p2p network. In: Proc. of the First Workshop on Semantics in P2P and Grid Computing (2002)
Ting, N.S., Deters, R.: A P2P Network Simulator. In: Proc. of the 3rd IEEE International Conference on Peer-to-Peer Computing (P2P 2003), Linkoping, Sweden (September 2003)
van Renesse, R.: The Importance of Aggregation. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 87–92. Springer, Heidelberg (2003)
Voulgaris, S., van Steen, M.: An epidemic protocol for managing routing tables in very large peer-to-peer networks. In: Brunner, M., Keller, A. (eds.) DSOM 2003. LNCS, vol. 2867, pp. 41–54. Springer, Heidelberg (2003)
Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. To appear in IEEE Journal on Selected Areas in Communications (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jelasity, M., Montresor, A., Babaoglu, O. (2004). A Modular Paradigm for Building Self-Organizing Peer-to-Peer Applications. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds) Engineering Self-Organising Systems. ESOA 2003. Lecture Notes in Computer Science(), vol 2977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24701-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24701-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21201-0
Online ISBN: 978-3-540-24701-2
eBook Packages: Springer Book Archive