{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:48:13Z","timestamp":1742964493460,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540303237"},{"type":"electronic","value":"9783540322696"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11587552_21","type":"book-chapter","created":{"date-parts":[[2005,11,18]],"date-time":"2005-11-18T08:52:59Z","timestamp":1132303979000},"page":"401-410","source":"Crossref","is-referenced-by-count":5,"title":["Overlay Networks \u2013 Implementation by Specification"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Behnel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Aberer, K.: P-Grid: A Self-Organizing access structure for P2P information systems. In: Proc. of the Sixth Int. Conference on Cooperative Information Systems (CoopIS 2001), Trento, Italy (2001)","DOI":"10.1007\/3-540-44751-2_15"},{"key":"21_CR2","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: Proc. of the 2001 ACM SIGCOMM Conference, San Diego, California, USA (2001)","DOI":"10.1145\/383059.383071"},{"key":"21_CR3","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. [19]"},{"key":"21_CR4","unstructured":"Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. [19]"},{"key":"21_CR5","unstructured":"Dabek, F., Zhao, B., Druschel, P., Stoica, I.: Towards a common API for structured peer-to-peer overlays. [18]"},{"key":"21_CR6","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proc. of the USENIX Annual Technical Conference, Boston, MA, USA (2004)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Welsh, M., Culler, D., Brewer, E.: SEDA: An architecture for well-conditioned, scalable internet services. In: Proc. of the 18th ACM symposium on operating systems principles, Banff, Alberta, Canada (2001)","DOI":"10.1145\/502034.502057"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, R., Hu, Y.C., Druschel, P.: Optimizing routing in structured peer-to-peer overlay networks using routing table redundancy. In: Proc. of the 9th Int. Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), San Juan, Puerto Rico (2003)","DOI":"10.1109\/FTDCS.2003.1204353"},{"key":"21_CR9","unstructured":"Rodriguez, A., Killian, C., Bhat, S., Kosti\u0107, D., Vahdat, A.: MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks. In: Proc. of the USENIX\/ACM Symposium on Networked Systems Design and Implementation (NSDI 2004), San Francisco, CA, USA (2004)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Li, B., Guo, J., Wan, M.: iOverlay: A lightweight middleware infrastructure for overlay application implementations. In: Proc. of the Int. Middleware Conference (Middleware 2004), Toronto, Canada (2004)","DOI":"10.1007\/978-3-540-30229-2_8"},{"key":"21_CR11","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: A decentralized network coordinate system. In: Proc. of the 2004 ACM SIGCOMM Conference, Portland, Oregon, USA (2004)"},{"key":"21_CR12","unstructured":"Eugene Ng, T.S., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: INFOCOM 2002, New York, USA (2002)"},{"key":"21_CR13","volume-title":"Pattern-Oriented Software Architecture: A System of Patterns","author":"F. Buschmann","year":"1996","unstructured":"Buschmann, F., Meunier, R., Rohnert, H., Sommerlad, P., Stal, M.: Pattern-Oriented Software Architecture: A System of Patterns. John Wiley & Sons, Chichester (1996)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-71661-7_21","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"S. Behnel","year":"2007","unstructured":"Behnel, S., Buchmann, A.: Models and languages for overlay networks. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol.\u00a04125, pp. 211\u2013218. Springer, Heidelberg (2007)"},{"key":"21_CR15","unstructured":"Birck, H., Heckmann, O., Mauthe, A., Steinmetz, R.: The two-step overlay network simulation approach. In: Proc. of SoftCOM, Split, Croatia (2004)"},{"key":"21_CR16","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead.\u00a0[18]"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Darlagiannis, V., Mauthe, A., Steinmetz, R.: Overlay design mechanisms for heterogeneous, large scale, dynamic P2P systems. Journal of Network and Systems Management, Special Issue on Distributed Management\u00a012 (2004)","DOI":"10.1023\/B:JONS.0000043686.04679.03"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Peer-to-Peer Systems II","year":"2003","unstructured":"Kaashoek, M.F., Stoica, I. (eds.): IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"21_CR19","unstructured":"The 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), Karlsruhe, Germany (2003)"}],"container-title":["Lecture Notes in Computer Science","Middleware 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11587552_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:06:50Z","timestamp":1586567210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11587552_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540303237","9783540322696"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11587552_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}