{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:15:28Z","timestamp":1787505328955,"version":"build-2736575974"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T00:00:00Z","timestamp":1189728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2007,10,12]]},"DOI":"10.1007\/s00453-007-9029-2","type":"journal-article","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T10:09:58Z","timestamp":1189678198000},"page":"147-169","source":"Crossref","is-referenced-by-count":9,"title":["Choosing a Random Peer in Chord"],"prefix":"10.1007","volume":"49","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,9,14]]},"reference":[{"key":"9029_CR1","doi-asserted-by":"crossref","unstructured":"Alder, M., Halperin, E., Karp, R., Vazirani, V.: A stochastic process on the hypercube with applications to peer-to-peer networks. In: ACM Symposium on Theory of Computing (STOC) (2003)","DOI":"10.1145\/780542.780626"},{"key":"9029_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: The First ACM Conference on Computer and Communications Security, pp.\u00a062\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"9029_CR3","doi-asserted-by":"crossref","unstructured":"Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash tables. In: Proceedings of the Second International Peer to Peer Symposium (IPTPS) (2003)","DOI":"10.1007\/978-3-540-45172-3_7"},{"key":"9029_CR4","doi-asserted-by":"crossref","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attack. In: Proceedings of the European Symposium on Algorithms (ESA) (2005)","DOI":"10.1007\/11561071_71"},{"key":"9029_CR5","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Conference of the IEEE Communications Society (INFOCOM) (2004)"},{"key":"9029_CR6","doi-asserted-by":"crossref","unstructured":"Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: ACM Symposium on Theory of Computing (STOC) (2002)","DOI":"10.1145\/509907.510013"},{"key":"9029_CR7","unstructured":"Karger, D., Ruhl, M.: New algorithms for load balancing in peer-to-peer systems. In: Proceedings of the Fourth International Peer to Peer Symposium (IPTPS) (2004)"},{"key":"9029_CR8","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Choosing a random peer. In: ACM Conference on the Principles of Distributed Computing (PODC) (2004)","DOI":"10.1145\/1011767.1011786"},{"key":"9029_CR9","unstructured":"Law, C., Siu, K.-Y.: Distributed construction of random expander graphs. In: Conference of the IEEE Communications Society (INFOCOM) (2003)"},{"key":"9029_CR10","unstructured":"Lewis, S., Saia, J.: Scalable byzantine agreement. Technical Report, University of New Mexico (2004)"},{"key":"9029_CR11","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic lookup network. In: ACM Conference on the Principles of Distributed Computing (PODC) (2002)","DOI":"10.1145\/571825.571857"},{"key":"9029_CR12","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Routing networks for distributed hash tables. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 133\u2013142. ACM Press (2003)","DOI":"10.1145\/872035.872054"},{"key":"9029_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"9029_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Weider, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: Symposium on Parallel Algorithms and Architecture (SPAA) (2003)","DOI":"10.1145\/777417.777421"},{"key":"9029_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: A\u00a0simple fault tolerant distributed hash table. In: Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS) (2003)","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"9029_CR16","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: Symposium on Theory of Computation (STOC) (2001)","DOI":"10.1109\/SFCS.2001.959925"},{"key":"9029_CR17","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2001)","DOI":"10.1145\/383059.383072"},{"key":"9029_CR18","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP\/ACM International Conference on Distributed Systems Platforms, Heidelberg, pp.\u00a0329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"9029_CR19","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking (2002)","DOI":"10.1117\/12.449977"},{"key":"9029_CR20","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An analysis of Internet content delivery systems. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI) (December 2002)","DOI":"10.1145\/1060289.1060319"},{"key":"9029_CR21","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001","DOI":"10.1145\/383059.383071"},{"key":"9029_CR22","unstructured":"Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: an infrastructure for fault-resilient wide-area location and routing. University of California at Berkeley Technical Report, UCB\/\/CSD-01-1141 (April 2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9029-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9029-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9029-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:56:12Z","timestamp":1737399372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9029-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,14]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,10,12]]}},"alternative-id":["9029"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9029-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,14]]}}}