{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:54:31Z","timestamp":1725854071705},"publisher-location":"New York, NY","reference-count":38,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_272","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:36:49Z","timestamp":1553110609000},"page":"1491-1497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["P2P"],"prefix":"10.1007","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"272_CR161","doi-asserted-by":"crossref","unstructured":"Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D, Pavlov E (2003) A generic scheme for building overlay networks in adversarial scenarios. In: Proceedings of the international parallel and distributed processing symposium (IPDPS 2003)","DOI":"10.1109\/IPDPS.2003.1213125"},{"key":"272_CR162","unstructured":"Abraham I, Malkhi D, Dobzinski O (2004) LAND: stretch (1 + \u03b5) locality aware networks for DHTs. In: Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA'04)"},{"key":"272_CR163","doi-asserted-by":"crossref","unstructured":"Abraham I, Badola A, Bickson D, Malkhi D, Maloo S, Ron S (2005) Practical locality-awareness for large scale information sharing. In: The 4th annual international workshop on peer-to-peer systems (IPTPS'05)","DOI":"10.1007\/11558989_16"},{"key":"272_CR164","unstructured":"Aspnes J, Shah G (2003) Skip graphs. In: Fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, pp 384\u2013393"},{"issue":"8","key":"272_CR165","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1109\/JSAC.2002.803069","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro M, Druschel P, Rowstron A (2002) Scribe: a large-scale and decentralised application-level multicast infrastructure. IEEE J Sel Areas Commun (JSAC) 20(8):1489\u20131499, Spec Issue Netw Support Multicast Commun, ISSN:0733-8716","journal-title":"IEEE J Sel Areas Commun (JSAC)"},{"key":"272_CR166","doi-asserted-by":"crossref","unstructured":"Castro M, Druschel P, Kermarrec A-M, Nandi A, Rowstron A, Singh A (2003) Splitstream: high-bandwidth multicast in a cooperative environment. In: SOSP'03","DOI":"10.1145\/945445.945474"},{"key":"272_CR167","unstructured":"Chou P, Wu Y, Jain K (2004) Network coding for the internet. In: IEEE communication theory workshop"},{"key":"272_CR168","unstructured":"Chu Y, Rao SG, Zhang H (2000) A case for end system multicast. In: Proceedings of ACM SIGMETRICS, Santa Clara, pp 1\u201312"},{"key":"272_CR169","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/956993.956995","volume":"33","author":"B Chun","year":"2003","unstructured":"Chun B, Culler D, Roscoe T, Bavier A, Peterson L, Wawrzoniak M, Bowman M (2003) Planetlab: an overlay testbed for broadcoverage services. ACM SIGCOMM Comput Commun Rev 33:3\u201312","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"272_CR1610","unstructured":"Cohen B (2003) Incentives build robustness in bittorrent. In: Proceedings of P2P economics workshop"},{"key":"272_CR1611","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT"},{"key":"272_CR1612","doi-asserted-by":"crossref","unstructured":"Fernandess Y, Malkhi D (2006) On collaborative content distribution using multi-message gossip. In: Twentieth IEEE international parallel and distributed processing symposium (IPDPS'06), Greece","DOI":"10.1109\/IPDPS.2006.1639258"},{"key":"272_CR1613","unstructured":"Fraigniaud P, Gauron P (2003) The content-addressable network D2B. Technical report 1349, LRI, University Paris-Sud"},{"key":"272_CR1614","unstructured":"Freedman MJ, Freudenthal E, Mazi\u00e8res D (2004) Democratizing content publication with coral. In: Proceedings of the 1st USENIX\/ACM symposium on networked systems design and implementation (NSDI'04)"},{"key":"272_CR1615","doi-asserted-by":"crossref","unstructured":"Freedman MJ, Mazi\u00e8res D (2003) Sloppy hashing and self-organizing clusters. In: Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS'03)","DOI":"10.1007\/978-3-540-45172-3_4"},{"key":"272_CR1616","doi-asserted-by":"crossref","unstructured":"Gkantsidis C, Rodriguez P (2005) Network coding for large scale content distribution. In: IEEE\/INFOCOM","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"272_CR1617","doi-asserted-by":"crossref","unstructured":"Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the nineteenth ACM symposium on Operating systems principles, ACM, pp 314\u2013329","DOI":"10.1145\/945445.945475"},{"key":"272_CR1618","doi-asserted-by":"crossref","unstructured":"Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications, ACM, pp 381\u2013394","DOI":"10.1145\/863955.863998"},{"key":"272_CR1619","unstructured":"Harvey NJA, Jones MB, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In: Proceedings of fourth USENIX symposium on internet technologies and systems (USITS'03)"},{"key":"272_CR1620","doi-asserted-by":"crossref","unstructured":"Kaashoek F, Karger DR (2003) Koorde: a simple degree-optimal hash table. In: 2nd international workshop on peer-to-peer systems (IPTPS'03)","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"272_CR1621","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton FT, Levine M, Lewin D, Panigrahy R (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC'97), pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"272_CR1622","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In: Proceedings of the 32nd ACM symposium on theory of computing (STOC'00), pp 163\u2013170","DOI":"10.1145\/335305.335325"},{"key":"272_CR1623","doi-asserted-by":"crossref","unstructured":"Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM symposium on principles of distributed computing (PODC'02), pp 183\u2013192","DOI":"10.1145\/571825.571857"},{"key":"272_CR1624","unstructured":"Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: Proceedings of the 4th USENIX symposium on internet technologies and systems (USITS'03), pp 127\u2013140"},{"key":"272_CR1625","doi-asserted-by":"crossref","unstructured":"Maymounkov P, Mazi\u00e8res D (2002) Kademlia: a peer-to-peer information system based on the XORmetric. In: Proceedings of the 1st international workshop on peer-to-peer systems (IPTPS'02), pp 53\u201365","DOI":"10.1007\/3-540-45748-8_5"},{"key":"272_CR1626","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U (2003) Novel architectures for p2p applications: the continuous-discrete approach. In: The fifteenth annual ACM symposium on parallelism in algorithms and architectures (SPAA'03)","DOI":"10.1145\/777412.777421"},{"key":"272_CR1627","doi-asserted-by":"crossref","unstructured":"Plaxton C, Rajaraman R, Richa A (1997) Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the ninth annual ACM symposium on parallel algorithms and architectures (SPAA'97), pp 311\u2013320","DOI":"10.1145\/258492.258523"},{"key":"272_CR1628","doi-asserted-by":"crossref","unstructured":"Pugh W (1989) Skip lists: a probabilistic alternative to balanced trees. In: Workshop on algorithms and data structures, pp 437\u2013449","DOI":"10.1007\/3-540-51542-9_36"},{"key":"272_CR1629","unstructured":"Ramasubramanian V, Sirer EG (2004) Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In: Proceedings of networked system design and implementation (NSDI)"},{"key":"272_CR1630","doi-asserted-by":"crossref","unstructured":"Ramasubramanian V, Sirer EG (2004) The design and implementation of a next generation name service for the internet. In: Proceedings of SIGCOMM","DOI":"10.1145\/1015467.1015504"},{"key":"272_CR1631","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM 2001 Technical Conference","DOI":"10.1145\/383059.383072"},{"key":"272_CR1632","volume-title":"Handling churn in a dht. Technical report, UCB\/\/CSD-03-1299","author":"S Rhea","year":"2003","unstructured":"Rhea S, Geels D, Roscoe T, Kubiatowicz J (2003) Handling churn in a dht. Technical report, UCB\/\/CSD-03-1299. The University of California, Berkeley"},{"key":"272_CR1633","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP\/ACM international conference on distributed systems platforms (Middleware), pp 329\u2013350","DOI":"10.1007\/3-540-45518-3_18"},{"key":"272_CR1634","doi-asserted-by":"crossref","unstructured":"Stoica I, Adkins D, Zhuang S, Shenker S, Surana S (2002) Internet indirection infrastructure. In: Proceedings of ACM SIGCOMM, pp 73\u201388","DOI":"10.1145\/633025.633033"},{"key":"272_CR1635","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM","DOI":"10.1145\/383059.383071"},{"key":"272_CR1636","doi-asserted-by":"crossref","unstructured":"Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz J (2003) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun","DOI":"10.1109\/JSAC.2003.818784"},{"key":"272_CR1637","unstructured":"Zhou L, van Renesse R, Marsh M (2002) Implementing IPv6 as a peer-to-peer overlay network. In: Proceedings of the 21st IEEE symposium on reliable distributed systems (SRDS'02), p 347"},{"key":"272_CR1638","doi-asserted-by":"crossref","unstructured":"Zhuang SQ, Zhao BY, Joseph AD, Katz RH, Kubiatowicz J (2001) Bayeux: an architecture for scalable and fault-tolerant widearea data dissemination. In: Proceedings of the eleventh international workshop on network and operating system support for digital audio and video (NOSSDAV'01)","DOI":"10.1145\/378344.378347"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T23:57:33Z","timestamp":1574380653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_272","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}