{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:04:41Z","timestamp":1758269081520},"reference-count":15,"publisher":"Elsevier BV","issue":"11-12","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1383-7621(03)00013-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:48:28Z","timestamp":1051134508000},"page":"311-323","source":"Crossref","is-referenced-by-count":4,"title":["Permutation routing in optical MIN with minimum number of stages"],"prefix":"10.1016","volume":"48","author":[{"given":"Nabanita","family":"Das","sequence":"first","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]},{"given":"Sergei L.","family":"Bezrukov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00013-4_BIB1","unstructured":"A. Abdendher, T. Feng, On rearrangeability of Omega\u2013Omega networks, in: Proc. 1992 Int Conf. Parallel Process., 1992, pp. I-159\u2013165"},{"key":"10.1016\/S1383-7621(03)00013-4_BIB2","doi-asserted-by":"crossref","unstructured":"D.W. Bass, I.H. Sudborough, On the shuffle-exchange permutation network, in: Proc. Int. Symp. Parallel Architect., Algorithms and Networks (ISPAN\u201997), Taiwan, December 1997, pp. 165\u2013171","DOI":"10.1109\/ISPAN.1997.645088"},{"issue":"6","key":"10.1016\/S1383-7621(03)00013-4_BIB3","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/12.277286","article-title":"Isomorphism of conflict graphs in multistage interconnection networks and its application to optimal routing","volume":"42","author":"Das","year":"1993","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/S1383-7621(03)00013-4_BIB4","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1109\/12.338106","article-title":"Hierarchical classification of permutation classes in multistage interconnection networks","volume":"43","author":"Das","year":"1994","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S1383-7621(03)00013-4_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/12.481490","article-title":"Optimally routing LC permutations on k-extra-stage cube-type networks","volume":"45","author":"Hu","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(03)00013-4_BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","article-title":"Notes on shuffle\/exchange type switching networks","volume":"C-29","author":"Parker","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S1383-7621(03)00013-4_BIB7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/35.747249","article-title":"Optical multistage interconnection networks: new challenges and approaches","volume":"37","author":"Pan","year":"1999","journal-title":"IEEE Commun. Magazine"},{"issue":"4","key":"10.1016\/S1383-7621(03)00013-4_BIB8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1986.1676763","article-title":"Fault-tolerant multiprocessors with redundant path networks","volume":"C-35","author":"Raghavendra","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S1383-7621(03)00013-4_BIB9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/12.376176","article-title":"An optimal algorithm for permutation admissibility to multistage interconnection networks","volume":"44","author":"Shen","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/S1383-7621(03)00013-4_BIB10","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/12.464393","article-title":"An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks","volume":"44","author":"Shen","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S1383-7621(03)00013-4_BIB11","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/12.381960","article-title":"Optimal realization of any BPC permutation on k-extra-stage Omega networks","volume":"44","author":"Shen","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(03)00013-4_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(03)00013-4_BIB13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/26.7531","article-title":"Rearrangeability of multistage shuffle\/exchange networks","volume":"36","author":"Varma","year":"1988","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"10.1016\/S1383-7621(03)00013-4_BIB14","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(03)00013-4_BIB15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jpdc.1999.1595","article-title":"Permutation capability of optical multistage interconnection networks","volume":"60","author":"Yang","year":"2000","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T14:22:52Z","timestamp":1553523772000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":15,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S1383762103000134"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00013-4","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}