{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:09:03Z","timestamp":1725570543989},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169540"},{"type":"electronic","value":"9783642169557"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16955-7_16","type":"book-chapter","created":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T07:40:48Z","timestamp":1290757248000},"page":"313-333","source":"Crossref","is-referenced-by-count":20,"title":["LiFTinG: Lightweight Freerider-Tracking in Gossip"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u00e9vin","family":"Huguenin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Monod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagatika","family":"Prusty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Adar, E., Huberman, B.: Free riding on Gnutella. First Monday 5 (2000)","DOI":"10.5210\/fm.v5i10.792"},{"key":"16_CR2","unstructured":"Backes, M., Druschel, P., Haeberlen, A., Unruh, D.: CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable. In: NDSS (2009)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1016\/j.comnet.2009.03.008","volume":"53","author":"E. Bortnikov","year":"2009","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine Resilient Random Membership Sampling. Computer Networks\u00a053, 2340\u20132359 (2009)","journal-title":"Computer Networks"},{"key":"16_CR4","unstructured":"Cohen, B.: Incentives Build Robustness in BitTorrent. In: P2P Econ. (2003)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Xing, B., Lazardis, I., Hore, B., Venkatasubramanian, N., Mehrotra, S.: CREW: A Gossip-based Flash-Dissemination System. In: ICDCS (2006)","DOI":"10.1109\/ICDCS.2006.24"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/945506.945507","volume":"21","author":"P.T. Eugster","year":"2003","unstructured":"Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight Probabilistic Broadcast. TOCS\u00a021, 341\u2013374 (2003)","journal-title":"TOCS"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Frey, D., Guerraoui, R., Kermarrec, A.-M., Monod, M., Qu\u00e9ma, V.: Stretching Gossip with Live Streaming. In: DSN (2009)","DOI":"10.1109\/DSN.2009.5270330"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-10445-9_3","volume-title":"Middleware 2009","author":"D. Frey","year":"2009","unstructured":"Frey, D., Guerraoui, R., Koldehofe, B., Kermarrec, A.-M., Mogensen, M., Monod, M., Qu\u00e9ma, V.: Heterogeneous gossip. In: Bacon, J.M., Cooper, B.F. (eds.) Middleware 2009. LNCS, vol.\u00a05896, pp. 42\u201361. Springer, Heidelberg (2009)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45546-9_4","volume-title":"Networked Group Communication","author":"A. Ganesh","year":"2001","unstructured":"Ganesh, A., Kermarrec, A.-M., Massouli\u00e9, L.: SCAMP: Peer-to-peer Lightweight Membership Service for Large-scale Group Communication. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol.\u00a02233, p. 44. Springer, Heidelberg (2001)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Huguenin, K., Kermarrec, A.-M., Monod, M.: LiFT: Lightweight Freerider-Tracking Protocol. Research Report RR-6913, INRIA (2009)","DOI":"10.1007\/978-3-642-16955-7_16"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kouznetsov, P., Druschel, P.: PeerReview: Practical Accountability for Distributed Systems. In: SOSP (2007)","DOI":"10.1145\/1294261.1294279"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1126\/science.162.3859.1243","volume":"162","author":"G. Hardin","year":"1968","unstructured":"Hardin, G.: The Tragedy of the Commons. Science\u00a0162, 1243\u20131248 (1968)","journal-title":"Science"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Haridasan, M., Jansch-Porto, I., Van Renesse, R.: Enforcing Fairness in a Live-Streaming System. In: MMCN (2008)","DOI":"10.1117\/12.775127"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1275517.1275520","volume":"25","author":"M. Jelasity","year":"2007","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based Peer Sampling. TOCS\u00a025, 1\u201336 (2007)","journal-title":"TOCS"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.comnet.2007.11.002","volume":"52","author":"M. Karakaya","year":"2008","unstructured":"Karakaya, M., K\u00f6rpeo\u011flu, I., Ulusoy, O.: Counteracting Free-riding in Peer-to-Peer Networks. Computer Networks\u00a052, 675\u2013694 (2008)","journal-title":"Computer Networks"},{"key":"16_CR16","first-page":"248","volume":"14","author":"A.-M. Kermarrec","year":"2003","unstructured":"Kermarrec, A.-M., Massouli\u00e9, L., Ganesh, A.: Probabilistic Reliable Dissemination in Large-Scale Systems. TPDS\u00a014, 248\u2013258 (2003)","journal-title":"TPDS"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Kermarrec, A.-M., Pace, A., Qu\u00e9ma, V., Schiavoni, V.: NAT-resilient Gossip Peer Sampling. In: ICDCS (2009)","DOI":"10.1109\/ICDCS.2009.44"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Choosing a Random Peer. In: PODC (2004)","DOI":"10.1145\/1011767.1011786"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Krishnan, R., Smith, M., Tang, Z., Telang, R.: The Impact of Free-Riding on Peer-to-Peer Networks. In: HICSS (2004)","DOI":"10.1109\/HICSS.2004.1265472"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Li, B., Qu, Y., Keung, Y., Xie, S., Lin, C., Liu, J., Zhang, X.: Inside the New Coolstreaming: Principles, Measurements and Performance Implications. In: INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2008.157"},{"key":"16_CR21","unstructured":"Li, H., Clement, A., Marchetti, M., Kapritsos, M., Robinson, L., Alvisi, L., Dahlin, M.: FlightPath: Obedience vs Choice in Cooperative Services. In: OSDI (2008)"},{"key":"16_CR22","unstructured":"Locher, T., Moor, P., Schmid, S., Wattenhofer, R.: Free Riding in BitTorrent is Cheap. In: HotNets (2006)"},{"key":"16_CR23","first-page":"446","volume":"20","author":"R. Morales","year":"2009","unstructured":"Morales, R., Gupta, I.: AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems. TPDS\u00a020, 446\u2013459 (2009)","journal-title":"TPDS"},{"key":"16_CR24","unstructured":"Sirivianos, M., Park, J., Chen, R., Yang, X.: Free-riding in BitTorrent with the Large View Exploit. In: IPTPS (2007)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Venkataraman, V., Yoshida, K., Francis, P.: Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast. In: ICNP (2006)","DOI":"10.1109\/ICNP.2006.320193"},{"key":"16_CR26","first-page":"1678","volume":"25","author":"M. Zhang","year":"2007","unstructured":"Zhang, M., Zhang, Q., Sun, L., Yang, S.: Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better? JSAC\u00a025, 1678\u20131694 (2007)","journal-title":"JSAC"}],"container-title":["Lecture Notes in Computer Science","Middleware 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16955-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T05:24:20Z","timestamp":1636867460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16955-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169540","9783642169557"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16955-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}