Abstract
In this paper we introduce and analyze S-string, a Peer-to-Peer (P2P) payment-based mechanism. S-string enhances the functionality of P2P networks by promoting cooperation among peers, rewarding them to participate in sharing objects, and encouraging them to reduce their downtimes. It also imposes tougher punishment procedures on peers when they do not fulfill their obligations to others. S-string supports the role of media entities by taking into consideration their concerns about the distribution of digital media contents or objects in a lawful and profitable manner. We demonstrate the performance results of our proposed mechanism via simulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anagnostakis, K., & Greenwald, M. (2003). Exchange-based incentive mechanisms for P2P file sharing (Technical Report MS-CIS-03-27). Department of Computer and Information Science, University of Pennsylvania.
Anagnostakis, K., Harmantzis, F., Ioannidis, S., & Zghaibeh, M. (2006). On the impact of practical P2P incentive mechanisms on user behavior. NET Institute, New York University, working paper #06-14.
Axelrod, R. (1984). The evolution of cooperation. New York: Basic Books.
Bharambe, A., Herley, C., & Padmanabhan, V. (2005). Analyzing and improving BitTorrent performance (Technical Report MSR-TR-2005-03). Microsoft Research Basic Books.
Douceur, J. R. (2002). The Sybil attack. In Revised papers from the first international workshop on peer-to-peer systems (pp. 251–260). London: Springer.
Feldman, M., Papadimitriou, C., Chuang, J., & Stoica, I. (2004), Free-riding and whitewashing in P2P systems. In Proceedings of the ACM SIGCOMM workshop on practice and theory of incentives in networked systems (pp. 228–236), Portland, OR.
Feldman, M., & Chuang, J. (2005). Overcoming free-riding behavior in peer-to-peer systems. In ACM sigecom exchanges (Vol. 5, pp. 41–50). New York: ACM.
Golle, P., Leyton-Brown, K., & Mironov, I. (2001). Incentives for sharing in P2P networks. In Proceedings of the third ACM conference on electronic commerce (pp. 264–267), Tampa, FL. New York: ACM.
Kamvar, S., Schlosser, M., & Garcia-Molina, H. (2003). The EigenTrust algorithm for reputation management in P2P networks. In Proceedings of the twelfth international world wide web conference (pp. 640–651), Budapest, Hungary. New York: ACM.
Kwok, S. H. (2002). Digital rights management for the online music business. In ACM Sigecom exchanges (Vol. 3, pp. 17–24). New York: ACM.
Schlosser, M. T., Condie, T. E., & Kamvar, S. D. (2002). Simulating a P2P file-sharing network. In First workshop on semantics in P2P and grid computing.
Thomas, T. (1988). A mandatory access control mechanism for the Unix file system. In Aerospace computer security applications conference (pp. 173–177), Orlando, FL.
Yang, B., & Garcia-Molina, H. (2003). PPay: Micropayments for P2P Systems. In Proceedings of the 10th ACM conference on computer and communications security (pp. 300–310), Washington, DC. New York: ACM.
Zghaibeh, M., & Harmantzis, F. (2006), Lottery-based pricing scheme for P2P networks, In Proceedings of IEEE international conference on communications (pp. 903–908), Istanbul, Turkey.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zghaibeh, M., Harmantzis, F.C. An “S-string” scheme for business-oriented peer-to-peer networks. Electron Commerce Res 7, 381–398 (2007). https://doi.org/10.1007/s10660-007-9008-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10660-007-9008-3