{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:17:23Z","timestamp":1743052643145,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233886"},{"type":"electronic","value":"9783540301417"}],"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_26","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:57:27Z","timestamp":1284847047000},"page":"175-182","source":"Crossref","is-referenced-by-count":2,"title":["Build a Distributed Repository for Web Service Discovery Based on Peer-to-Peer Network"],"prefix":"10.1007","author":[{"given":"Yin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Futai","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanyuan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minglu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"UDDI Version 3.0, Published Specification, \n                    \n                      http:\/\/www.uddi.org\/","key":"26_CR1"},{"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 ACM SIGCOMM 2001, San Diego (September 2001)","key":"26_CR2","DOI":"10.1145\/383059.383071"},{"doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: SOSP 2001 (October 2001)","key":"26_CR3","DOI":"10.1145\/502034.502054"},{"doi-asserted-by":"crossref","unstructured":"Druschel, P., Rowstron, A.: PAST: A large-scale persistent Peer-to-Peer storage utility. In: Proc. HOTOS Conf. (2001)","key":"26_CR4","DOI":"10.1109\/HOTOS.2001.990064"},{"doi-asserted-by":"crossref","unstructured":"Balazinska, M., Balakrishnan, H., Karger, D.: INS\/Twine: A scalable Peer-to-Peer architecture for intentional resource discovery. In: Proceedings of the International Conference on Pervasive Computing (August 2002)","key":"26_CR5","DOI":"10.1007\/3-540-45866-2_16"},{"unstructured":"W3C. XML Path Language (XPath) 1.0 (November 1999), \n                    \n                      http:\/\/www.w3.org\/TR\/xpath","key":"26_CR6"},{"unstructured":"Zegura, E.w., Calvert, k., Bhattacharjee, S.: How to model an Internetwork. In Proceedings of IEEE INFOCOM (1996)","key":"26_CR7"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:24:17Z","timestamp":1553109857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30141-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233886","9783540301417"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30141-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}