{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:05:32Z","timestamp":1742972732027,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406744"},{"type":"electronic","value":"9783642406751"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-40675-1_86","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T12:12:46Z","timestamp":1376914366000},"page":"577-583","source":"Crossref","is-referenced-by-count":0,"title":["An Overlay Network Based on Arrangement Graph with Fault Tolerance"],"prefix":"10.1007","author":[{"given":"Ssu-Hsuan","family":"Lu","sequence":"first","affiliation":[]},{"given":"Kuan-Ching","family":"Li","sequence":"additional","affiliation":[]},{"given":"Kuan-Chou","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Yeh-Ching","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"86_CR1","doi-asserted-by":"crossref","unstructured":"Baumgart, I., Heep, B., Krause, S.: OverSim: A Flexible Overlay Network Simulation Framework. In: The Proceedings of 10th IEEE Global Internet Symposium (GI 2007) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, pp. 79\u201384 (May 2007), doi:10.1109\/GI.2007.4301435","DOI":"10.1109\/GI.2007.4301435"},{"key":"86_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","volume":"42","author":"K. Day","year":"1992","unstructured":"Day, K., Tripathi, A.: Arrangement graphs: A class of generalized star graphs. Inform. Processing Lett.\u00a042, 235\u2013241 (1992)","journal-title":"Inform. Processing Lett."},{"key":"86_CR3","doi-asserted-by":"crossref","unstructured":"Haribabu, K., Reddy, D., Hota, C., Yla-Jaaski, A., Tarkoma, S.: Adaptive Lookup for Unstructured Peer-to-Peer Overlays. In: The Proceedings of 3rd International Conference on Communication Systems Software and Middleware and Workshops 2008 (COMSWARE 2008), January 6-10, pp. 776\u2013782 (2008)","DOI":"10.1109\/COMSWA.2008.4554516"},{"issue":"5","key":"86_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TPDS.2007.70772","volume":"19","author":"S. Jiang","year":"2008","unstructured":"Jiang, S., Guo, L., Zhang, X.: LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search. The Journal of IEEE Transactions on Parallel and Distributed Systems (TPDS)\u00a019(5), 601\u2013614 (2008)","journal-title":"The Journal of IEEE Transactions on Parallel and Distributed Systems (TPDS)"},{"key":"86_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"M. Frans Kaashoek","year":"2003","unstructured":"Frans Kaashoek, M., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 98\u2013107. Springer, Heidelberg (2003)"},{"issue":"2","key":"86_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"E.K. Lua","year":"2005","unstructured":"Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. The Journal of IEEE Communications Survey and Tutorial\u00a07(2), 72\u201393 (Second Quarter, 2005)","journal-title":"The Journal of IEEE Communications Survey and Tutorial"},{"key":"86_CR7","doi-asserted-by":"crossref","unstructured":"Lu, S.-H., Lai, K.-C., Li, K.-C., Chung, Y.-C.: Design and analysis of arrangement graph-based overlay systems for information sharing. In: The Proceedings of the 3rd IEEE International Workshop on Management of Emerging Networks and Services (IEEE MENS 2011) in conjunction with IEEE GLOBECOM 2011, Houston, Texas, USA, pp. 694\u2013698 (2011)","DOI":"10.1109\/GLOCOMW.2011.6162536"},{"key":"86_CR8","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, Decentralized 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)"},{"issue":"1","key":"86_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Frans Kaashoek, M., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. The Journal of IEEE\/ACM Transactions on Networking\u00a011(1), 17\u201332 (2003)","journal-title":"The Journal of IEEE\/ACM Transactions on Networking"},{"key":"86_CR10","unstructured":"http:\/\/www.oversim.org\/"},{"key":"86_CR11","unstructured":"http:\/\/www.omnetpp.org\/"}],"container-title":["Lecture Notes in Electrical Engineering","Mobile, Ubiquitous, and Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40675-1_86","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T14:16:49Z","timestamp":1674829009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-40675-1_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642406744","9783642406751"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40675-1_86","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2014]]}}}