{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:44:19Z","timestamp":1725457459623},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360701"},{"type":"electronic","value":"9783642360718"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36071-8_27","type":"book-chapter","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T01:12:34Z","timestamp":1357780354000},"page":"347-360","source":"Crossref","is-referenced-by-count":1,"title":["Trading of Grade Based Incentives to Avoid Free Riding and Starvation in P2P Network"],"prefix":"10.1007","author":[{"given":"S. Moses","family":"Dian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ramadoss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Tang, Y., Wang, H., Dou, W.: Trust based incentive in P2P network. In: Proceedings of IEEE International Conference on E-Commerce Technology for Dynamic E-Business(CEC-East 2004) (2004)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Adar, E., Huberman, B.A.: Free Riding on Gnutella. First Monday, pp. 134-139 (October 2000)","DOI":"10.5210\/fm.v5i10.792"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Hughes, D., Coulson, G., Walkerdine, J.: Free Riding on Gnutella Revisited: the Bell Tolls? IEEE Distributed Systems, 1\u201318","DOI":"10.1109\/MDSO.2005.31"},{"issue":"7","key":"27_CR4","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TPDS.2007.70783","volume":"19","author":"M. Li","year":"2008","unstructured":"Li, M., Yu, J., Wu, J.: Free-Riding on BitTorrent-Like Peer-to-Peer File Sharing Systems: Modeling Analysis and Improvement. IEEE Transactions on Parallel and Distributed Systems\u00a019(7), 954\u2013966 (2008)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"27_CR5","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/TNET.2006.882904","volume":"14","author":"R.T.B. Ma","year":"2006","unstructured":"Ma, R.T.B., Lee, S.C.M., Lui, J.C.S., Yau, D.K.Y.: Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach. IEEE\/ACM Transactions on Networking\u00a014(5), 978\u2013991 (2006)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free- Riding and Whitewashing in Peer-to-Peer Systems. In: Proc. ACM SIGCOMM Workshop Practice and Theory of Incentives in Networked Systems, pp. 228\u2013236 (2004)","DOI":"10.1145\/1016527.1016539"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust Incentive Techniques for Peer-to-Peer Networks. In: Proc. Fifth ACM Conference on Electronic Commerce, pp. 102\u2013111 (May 2004)","DOI":"10.1145\/988772.988788"},{"key":"27_CR8","unstructured":"Lai, K., Feldman, M., Stoica, I., Chuang, J.: Incentives for Cooperation in Peer-to-Peer Networks. In: Proc. Workshop Economics of Peer-to-Peer Systems (June 2003)"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1120717.1120723","volume":"5","author":"M. Feldman","year":"2005","unstructured":"Feldman, M., Chuang, J.: Overcoming Free-Riding Behavior in Peer-to-Peer Systems. ACM SIGecom Exchanges\u00a05(4), 41\u201350 (2005)","journal-title":"ACM SIGecom Exchanges"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Golle, P., Leyton-Brown, K., Mironov, I.: Incentives for Sharing in Peer-to-Peer Networks. In: Proc. Third ACM Conf. Electronic Commerce, pp. 75\u201378 (2001)","DOI":"10.1007\/3-540-45598-1_9"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Garbacki, P., Epema, D.H.J.: An Amortized Tit-For-Tat Protocol for Exchanging Bandwidth Instead of Content in P2P Networks. In: Proc. First Int\u2019l Conf. Self-Adaptive and Self-Organizing Systems, pp. 119\u2013228 (2007)","DOI":"10.1109\/SASO.2007.9"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Jun, S., Ahamad, M.: Incentives in BitTorrent Induce Free Riding. In: SIGCOMM 2005 Workshops, Philadelphia, PA, USA, August 22-26 (2005)","DOI":"10.1145\/1080192.1080199"},{"key":"27_CR13","unstructured":"Ham, M., Agha, G.: ARA: A Robust Audit to Prevent Free-Riding in P2P Networks. In: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 (2005)"},{"issue":"3","key":"27_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3844\/ajeassp.2012.243.250","volume":"5","author":"S. Moses Dian","year":"2012","unstructured":"Moses Dian, S., Ramadoss, B.: A Grade Based Incentive Mechanism for Peer to Peer Networks. American Journal of Applied Science and Engineering\u00a05(3), 243\u2013250 (2012)","journal-title":"American Journal of Applied Science and Engineering"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36071-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:35:13Z","timestamp":1620135313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36071-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360701","9783642360718"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36071-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}