{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:45:02Z","timestamp":1725576302953},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407249"},{"type":"electronic","value":"9783540451723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45172-3_17","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T13:40:01Z","timestamp":1295271601000},"page":"183-196","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Recovery from Organizational Disconnects in SkipNet"],"prefix":"10.1007","author":[{"given":"Nicholas J. A.","family":"Harvey","sequence":"first","affiliation":[]},{"given":"Michael B.","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Marvin","family":"Theimer","sequence":"additional","affiliation":[]},{"given":"Alec","family":"Wolman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Cabrera, L.F., Jones, M.B., Theimer, M.: Herald: Achieving a global event notification service. In: Proceedings of the Eighth Workshop on Hot Topics in Operating Systems, HotOS-VIII (May 2001)","DOI":"10.1109\/HOTOS.2001.990066"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research (2002)","DOI":"10.1145\/1060289.1060317"},{"key":"17_CR3","unstructured":"Harvey, N.J.A., Dunagan, J., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. Technical Report MSR-TR-2002-92, Microsoft Research (2002)"},{"key":"17_CR4","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems, USITS 2003 (March 2003)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45748-8_21","volume-title":"Peer-to-Peer Systems","author":"P. Keleher","year":"2002","unstructured":"Keleher, P., Bhattacharjee, S., Silaghi, B.: Are virtualized overlay networks too much of a good thing? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 225. Springer, Heidelberg (2002)"},{"key":"17_CR6","unstructured":"Labovitzan, C., Ahuja, A.: Experimental Study of Internet Stability and Wide- Area Backbone Failures. In: Fault-Tolerant Computing Symposium, FTCS (June 1999)"},{"key":"17_CR7","unstructured":"Oppenheimer, D., Ganapathi, A., Patterson, D.A.: Why do Internet services fail, and what can be done about it? In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems, USITS 2003 (March 2003)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. In: Workshop on Algorithms and Data Structures, pp. 437\u2013449 (1989)","DOI":"10.1007\/3-540-51542-9_36"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM 2001 Conference (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"17_CR10","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. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed 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)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, pp. 149\u2013160 (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45748-8_7","volume-title":"Peer-to-Peer Systems","author":"A. Vahdat","year":"2002","unstructured":"Vahdat, A., Chase, J., Braynard, R., Kostic, D., Rodriguez, A.: Self-organizing subsets: From each according to his abilities, to each according to his needs. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 76. Springer, Heidelberg (2002)"},{"key":"17_CR13","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB\/\/CSD-01-1141, U. C. Berkeley (April 2001)"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45172-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:50:19Z","timestamp":1559933419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45172-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407249","9783540451723"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45172-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}