{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:50:48Z","timestamp":1694638248565},"reference-count":30,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4,1]]},"abstract":"<p>This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 \u00d7 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors\u2019 algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.<\/p>","DOI":"10.4018\/jghpc.2010040105","type":"journal-article","created":{"date-parts":[[2010,4,30]],"date-time":"2010-04-30T16:23:32Z","timestamp":1272644612000},"page":"53-63","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks"],"prefix":"10.4018","volume":"2","author":[{"given":"Amitabha","family":"Chakrabarty","sequence":"first","affiliation":[{"name":"Dublin City University, Ireland"}]},{"given":"Martin","family":"Collier","sequence":"additional","affiliation":[{"name":"Dublin City University, Ireland"}]},{"given":"Sourav","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Dublin City University, Ireland"}]}],"member":"2432","reference":[{"key":"jghpc.2010040105-0","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093753"},{"key":"jghpc.2010040105-1","unstructured":"Batcher, K. E. (1976). The flip network in STARAN. In Proceedings of the International Conference on Parallel Processing (pp. 65-71)"},{"key":"jghpc.2010040105-2","doi-asserted-by":"crossref","unstructured":"Beetem, J., Denneau, M., & Weingarten, D. (1985). The GF11 supercomputer. In Proceedings of the 12th annual international symposium on Computer architecture (ISCA \u201985).","DOI":"10.1007\/978-1-4613-2231-3_26"},{"key":"jghpc.2010040105-3","unstructured":"Beizer, B. (1968). The Analysis and Synthesis of Signal Switching Network. In Proceedings of the Symposium on Mathematical Theory of Automata, NY (pp. 563-576)"},{"key":"jghpc.2010040105-4","author":"E.Benes","year":"1965","journal-title":"Mathematical Theory of Connecting Networks and Telephone Traffic"},{"key":"jghpc.2010040105-5","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","article-title":"A Study of Non-Blocking Switching Networks.","volume":"32","author":"C.Clos","year":"1953","journal-title":"The Bell System Technical Journal"},{"key":"jghpc.2010040105-6","doi-asserted-by":"publisher","DOI":"10.1109\/34.21794"},{"key":"jghpc.2010040105-7","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223927"},{"key":"jghpc.2010040105-8","doi-asserted-by":"publisher","DOI":"10.1145\/633642.803967"},{"issue":"7","key":"jghpc.2010040105-9","article-title":"Fortes Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks.","volume":"10","author":"C., Hasan","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"jghpc.2010040105-10","doi-asserted-by":"publisher","DOI":"10.1109\/50.744213"},{"key":"jghpc.2010040105-11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3264-4","author":"J. Y.Hui","year":"1990","journal-title":"Switching and Traffic Theory for Integrated Broadband Networks"},{"key":"jghpc.2010040105-12","doi-asserted-by":"crossref","unstructured":"Hwang, F. K., Lin, W-D., & Lioubimov, V. (2006). On Noninterruptive Rearrangeable Networks. IEEE\/ACM Transaction on Networking, 14(5).","DOI":"10.1109\/TNET.2006.882846"},{"key":"jghpc.2010040105-13","author":"S.Keshav","year":"1997","journal-title":"An Engineering Approach to Compter Networking"},{"key":"jghpc.2010040105-14","doi-asserted-by":"publisher","DOI":"10.1109\/12.599903"},{"key":"jghpc.2010040105-15","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224157"},{"issue":"3","key":"jghpc.2010040105-16","article-title":"A Fast Parallel Algorithm for Routing Unicast Assignments in Bend Networks.","volume":"6","author":"C.-Y.Lee","year":"1995","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"jghpc.2010040105-17","first-page":"157","article-title":"A new Benes network control algorithm and Parallel Permutation Algorithm.","volume":"C-30","author":"K. Y.Lee","year":"1981","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"jghpc.2010040105-18","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/TC.1985.1676581","article-title":"On the rearrangeabllity of 2(log2 N \u2212 1) stage permutation networks.","volume":"C-34","author":"K. Y.Lee","year":"1985","journal-title":"IEEE Transactions on Computers"},{"key":"jghpc.2010040105-19","author":"F. T.Leighton","year":"1992","journal-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes"},{"key":"jghpc.2010040105-20","doi-asserted-by":"crossref","unstructured":"Linial, & Tarsi, M. (1989). Interpolation between Bases and the Shuffle-Exchange Network. European Journal on Combinatorics, 10, 29-39.","DOI":"10.1016\/S0195-6698(89)80030-7"},{"key":"jghpc.2010040105-21","doi-asserted-by":"crossref","unstructured":"Nassimi, D., & Sahni, S. (1980). A self-routing Benes network. In Proceedings of the 7th annual symposium on Computer Architecture (pp. 190-195).","DOI":"10.1145\/800053.801925"},{"key":"jghpc.2010040105-22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675791"},{"key":"jghpc.2010040105-23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675960"},{"key":"jghpc.2010040105-24","doi-asserted-by":"crossref","unstructured":"Newman, P. (1988). A fast packet switch for the integrated services backbone network. IEEE Journal of Selected Areas in Communication, SAC-6(9).","DOI":"10.1109\/49.12874"},{"key":"jghpc.2010040105-25","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1002\/j.1538-7305.1971.tb02569.x","article-title":"On a Class of Rearrangeable Switching Networks, Part I: Control Algorithm.","volume":"50","author":"D. C.Opferman","year":"1971","journal-title":"The Bell System Technical Journal"},{"key":"jghpc.2010040105-26","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(99)00129-6"},{"key":"jghpc.2010040105-27","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"jghpc.2010040105-28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675651"},{"issue":"11","key":"jghpc.2010040105-29","article-title":"On a Class of Rearrangeable Networks.","volume":"41","author":"Y.-M.Yeh","year":"1968","journal-title":"IEEE Transactions on Computers"}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=43884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:04:30Z","timestamp":1654103070000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jghpc.2010040105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,4,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jghpc.2010040105","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,1]]}}}