{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T03:50:31Z","timestamp":1782964231317,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540233886","type":"print"},{"value":"9783540301417","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30141-7_45","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:57:27Z","timestamp":1284847047000},"page":"308-315","source":"Crossref","is-referenced-by-count":17,"title":["Graph-Theoretic Analysis of Kautz Topology and DHT Schemes"],"prefix":"10.1007","author":[{"given":"Dongsheng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xicheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinshu","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Peer-to-Peer Systems","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: some open questions. In: IPTPS 2002. LNCS, vol.\u00a02429, p. 45. Springer, Heidelberg (2002)"},{"key":"45_CR2","first-page":"160","volume-title":"Proc. of ACM SIGCOMM 2001","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., et al.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc. of ACM SIGCOMM 2001, pp. 160\u2013177. ACM Press, New York (2001)"},{"key":"45_CR3","first-page":"149","volume-title":"Proc. of ACM SIGCOMM 2001","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., et al.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM 2001, pp. 149\u2013160. ACM Press, New York (2001)"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"F. Kaashoek","year":"2003","unstructured":"Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"45_CR5","unstructured":"Fraigniaud, P., Gauron, P.: The Content-Addressable Network D2B. Tech Rept. 1349, CNRS University paris-Sud, France (2003)"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic lookup network. In: Proc. of 21st ACM Symp. on Principles of Distributed Computing (PODC), Monterey, CA (2002)","DOI":"10.1145\/571825.571857"},{"issue":"1","key":"45_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/JSAC.2003.818805","volume":"22","author":"J. Xu","year":"2004","unstructured":"Xu Jun, Kumar Abhishek, Yu Xingxing: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications (JSAC), No.1 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-39425-9_49","volume-title":"Advanced Parallel Processing Technologies","author":"L. Dongsheng","year":"2003","unstructured":"Dongsheng, L., Xinxin, F., Yijie, W., et al.: A scalable peer-to-peer network with constant degree. In: Zhou, X., et al. (eds.) APPT 2003. LNCS, vol.\u00a02834, pp. 414\u2013425. Springer, Heidelberg (2003)"},{"issue":"10","key":"45_CR9","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/12.805162","volume":"48","author":"G. Panchapakesan","year":"1999","unstructured":"Panchapakesan, G., Sengupta, A.: On a lightwave network topology using Kautz digraphs. IEEE Transaction on computers\u00a048(10), 1131\u20131138 (1999)","journal-title":"IEEE Transaction on computers"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(80)90091-X","volume":"29","author":"W.G. Bridges","year":"1980","unstructured":"Bridges, W.G., Toueg, S.: On the impossibility of directed Moore graphs. Journal of Combinatorial theory, series B\u00a029, 330\u2013341 (1980)","journal-title":"Journal of Combinatorial theory, series B"},{"key":"45_CR11","first-page":"395","volume-title":"Proc. of ACM SIGCOMM 2003","author":"D. Loguinov","year":"2003","unstructured":"Loguinov, D., Kumar, A., Rai, V., et al.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: Proc. of ACM SIGCOMM 2003, pp. 395\u2013406. ACM Press, Karlsruhe (2003)"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/90.282610","volume":"2","author":"K.N. Sivarajan","year":"1994","unstructured":"Sivarajan, K.N., Ramaswami, R.: Lightwave Networks based on de Bruijn Graphs. IEEE\/ACM Trans. Networking\u00a02, 70\u201379 (1994)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1006\/jpdc.1994.1010","volume":"20","author":"C. Wei-kuo","year":"1994","unstructured":"Wei-kuo, C., Rong-Jaye, C.: Distributed Fault-Tolerant Routing in Kautz Networks. Journal of parallel and distributed computing\u00a020, 99\u2013106 (1994)","journal-title":"Journal of parallel and distributed computing"},{"key":"45_CR14","unstructured":"Dongsheng, L., et al.: FissionE: A Scalable Constant degree and constant-congestion Peer-to-Peer Network. Tech Rept. PDL-2003-14, National University of Defense technology (2003)"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30141-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T18:25:29Z","timestamp":1559672729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30141-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233886","9783540301417"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30141-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}