{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T05:16:22Z","timestamp":1721538982251},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,1,9]],"date-time":"2018-01-09T00:00:00Z","timestamp":1515456000000},"content-version":"am","delay-in-days":283,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100006754","name":"US Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-06-3-0001"],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UK Ministry of Defense"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1016\/j.jpdc.2016.12.022","type":"journal-article","created":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T04:03:23Z","timestamp":1482897803000},"page":"186-198","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["An efficient hypercube labeling schema for dynamic Peer-to-Peer networks"],"prefix":"10.1016","volume":"102","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2683-5738","authenticated-orcid":false,"given":"Andi","family":"Toce","sequence":"first","affiliation":[]},{"given":"Abbe","family":"Mowshowitz","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Kawaguchi","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Stone","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0821-4164","authenticated-orcid":false,"given":"Patrick","family":"Dantressangle","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Bent","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.jpdc.2016.12.022_br000005","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/945721.945729","article-title":"P-grid: a self-organizing structured p2p system","volume":"32","author":"Aberer","year":"2003","journal-title":"SIGMOD Rec."},{"key":"10.1016\/j.jpdc.2016.12.022_br000010","series-title":"Proceedings of the 3st International Symposium on Cluster Computing and the Grid","first-page":"344","article-title":"Dks (n, k, f): A family of low communication, scalable and fault-tolerant infrastructures for p2p applications","author":"Alima","year":"2003"},{"key":"10.1016\/j.jpdc.2016.12.022_br000015","series-title":"SASO\u201908: Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems","first-page":"15","article-title":"Peercube: A hypercube-based p2p overlay robust against collusion and churn","author":"Anceaume","year":"2008"},{"issue":"2","key":"10.1016\/j.jpdc.2016.12.022_br000020","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/606272.606299","article-title":"Looking up data in p2p systems","volume":"46","author":"Balakrishnan","year":"2003","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jpdc.2016.12.022_br000025","unstructured":"G. Bent, D. Dantressangle, A. Mowshowitz, V. Mitsou, A dynamic distributed federated database, in: Proceedings of the Second Annual Conference of ITA, 2008."},{"key":"10.1016\/j.jpdc.2016.12.022_br000030","unstructured":"G. Bent, D. Dantressangle, P. Stone, D. Vyvyan, A. Mowshowitz, Experimental evaluation of the performance and scalability of a dynamic distributed federated database, in: Proceedings of the Second Annual Conference of ITA, 2008."},{"issue":"4","key":"10.1016\/j.jpdc.2016.12.022_br000035","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","article-title":"Optimal communication algorithms for hypercubes","volume":"11","author":"Bertsekas","year":"1991","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000040","series-title":"Handbook of Peer-to-Peer Networking","first-page":"3","article-title":"Peer-to-peer networking: Synopsis and research directions","author":"Bufford","year":"2009"},{"key":"10.1016\/j.jpdc.2016.12.022_br000045","doi-asserted-by":"crossref","unstructured":"\u00dc.V. \u00c7ataly\u00fcrek, E.G. Boman, K.D. Devine, D. Bozdag, R.T. Heaphy, L.A. Riesen, Hypergraph-based dynamic load balancing for adaptive scientific computations, in: IPDPS, 2007, pp. 1\u201311.","DOI":"10.1109\/IPDPS.2007.370258"},{"issue":"10","key":"10.1016\/j.jpdc.2016.12.022_br000050","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1016\/j.jpdc.2006.04.018","article-title":"Bluecube: constructing a hypercube parallel computing and communication environment over bluetooth radio systems","volume":"66","author":"Chang","year":"2006","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000055","series-title":"Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","first-page":"407","article-title":"Making gnutella-like p2p systems scalable","author":"Chawathe","year":"2003"},{"issue":"4","key":"10.1016\/j.jpdc.2016.12.022_br000060","first-page":"1155","article-title":"Hypercube-based data gathering in wireless sensor networks","volume":"23","author":"Chuang","year":"2007","journal-title":"J. Inf. Sci. Eng."},{"key":"10.1016\/j.jpdc.2016.12.022_br000065","series-title":"International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability","first-page":"46","article-title":"Freenet: A distributed anonymous information storage and retrieval system","author":"Clarke","year":"2001"},{"issue":"10","key":"10.1016\/j.jpdc.2016.12.022_br000070","doi-asserted-by":"crossref","first-page":"2366","DOI":"10.1038\/nprot.2007.324","article-title":"Integration of biological networks and gene expression data using cytoscape","volume":"2","author":"Cline","year":"2007","journal-title":"Nat. Prot."},{"issue":"1","key":"10.1016\/j.jpdc.2016.12.022_br000075","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2005.12.006","article-title":"D2b: a de bruijn based content-addressable network","volume":"355","author":"Fraigniaud","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jpdc.2016.12.022_br000080","doi-asserted-by":"crossref","unstructured":"D. Guo, J. Wu, H. Chen, X. Luo, Moore: An extendable peer-to-peer network based on incomplete kautz digraph with constant degree, in: INFOCOM, 2007, pp. 821\u2013829.","DOI":"10.1109\/INFCOM.2007.101"},{"key":"10.1016\/j.jpdc.2016.12.022_br000085","unstructured":"C.-T. Ho, S.L. Johnsson, Distributed routing algorithms for broadcasting and personalized communication in hypercubes, in: ICPP, 1986, pp. 640\u2013648."},{"issue":"1","key":"10.1016\/j.jpdc.2016.12.022_br000090","first-page":"138","article-title":"Virtual hypercube routing in wireless sensor networks for health care systems","volume":"19","author":"Huo","year":"2010","journal-title":"Chin. J. Electron."},{"key":"10.1016\/j.jpdc.2016.12.022_br000095","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000100","doi-asserted-by":"crossref","unstructured":"M.F. Kaashoek, D.R. Karger, Koorde: A simple degree-optimal distributed hash table, in: IPTPS, 2003, pp. 98\u2013107.","DOI":"10.1007\/978-3-540-45172-3_9"},{"issue":"13\u201314","key":"10.1016\/j.jpdc.2016.12.022_br000105","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/S0167-8191(99)00069-1","article-title":"Ring, torus and hypercube architectures\/algorithms for parallel computing","volume":"25","author":"Lakshmivarahan","year":"1999","journal-title":"Parallel Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000110","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/j.jpdc.2016.12.022_br000115","unstructured":"D. Li, X. Lu, J. Wu, Fissione: a scalable constant degree and low congestion dht scheme based on kautz graphs, in: INFOCOM, 2005, pp. 1677\u20131688."},{"issue":"6","key":"10.1016\/j.jpdc.2016.12.022_br000120","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1016\/j.comnet.2005.07.014","article-title":"The fasttrack overlay: a measurement study","volume":"50","author":"Liang","year":"2006","journal-title":"Comput. Netw."},{"issue":"10","key":"10.1016\/j.jpdc.2016.12.022_br000125","first-page":"58","article-title":"A hypercube-based scalable interconnection network for massively parallel computing","volume":"3","author":"Liu","year":"2008","journal-title":"JCP"},{"key":"10.1016\/j.jpdc.2016.12.022_br000130","series-title":"Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing","first-page":"3","article-title":"equus: A provably robust and locality-aware peer-to-peer system","author":"Locher","year":"2006"},{"key":"10.1016\/j.jpdc.2016.12.022_br000135","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","article-title":"A survey and comparison of peer-to-peer overlay network schemes","volume":"7","author":"Lua","year":"2005","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.jpdc.2016.12.022_br000140","series-title":"Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing","first-page":"183","article-title":"Viceroy: a scalable and dynamic emulation of the butterfly","author":"Malkhi","year":"2002"},{"key":"10.1016\/j.jpdc.2016.12.022_br000145","series-title":"Revised Papers from the First International Workshop on Peer-to-Peer Systems","first-page":"53","article-title":"Kademlia: A peer-to-peer information system based on the xor metric","author":"Maymounkov","year":"2002"},{"key":"10.1016\/j.jpdc.2016.12.022_br000150","series-title":"Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing","first-page":"77","article-title":"Efficient lookup on unstructured topologies","author":"Morselli","year":"2005"},{"key":"10.1016\/j.jpdc.2016.12.022_br000155","unstructured":"A. Mowshowitz, A. Kawaguchi, A. Toce, A. Nagel, G. Bent, P. Stone, P. Dantressangle, Query optimization in a distributed hypercube database, in: Proceedings of the Fourth Annual Conference of ITA, 2010."},{"key":"10.1016\/j.jpdc.2016.12.022_br000160","unstructured":"A. Mowshowitz, A. Kawaguchi, A. Toce, A. Nagel, P. Stone, P. Dantressangle, G. Bent, Network topology as a cost factor in query optimization, in: The Fifth Annual Conference of the International Technology Alliance, ACITA\u201911, UMD, College Park, Maryland, USA, USA, 2011."},{"key":"10.1016\/j.jpdc.2016.12.022_br000165","series-title":"Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"311","article-title":"Accessing nearby copies of replicated objects in a distributed environment","author":"Plaxton","year":"1997"},{"key":"10.1016\/j.jpdc.2016.12.022_br000170","series-title":"SIGCOMM\u201901: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","first-page":"161","article-title":"A scalable content-addressable network","author":"Ratnasamy","year":"2001"},{"issue":"1","key":"10.1016\/j.jpdc.2016.12.022_br000175","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/4236.978369","article-title":"Mapping the gnutella network","volume":"6","author":"Ripeanu","year":"2002","journal-title":"IEEE Internet Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000180","series-title":"Proceedings of the IFIP\/ACM International Conference on Distributed Systems Platforms Heidelberg","first-page":"329","article-title":"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems","author":"Rowstron","year":"2001"},{"issue":"7","key":"10.1016\/j.jpdc.2016.12.022_br000185","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jpdc.2016.12.022_br000190","series-title":"LNCS","first-page":"112","article-title":"Hypercup - hypercubes, ontologies and efficient search on p2p networks","author":"Schlosser","year":"2002"},{"issue":"3","key":"10.1016\/j.jpdc.2016.12.022_br000195","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.peva.2005.01.004","article-title":"Cycloid: a constant-degree and lookup-efficient p2p overlay network","volume":"63","author":"Shen","year":"2006","journal-title":"Perform. Eval."},{"issue":"3","key":"10.1016\/j.jpdc.2016.12.022_br000200","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1093\/bioinformatics\/btq675","article-title":"Cytoscape 2.8: new features for data integration and network visualization","volume":"27","author":"Smoot","year":"2011","journal-title":"Bioinformatics"},{"issue":"4","key":"10.1016\/j.jpdc.2016.12.022_br000205","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964723.383071","article-title":"Chord: A scalable peer-to-peer lookup service for Internet applications","volume":"31","author":"Stoica","year":"2001","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.jpdc.2016.12.022_br000210","unstructured":"P. Stone, P. Dantressangle, G. Bent, A. Mowshowitz, A. Toce, B.K. Szymanski, Query propagation behaviour in gaian database networks, in: The Annual Conference of the International Technology Alliance 2012, ACITA\u201912, Botley Park Hotel, Southampton, UK, United Kingdom, 2012."},{"key":"10.1016\/j.jpdc.2016.12.022_br000215","unstructured":"P. Stone, P. Dantressangle, G. Bent, A. Mowshowitz, A. Toce, B.K. Szymanski, Query execution and maintenance costs in a dynamic distributed federated database, in: The Annual Conference of the International Technology Alliance 2012, ACITA\u201912, Botley Park Hotel, Southampton, UK, United Kingdom, 2012."},{"issue":"1","key":"10.1016\/j.jpdc.2016.12.022_br000220","first-page":"143","article-title":"Optimal independent spanning trees on hypercubes","volume":"20","author":"Tang","year":"2004","journal-title":"J. Inf. Sci. Eng."},{"key":"10.1016\/j.jpdc.2016.12.022_br000225","unstructured":"A. Toce, A. Mowshowitz, A. Kawaguchi, P. Stone, P. Dantressangle, G. Bent, HyperD: analysis and performance evaluation of a distributed hypercube database, in: The Annual Conference of the International Technology Alliance 2012, ACITA\u201912, Botley Park Hotel, Southampton, UK, United Kingdom, 2012."},{"key":"10.1016\/j.jpdc.2016.12.022_br000230","series-title":"The Fifth Annual Conference of the International Technology Alliance","article-title":"HyperD: a hypercube topology for dynamic distributed federated databases","author":"Toce","year":"2011"},{"issue":"1","key":"10.1016\/j.jpdc.2016.12.022_br000235","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","article-title":"Tapestry: a resilient global-scale overlay for service deployment","volume":"22","author":"Zhao","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731516302088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731516302088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T07:41:44Z","timestamp":1618731704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731516302088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":47,"alternative-id":["S0743731516302088"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2016.12.022","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient hypercube labeling schema for dynamic Peer-to-Peer networks","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2016.12.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}