{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:20:56Z","timestamp":1773840056959,"version":"3.50.1"},"reference-count":48,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1093\/comjnl\/bxx057","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T16:05:13Z","timestamp":1495555513000},"page":"129-143","source":"Crossref","is-referenced-by-count":58,"title":["Diagnosability Evaluation of the Data Center Network DCell"],"prefix":"10.1093","volume":"61","author":[{"given":"Xiaoyan","family":"Li","sequence":"first","affiliation":[]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"key\n\t\t\t\t20180119051506_bxx057C1","volume-title":"Graph Theory and Interconnection Networks","year":"2008"},{"key":"key\n\t\t\t\t20180119051506_bxx057C2","year":"2003"},{"key":"key\n\t\t\t\t20180119051506_bxx057C3","year":"2006"},{"key":"key\n\t\t\t\t20180119051506_bxx057C4","year":"2007"},{"key":"key\n\t\t\t\t20180119051506_bxx057C5","year":"2008"},{"key":"key\n\t\t\t\t20180119051506_bxx057C6","year":"2009"},{"key":"key\n\t\t\t\t20180119051506_bxx057C7","year":"2014"},{"key":"key\n\t\t\t\t20180119051506_bxx057C8","year":"2014"},{"key":"key\n\t\t\t\t20180119051506_bxx057C9","year":"2009"},{"key":"key\n\t\t\t\t20180119051506_bxx057C10","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1016\/j.comnet.2012.02.016","article-title":"Dpillar: dualport server interconnection network for large scale data centers","volume":"56","year":"2012","journal-title":"Comput. Netw."},{"key":"key\n\t\t\t\t20180119051506_bxx057C11","year":"2014"},{"key":"key\n\t\t\t\t20180119051506_bxx057C12","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1109\/TPDS.2015.2511725","article-title":"GBC3: a versatile cube-based server-centric network for data center","volume":"27","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"key\n\t\t\t\t20180119051506_bxx057C13","year":"2008"},{"key":"key\n\t\t\t\t20180119051506_bxx057C14","doi-asserted-by":"crossref","first-page":"2172","DOI":"10.1109\/LCOMM.2013.091913.131176","article-title":"On the connectivity of data center networks","volume":"17","year":"2013","journal-title":"IEEE Commun. Lett."},{"key":"key\n\t\t\t\t20180119051506_bxx057C15","year":"2010"},{"key":"key\n\t\t\t\t20180119051506_bxx057C16","first-page":"2944","article-title":"Hamiltonian propernies of DCell networks","volume":"58","year":"2016","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180119051506_bxx057C17","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.dam.2015.09.002","article-title":"The restricted h-connctivity of the data center network DCell","volume":"203","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t20180119051506_bxx057C18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","article-title":"An efficient algorithm to construct disjoint path covers of DCell networks","volume":"609","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"key\n\t\t\t\t20180119051506_bxx057C19","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1109\/TC.2004.114","article-title":"Diagnosability of t-connected networks and product networks under the comparison diagnosis model","volume":"53","year":"2004","journal-title":"IEEE. Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TC.2005.19","article-title":"Conditional diagnosability measure for large multiprocessors systems","volume":"54","year":"2005","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C21","first-page":"486","article-title":"An O(n2.5) fault identification algorithm for diagnosable systems","volume":"33","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C22","year":"1980"},{"key":"key\n\t\t\t\t20180119051506_bxx057C23","year":"1981"},{"key":"key\n\t\t\t\t20180119051506_bxx057C24","first-page":"10406","article-title":"The g-good-neighbor conditional diagnosability of hypercube under PMC model","volume":"218","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C25","first-page":"848","article-title":"On the connection assignment problem of diagnosable systems","volume":"16","year":"1967","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C26","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1109\/12.177309","article-title":"On self-diagnosable multiprocessor systems: diagnosis by the comparison approach","volume":"41","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C27","year":"1975"},{"key":"key\n\t\t\t\t20180119051506_bxx057C28","first-page":"414","article-title":"On fault identification in diagnosable systems","volume":"30","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C29","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/12.312114","article-title":"Diagnosisbility of enhanced hypercubes","volume":"43","year":"1994","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C30","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/71.722224","article-title":"Diagnosability of the M\u00f6bius cubes","volume":"9","year":"1998","journal-title":"IEEE Trans. Parallel Distrib. Syst"},{"key":"key\n\t\t\t\t20180119051506_bxx057C31","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ipl.2014.09.003","article-title":"The pessimistic diagnosability of alternating group graphs under the PMC model","volume":"115","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t20180119051506_bxx057C32","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.dam.2016.09.033","article-title":"The pessimistic diagnosability of three kinds of graphs","volume":"217","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t20180119051506_bxx057C33","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TPDS.2014.2318305","article-title":"The g-good-neighbor conditional diagnosability of k-ary n-cubes under the PMC model and MM* model","volume":"26","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"key\n\t\t\t\t20180119051506_bxx057C34","first-page":"1165","article-title":"The reliability of complete cubic networks under the condition of g-good-neighbor","volume":"26","year":"2016","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180119051506_bxx057C35","first-page":"1165","article-title":"The g-good-neighbor conditional diagnosability of arrangement graphs. IEEE Trans. Depend. Secure Comput.","volume":"26","year":"2016"},{"key":"key\n\t\t\t\t20180119051506_bxx057C36","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.ipl.2016.04.005","article-title":"The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM* model","volume":"116","year":"2016","journal-title":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t20180119051506_bxx057C37","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jpdc.2004.02.002","article-title":"A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems","volume":"64","year":"2004","journal-title":"J. Parallel Distrib. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C38","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.tcs.2016.03.019","article-title":"The 2-good-neighbor conditional diagnosability of cayley graphs generated by transposition trees under the PMC model and MM* model","volume":"628","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20180119051506_bxx057C39","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jpdc.2016.05.001","article-title":"Vertex-disjoint path in DCell networks","volume":"96","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C40","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/TPDS.2002.1041887","article-title":"Diagnosability of crossed cubes under the comparison diagnosis model","volume":"13","year":"2002","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"key\n\t\t\t\t20180119051506_bxx057C41","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1016\/j.ins.2008.12.023","article-title":"Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model","volume":"179","year":"2009","journal-title":"Inform. Sci."},{"key":"key\n\t\t\t\t20180119051506_bxx057C42","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1080\/00207160.2015.1020796","article-title":"The g-extra conditional diagnosability and sequential t\/k-diagnosability of hypercubes","volume":"93","year":"2016","journal-title":"Int. J. Comput. Math."},{"key":"key\n\t\t\t\t20180119051506_bxx057C43","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/TR.2016.2570559","article-title":"The extra connectivity, extra conditional diagnosability, and t\/m-diagnosability of arrangement graphs","volume":"65","year":"2016","journal-title":"IEEE Trans. Reliab."},{"key":"key\n\t\t\t\t20180119051506_bxx057C44","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/12.536232","article-title":"On diagnosability of large fault sets in regular topology-based computer systems","volume":"45","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C45","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TC.2005.33","article-title":"The t\/k-diagnosability of the BC graphs","volume":"54","year":"2005","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C46","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TC.2008.211","article-title":"Practical deadlock-free fault-tolerant routing based on the planar network fault model","volume":"58","year":"2009","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C47","first-page":"3226","article-title":"Fault-tolerant routing algorithm based on the artificial potential field model in Network-on-Chip","volume":"217","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20180119051506_bxx057C48","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TDSC.2009.3","article-title":"Deadlock-free adaptive routing in meshes with fault-tolerance ability based on channel overlapping","volume":"8","year":"2011","journal-title":"IEEE Trans. Depend. Secure Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/1\/129\/23571991\/bxx057.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T06:24:47Z","timestamp":1516343087000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/61\/1\/129\/3867580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":48,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,6,14]]},"published-print":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx057","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,1]]},"published":{"date-parts":[[2017,6,14]]}}}