{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:59:05Z","timestamp":1743022745870,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":12,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048136612"},{"type":"electronic","value":"9789048136629"}],"license":[{"start":{"date-parts":[[2009,12,12]],"date-time":"2009-12-12T00:00:00Z","timestamp":1260576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,12,12]],"date-time":"2009-12-12T00:00:00Z","timestamp":1260576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-90-481-3662-9_48","type":"book-chapter","created":{"date-parts":[[2010,1,30]],"date-time":"2010-01-30T11:23:45Z","timestamp":1264850625000},"page":"281-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faulty Links Optimization for Hypercube Networks via Stored and Forward One-Bit Round Robin Routing Algorithm"],"prefix":"10.1007","author":[{"given":"Syed S.","family":"Rizvi","sequence":"first","affiliation":[]},{"given":"Adil","family":"Sheikh","sequence":"additional","affiliation":[]},{"given":"Aasia","family":"Riasat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TC.1987.5009444","volume":"36","author":"K. Shin","year":"1987","unstructured":"K. Shin and P. Ramanathan, \u201cClock synchronization of a large multiprocessor system in the presence of malicious faults,\u201d IEEE Trans. Computers, vol. 36, Issue. 1, pp. 2\u201312, Jan. 1987.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"48_CR2","first-page":"740","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and J. Ullman, \u201cAn optimal synchronizer for the hypercube,\u201d Soc. Indust. Appl. Math., vol. 18, Issue. 4, pp. 740\u2013747, Aug. 1989.","journal-title":"Soc. Indust. Appl. Math"},{"key":"48_CR3","unstructured":"M. Harrington, \u201cNew method for synchronizing distributed systems in the presence of faults,\u201d MSEE thesis, Dep. Elec. Eng., Univ. of Washington, March. 1991."},{"issue":"10","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/12.324543","volume":"43","author":"M. Harrington","year":"1994","unstructured":"M. Harrington and A. Somani, \u201cSynchronizing hypercube networks in the presence of faults,\u201d IEEE Trans. on Computers Archive, vol. 43, Issue 10, pp. 1175 \u2013 1183, 1994.","journal-title":"IEEE Trans. on Computers Archive"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press, January 31, 2005.","DOI":"10.1017\/CBO9780511813603"},{"key":"48_CR6","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"2000","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 2000."},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"T. Leighton","year":"1999","unstructured":"T. Leighton, B. Maggs, A. Richa, \u201cFast algorithms for finding O (Congestion + Dilation) packet routing schedules,\u201d Combinatorica, vol. 19, pp. 375\u2013401, 1999.","journal-title":"Combinatorica"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0980","volume":"31","author":"F. Meyer","year":"1999","unstructured":"F. Meyer and V. \u00c4ocking, \u201cShortest-path routing in arbitrary networks,\u201d Journal of Algorithms, vol. 31, pp. 105\u2013131, 1999.","journal-title":"Journal of Algorithms"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N. Alon","year":"1994","unstructured":"N. Alon, F. Chung, R. Graham, \u201cRouting permutations on graphs via matching,\u201d SIAM Journal on Discrete Mathematics, vol. 7, pp. 513\u2013530, 1994.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/PL00009219","volume":"21","author":"I. Ben-Aroya","year":"1998","unstructured":"I. Ben-Aroya, D. Chinn, A. Schuster, \u201cA lower bound for nearly minimal adaptive and hot potato algorithms,\u201d Algorithmica, vol. 21, pp. 347\u2013376, 1998.","journal-title":"Algorithmica"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"C. Busch, M. Herlihy, R. Wattenhofer, \u201cHard-potato routing,\u201d in Proceedings of the 32\n                nd\n              \n              Annual ACM Symposium on Theory of Computing, pp. 278\u2013285, 2000.","DOI":"10.1145\/335305.338762"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"J. Kim and K. Shin, \u201cDeadlock-free fault-tolerant routing in injured hypercube,\u201d IEEE Trans. on Computers, pp. 1078\u20131088, September 1993.","DOI":"10.1109\/12.241597"}],"container-title":["Novel Algorithms and Techniques in Telecommunications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-3662-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:02:27Z","timestamp":1676689347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-3662-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,12]]},"ISBN":["9789048136612","9789048136629"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-3662-9_48","relation":{},"subject":[],"published":{"date-parts":[[2009,12,12]]},"assertion":[{"value":"12 December 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}