Abstract
In peer-to-peer networks, peers simultaneously play the role of client and server. Since the introduction of the first file-sharing protocols, peer-to-peer networking currently causes more than 35% of all internet network traffic— with an ever increasing tendency. A common file-sharing protocol that occupies most of the peer-to-peer traffic is the BitTorrent protocol. Although based on cooperative principles, in practice it is doomed to fail if peers behave greedily. In this work-in-progress paper, we model the protocol by introducing the game named Tit-for-Tat Network Termination (T4TNT) that gives an interesting access to the greediness problem of the BitTorrent protocol. Simulations conducted under this model indicate that greediness can be reduced by solely manipulating the underlying peer-to-peer topology.
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
Izal, M., Urvoy-Keller, G., Biersack, E.W., Felber, P.A., Hamra, A.A., Garces-Erice, L.: Dissecting BitTorrent: Five Months in a Torrent’s Lifetime. LNCS, pp. 1–11 (2004)
Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and Improving a BitTorrent Network’s Performance Mechanisms. In: Proceedings of IEEE INFOCOM (2006)
Liogkas, N., Nelson, R., Kohler, E., Zhang, L.: Exploiting bittorrent for fun (but not profit). In: Proc. 5th Itl. Workshop on Peer-to-Peer Systems, IPTPS (2006)
University, S.: Stanford Engineering Everywhere (2008)
Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. ACM Computing Surveys 37, 164–194 (2005)
Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and Improving BitTorrent Performance. Microsoft Research, Microsoft Corporation One Microsoft Way Redmond, WA 98052, 2005-2003 (2005)
Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, Chichester (2005)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Watts, D.J.: Small Worlds - The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)
Watts, D.J., Strogatz, H.: Collective Dynamics of ’Small World’ Networks. Nature 393, 440–442 (1998)
Calinescu, G.: Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 175–186. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Brust, M.R., Ribeiro, C.H.C., Mesit, J. (2009). Avoiding Greediness in Cooperative Peer-to-Peer Networks. In: Bertino, E., Joshi, J.B.D. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2008. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03354-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-03354-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03353-7
Online ISBN: 978-3-642-03354-4
eBook Packages: Computer ScienceComputer Science (R0)