{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T12:04:38Z","timestamp":1708171478428},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p> Problem diagnosis in large distributed computer systems and networks is a challenging task that requires fast and accurate inferences from huge volumes of data. In this paper, the PMC diagnostic model is considered, based on the diagnostic approach of end-to-end probing technology. A probe is a test transaction whose outcome depends on some of the system's components; diagnosis is performed by selecting appropriate probes and analyzing the results. In the PMC model, every computer can execute a probe to test a dedicated system's components. Furthermore, any test result reported by a faulty probe station is unreliable and the test result reported by fault-free probe station is always correct. The aim of the diagnosis is to locate all faulty components in the system based on collection of the test results. A dual-cube DC(n) is an (n + 1)-regular spanning subgraph of a (2n + 1)-dimensional hypercube. It uses n-dimensional hypercubes as building blocks and returns the main desirable properties of the hypercube so that it is suitable as a topology for distributed systems. In this paper, we first show that the diagnosability of DC(n) is n + 1 and then show that adaptive diagnosis is possible using at most 2<jats:sup>2n+1<\/jats:sup> + n tests for a 2<jats:sup>2n+1<\/jats:sup>-node distributed system modeled by dual-cubes DC(n) in which at most n + 1 processes are faulty. Furthermore, we propose an adaptive diagnostic algorithm for the DC(n) and show that it diagnoses the DC(n) in three testing rounds and at most 2<jats:sup>2n+1<\/jats:sup> + O(n<jats:sup>3<\/jats:sup>) tests, where each node is scheduled for at most one test in each round. <\/jats:p>","DOI":"10.1142\/s0129054114500075","type":"journal-article","created":{"date-parts":[[2014,6,6]],"date-time":"2014-06-06T01:46:06Z","timestamp":1402019166000},"page":"125-139","source":"Crossref","is-referenced-by-count":2,"title":["A THREE-ROUND ADAPTIVE DIAGNOSTIC ALGORITHM IN A DISTRIBUTED SYSTEM MODELED BY DUAL-CUBES"],"prefix":"10.1142","volume":"25","author":[{"given":"JHENG-CHENG","family":"CHEN","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 97401, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHIA-JUI","family":"LAI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 97401, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHANG-HSIUNG","family":"TSAI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 97401, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,6,5]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2009.09.002"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.09.028"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.12.023"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1109\/12.543709"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_39"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<206::AID-NET5>3.0.CO;2-F"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/12.888036"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.026"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.19"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000014803.83151.dc"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2005.007866"},{"issue":"10","key":"p_16","first-page":"1669","volume":"22","author":"Lin C. K.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"p_17","first-page":"697","author":"Nakajima K.","year":"1981","journal-title":"Comm. Control and Computing"},{"key":"p_18","first-page":"5","volume":"86","author":"Okashita A.","year":"2003","journal-title":"IEICE Trans. Fundamentals"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.10.002"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.11.014"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114500075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:21:51Z","timestamp":1565104911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114500075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":17,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2014,6,5]]},"published-print":{"date-parts":[[2014,2]]}},"alternative-id":["10.1142\/S0129054114500075"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114500075","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}