Abstract
Structured peer-to-peer overlay networks provide a useful substrate for building distributed applications but there are general concerns over the cost of maintaining these overlays. The current approach is to configure the overlays statically and conservatively to achieve the desired reliability even under uncommon adverse conditions. This results in high cost in the common case, or poor reliability in worse than expected conditions. We analyze the cost of overlay maintenance in realistic dynamic environments and design novel techniques to reduce this cost by adapting to the operating conditions. With our techniques, the concerns over the overlay maintenance cost are no longer warranted. Simulations using real traces show that they enable high reliability and performance even in very adverse conditions with low maintenance cost.
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
Bolosky, W.J., Douceur, J.R., Ely, D., Theimer, M.: Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: ACM SIGMETRICS (June 2000)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research (May 2002)
Ledlie, J., Taylor, J., Serban, L., Seltzer, M.: Selforganization in peer-to-peer systems. In: ACM SIGOPS European Workshop (September 2002)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: ACM Principles of Distributed Computing, PODC (July 2002)
Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter peer-to-peer networks. In: IEEE FOCS (October 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM (August 2001)
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, p. 329. Springer, Heidelberg (2001)
Saia, J., Fiat, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: IPTPS (March 2002)
Saltzer, J., Reed, D., Clarke, D.: End-to-end arguments in system design. ACM TOCS 2(4) (November 1984)
Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: MMCN (January 2002)
Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. In: Proc. ACM SIGCOMM Internet Measurement Workshop, Marseille, France (November 2002)
Stoica, I., Morris, R., Karger, D., Frans Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM (August 2001)
Weatherspoon, H., Kubiatowicz, J.: Efficient heartbeats and repair of softstate in decentralized object location and routing systems. In: ACM SIGOPS European Workshop (September 2002)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB-CSD-01-1141, U. C. Berkeley (April 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahajan, R., Castro, M., Rowstron, A. (2003). Controlling the Cost of Reliability in Peer-to-Peer Overlays. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-45172-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40724-9
Online ISBN: 978-3-540-45172-3
eBook Packages: Springer Book Archive