Abstract
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate, and provides a measure of the “total cost” of a network, which is a possible benchmark to distinguish between proposals. We characterize the cost imposed on a node as a function of the experienced load and the node connectivity, and express benefits in terms of cost reduction. We discuss the notion of social optimum with respect to the proposed cost model, and show how our model applies to a few proposed routing geometries for distributed hash tables (DHTs). We further outline a number of open questions this research has raised.
This work is supported in part by the National Science Foundation through grants ANI-0085879 and ANI-0331659.
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
Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, pp. 381–394 (2003)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, pp. 395–406 (2003)
Ng, C., Parkes, D., Seltzer, M.: Strategyproof computing: Systems infrastructures for self-interested parties. In: Proceedings of the 1st Workshop on the Economics of Peer-to-Peer Systems, Berkeley, CA (2003)
Jackson, M., Wolinsky, A.: A strategic model for social and economic networks. Journal of Economic Theory 71, 44–74 (1996)
Chun, B.G., Fonseca, R., Stoica, I., Kubiatowicz, J.: Characterizing selfishly constructed overlay networks. In: Proceedings of IEEE INFOCOM 2004, Hong Kong (2004)
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of ACM PODC 2003, Boston, MA, pp. 347–351 (2003)
Kaashoek, M.F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 323–336. Springer, Heidelberg (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of ACM SIGCOMM 2001, San Diego, CA, pp. 161–172 (2001)
Rowston, A., Druschel, P.: Pastry: Scalable, decentralized 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)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11, 17–32 (2003)
The annotated Gnutella protocol specification v0.4 (2001), http://rfc-gnutella.sourceforge.net/developer/stable/index.html
Perkins, C.: Ad hoc networking. Addison-Wesley, Boston (2000)
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. In: Proceedings of ACM SIGCOMM 2002, Pittsburgh, PA, pp. 205–217 (2002)
Chu, Y.H., Rao, S., Zhang, H.: A case for endsystem multicast. In: Proceedings of ACM SIGMETRICS 2000, Santa Clara, CA, pp. 1–12 (2000)
Liebeherr, J., Nahas, M., Si, W.: Application-layer multicast with Delaunay triangulations. IEEE Journal of Selected Areas in Communications 20, 1472–1488 (2002)
Christin, N., Chuang, J.: On the cost of participating in a peer-to-peer network. Technical report, University of California, Berkeley (2003), http://p2pecon.berkeley.edu/pub/TR-2003-12-CC.pdf See also: arXiv:cs.NI/0401010
Plaxton, C.G., Rajamaran, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems 32, 241–280 (1999)
Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2004)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of ACM PODC 2002, Monterey, CA, pp. 183–192 (2002)
Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)
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
Christin, N., Chuang, J. (2005). On the Cost of Participating in a Peer-to-Peer Network. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)