{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:33:18Z","timestamp":1725521598916},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922209"},{"type":"electronic","value":"9783540922216"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92221-6_13","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T08:25:04Z","timestamp":1228292704000},"page":"184-196","source":"Crossref","is-referenced-by-count":2,"title":["Degree 3 Suffices: A Large-Scale Overlay for P2P Networks"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Brinkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-13_CR1.1","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms??3(4) (2007);","DOI":"10.1145\/1290672.1290674"},{"key":"#cr-split#-13_CR1.2","unstructured":"Also appeared in: Proc.??of the 14th SODA, pp. 384???393 (2003)"},{"key":"13_CR2","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 318\u2013327 (2004)"},{"key":"13_CR3","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Narayanan, L., Opatrny, J.: Dynamic construction of bluetooth scatternets of fixed degree and low diameter. In: Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 781\u2013790 (2003)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Brinkmann, A., Korzeniowski, M., Orhan, O.: Cube connected cycles based bluetooth scatternet formation. In: Proc. of the 4th International Conference on Networking, pp. 413\u2013420 (2005)","DOI":"10.1007\/978-3-540-31956-6_49"},{"key":"13_CR5","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (2003)"},{"key":"13_CR6","unstructured":"Jiang, X., Polastre, J., Culler, D.: Perpetual environmentally powered sensor networks. In: Proc. of the 4th Int. Symp. on Information Processing in Sensor Networks (IPSN), pp. 463\u2013468 (2005)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"13_CR8","volume-title":"Introduction to parallel algorithms and architectures: array, trees, hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st ACM Symp. on Principles of Distributed Computing (PODC), pp. 183\u2013192 (2002)","DOI":"10.1145\/571825.571857"},{"key":"#cr-split#-13_CR10.1","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: The continuous-discrete approach. ACM Transactions on Algorithms??3(3) (2007);","DOI":"10.1145\/1273340.1273350"},{"key":"#cr-split#-13_CR10.2","unstructured":"Also appeared in: Proc.??of the 15th SPAA, pp 50???59 (2003)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A.I.T. Rowstron","year":"2001","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Transactions on Networking\u00a011(1), 17\u201332 (2003); In: Proc.\u00a0of the ACM SIGCOMM, pp. 149\u2013160 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B.Y. Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications\u00a022(1), 41\u201353 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92221-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:43:40Z","timestamp":1551685420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92221-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922209","9783540922216"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92221-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}