{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:56:39Z","timestamp":1649044599906},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0140-3664(99)00158-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"84-91","source":"Crossref","is-referenced-by-count":1,"title":["Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm"],"prefix":"10.1016","volume":"23","author":[{"given":"Chin-Ching","family":"Chiu","sequence":"first","affiliation":[]},{"given":"Yi-Shiung","family":"Yeh","sequence":"additional","affiliation":[]},{"given":"Ruey-Shun","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(99)00158-9_BIB1","series-title":"Computer Networks","author":"Tanenbaum","year":"1981"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB2","series-title":"Local Networks","author":"Stallings","year":"1984"},{"issue":"3","key":"10.1016\/S0140-3664(99)00158-9_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1109\/24.257825","article-title":"A generalized algorithm for evaluation distributed program reliability","volume":"42","author":"Anup Kumar","year":"1993","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/S0140-3664(99)00158-9_BIB4","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1109\/TC.1984.1676389","article-title":"A perspective on distributed computer systems","volume":"33","author":"Stankovic","year":"1984","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TR.1981.5221103","article-title":"New algorithm for reliability analysis of multiterminal networks","volume":"R-30","author":"Satyanarayna","year":"1981","journal-title":"IEEE Trans. Reliab."},{"issue":"5","key":"10.1016\/S0140-3664(99)00158-9_BIB6","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/S0026-2714(96)00145-X","article-title":"Pathset enumeration of directed graphs by the set theoretic method","volume":"37","author":"Aziz","year":"1997","journal-title":"Microelectron. Reliab."},{"issue":"2","key":"10.1016\/S0140-3664(99)00158-9_BIB7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/TR.1987.5222362","article-title":"Two recursive for computing the reliability of k-out-n systems","volume":"36","author":"Rai","year":"1987","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/S0140-3664(99)00158-9_BIB8","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TC.1982.1676019","article-title":"A methodology for the design of communication networks and the distribution of data in distributed supercomputer systems","volume":"C-31","author":"Irani","year":"1982","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB9","first-page":"569","article-title":"Analytic and simulation methods in computer network design","author":"Kleinrock","year":"1970","journal-title":"Proc. Spring Joint Computer Conf."},{"key":"10.1016\/S0140-3664(99)00158-9_BIB10","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1109\/PROC.1972.8910","article-title":"Topological optimization of computer networks","volume":"60","author":"Frank","year":"1972","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB11","first-page":"660","article-title":"Analysis and design of reliable computer networks","volume":"COM-20","author":"Wilkov","year":"1970","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"10.1016\/S0140-3664(99)00158-9_BIB12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/24.326428","article-title":"Calculation of node-pair reliability in large networks with unreliable nodes","volume":"43","author":"Torrieri","year":"1994","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/S0140-3664(99)00158-9_BIB13","first-page":"319","article-title":"Bounds on the reliability of networks","volume":"16","author":"Provan","year":"1986","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"10.1016\/S0140-3664(99)00158-9_BIB14","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/24.510811","article-title":"Reliability optimization of series-parallel systems using a genetic algorithm","volume":"45","author":"Coit","year":"1996","journal-title":"IEEE Trans. Reliab."},{"issue":"10","key":"10.1016\/S0140-3664(99)00158-9_BIB15","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1109\/TSE.1985.231866","article-title":"Reliability optimization in design of distributed systems","volume":"SE-11","author":"Raghavendra","year":"1985","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0026-2714(82)90006-3","article-title":"Topological layout of links for optimizing the S-T reliability in a computer communication system","volume":"22","author":"Aggarwal","year":"1982","journal-title":"Microelectron. Reliab."},{"issue":"4","key":"10.1016\/S0140-3664(99)00158-9_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0898-1221(94)00242-D","article-title":"Reliability optimization of distributed computing systems subject to capacity constraint","volume":"29","author":"Chen","year":"1995","journal-title":"J. Computers Math. Appl."},{"issue":"3","key":"10.1016\/S0140-3664(99)00158-9_BIB18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0898-1221(94)00227-C","article-title":"A new heuristic approach for reliability optimization of distributed computing systems subject to capacity constraints","volume":"29","author":"Chen","year":"1995","journal-title":"J. Computers Math. Appl."},{"issue":"10","key":"10.1016\/S0140-3664(99)00158-9_BIB19","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1109\/TC.1987.1676862","article-title":"Syrel: a symbolic reliability algorithm based on path and cuset methods","volume":"C-36","author":"Salim Hariri","year":"1987","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0140-3664(99)00158-9_BIB20","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/T-C.1969.222542","article-title":"Optimal file allocation in a multiple computer system","volume":"C-18","author":"Chu","year":"1969","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"10.1016\/S0140-3664(99)00158-9_BIB21","article-title":"New reliability evaluation algorithms for distributed computing systems","volume":"8","author":"Lin","year":"1992","journal-title":"J. Inform. Sci. Engng"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499001589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499001589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T02:50:22Z","timestamp":1555210222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366499001589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0140366499001589"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(99)00158-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}