{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T01:21:18Z","timestamp":1705022478235},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s12083-015-0338-y","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T14:10:36Z","timestamp":1427897436000},"page":"313-327","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Evaluation of alternatives for the broadcast operation in Kademlia under churn"],"prefix":"10.1007","volume":"9","author":[{"given":"Antonio","family":"Delgado Peris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 M.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Huedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,1]]},"reference":[{"issue":"2","key":"338_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan H, Kaashoek M, Karger D, Morris R, Stoica I (2003) Looking up data in P2P systems. Commun ACM 46(2):43\u201348","journal-title":"Commun ACM"},{"key":"338_CR2","unstructured":"Crosby S, Wallach D (2007) An analysis of BitTorrent\u2019s two Kademlia-based DHTs. Tech. rep., Technical Report TR07-04 Rice University"},{"issue":"8","key":"338_CR3","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.comnet.2013.02.021","volume":"57","author":"Z Czirkos","year":"2013","unstructured":"Czirkos Z, Hossz\u00fa G (2013) Solution for the broadcasting in the Kademlia peer-to-peer overlay. Comput Networks 57(8): 1853\u20131862. doi: 10.1016\/j.comnet.2013.02.021","journal-title":"Comput Networks"},{"key":"338_CR4","unstructured":"Delgado Peris A, Hern\u00e1ndez JM, Huedo E (2012) Evaluation of the broadcast operation in Kademlia. In: Min G, Hu J, Liu LC, Yang LT, Seelam S, Lefevre L (eds) IEEE 14th International Conference on High Performance Computing and Communication & IEEE 9th Intl. Conf. on Embedded Software and Systems (HPCC-ICESS). IEEE Computer Society, pp 756\u2013763"},{"key":"338_CR5","doi-asserted-by":"crossref","unstructured":"Delgado Peris A, Hern\u00e1ndez JM, Huedo E (2014) Distributed scheduling and data sharing in late-binding overlays, International Conference on High Performance Computing Simulation (HPCS), 2014 , pp 129\u2013136","DOI":"10.1109\/HPCSim.2014.6903678"},{"key":"338_CR6","unstructured":"El-Ansary S, Alima L, Brand P, Haridi S (2003) Efficient broadcast in structured P2P networks 2nd International Workshop On Peer-To-Peer Systems (IPTPS\u201903). Springer, pp 304\u2013314"},{"key":"338_CR7","unstructured":"Ghodsi A, Onana Alima L, El-Ansary S, Brand P, Haridi S (2003) Self-correcting broadcast in distributed hash tables 15th IASTED International Conference, Parallel and Distributed Computing and Systems (PDCS). ACTA Press"},{"issue":"3","key":"338_CR8","first-page":"1221","volume":"58","author":"K Hasham","year":"2011","unstructured":"Hasham K, Delgado Peris A et al (2011) CMS workflow execution using intelligent job scheduling and data access strategies. Nuclear Science. IEEE Trans 58(3):1221\u20131232","journal-title":"IEEE Trans"},{"issue":"3","key":"338_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.future.2009.08.013","volume":"26","author":"K Huang","year":"2010","unstructured":"Huang K, Zhang D (2010) Dht-based lightweight broadcast algorithms in large-scale computing infrastructures. Future Gen Comput Sys 26(3):291\u2013303","journal-title":"Future Gen Comput Sys"},{"issue":"1","key":"338_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1052812.1052813","volume":"35","author":"J Li","year":"2005","unstructured":"Li J, Sollins K, Lim D (2005) Implementing aggregation and broadcast over distributed hash tables. ACM SIGCOMM Comput Commun Rev 35(1):81\u201392","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"338_CR11","doi-asserted-by":"crossref","unstructured":"Li W, Chen S, Zhou P, Li X, Li Y (2007) An efficient broadcast algorithm in distributed hash table under churn International Conference on Wireless Communications, Networking and Mobile Computing (WiCom), 2007, pp 1929\u20131932. IEEE","DOI":"10.1109\/WICOM.2007.483"},{"key":"338_CR12","doi-asserted-by":"crossref","unstructured":"Lin F, Henricsson C, Abbas S, Sandkuhl K (2009) Hypercircle: An efficient broadcast protocol for super-peer P2P networks International Conference on Computational Science and Engineering (CSE), 2009, vol 2, pp 426\u2013433. IEEE","DOI":"10.1109\/CSE.2009.247"},{"key":"338_CR13","first-page":"53","volume-title":"Kademlia: A peer-to-peer information system based on the XOR metric Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS \u201901)","author":"P Maymounkov","year":"2002","unstructured":"Maymounkov P, Mazieres D (2002) Kademlia: A peer-to-peer information system based on the XOR metric Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS \u201901). Springer-Verlag, London, pp 53\u201365"},{"key":"338_CR14","doi-asserted-by":"crossref","unstructured":"Merz P, Gorunova K (2005) Efficient broadcast in P2P grids, IEEE International Symposium on Cluster Computing and the Grid (CCGrid), 2005, vol 1, IEEE","DOI":"10.1109\/CCGRID.2005.1558560"},{"issue":"4","key":"338_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/964723.383072","volume":"31","author":"S Ratnasamy","year":"2001","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. ACM SIGCOMM Comput Commun Rev 31(4):161\u2013172","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"338_CR16","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems Middleware 2001","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"4","key":"338_CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H. (2001) Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput Commun Rev 31(4):149\u2013160","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"338_CR18","doi-asserted-by":"crossref","unstructured":"Wahlisch M, Schmidt T, Wittenburg G (2009) Broadcasting in prefix space: P2P data dissemination with predictable performance Fourth International Conference on Internet and Web Applications and Services (ICIW\u201909), IEEE","DOI":"10.1109\/ICIW.2009.19"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-015-0338-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-015-0338-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-015-0338-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T18:19:55Z","timestamp":1566497995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-015-0338-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["338"],"URL":"https:\/\/doi.org\/10.1007\/s12083-015-0338-y","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,1]]}}}