{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:11:24Z","timestamp":1769163084049,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11227-021-03694-8","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:02:51Z","timestamp":1616756571000},"page":"11556-11574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Routing algorithms for the shuffle-exchange permutation network"],"prefix":"10.1007","volume":"77","author":[{"given":"Behnam","family":"Khosravi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behrooz","family":"Khosravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bahman","family":"Khosravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"issue":"4","key":"3694_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnamurth A (1989) A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38(4):555\u2013566","journal-title":"IEEE Transactions on Computers"},{"key":"3694_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.dam.2018.12.005","volume":"259","author":"D Aguirre-Guerrero","year":"2019","unstructured":"Aguirre-Guerrero D, Ducoffe G, Fabrega F, Vil P, Coudert D (2019) Low time complexity algorithms for path computation in Cayley Graphs. Discrete Applied Mathematics 259:218\u2013225","journal-title":"Discrete Applied Mathematics"},{"key":"3694_CR3","doi-asserted-by":"crossref","unstructured":"Camelo M, Papadimitriou L, Fabrega L, Vil P (2014) Efficient routing in data center with underlying Cayley graphs, Complex Networks V, 189\u2013197","DOI":"10.1007\/978-3-319-05401-8_18"},{"key":"3694_CR4","doi-asserted-by":"crossref","unstructured":"Camelo M, Vil P, Fabrega L, Papadimitriou D (2014) Cayley-Graph-based Data Centers and Space Requirements of a Routing Scheme using Automata, IEEE 34th International Conference on Distributed Computing Systems Workshops, 63\u201369","DOI":"10.1109\/ICDCSW.2014.29"},{"key":"3694_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation groups","author":"P Cameron","year":"1999","unstructured":"Cameron P (1999) Permutation groups. Cambridge University Press, Cambridge"},{"key":"3694_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02687980","volume":"22","author":"B Chen","year":"2005","unstructured":"Chen B, Xiao W (2005) Routing algorithm for the Rotation-Exchange network. Journal of Electronics (China) 22:255\u2013260","journal-title":"Journal of Electronics (China)"},{"key":"3694_CR7","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s11424-006-0586-2","volume":"19","author":"B Chen","year":"2006","unstructured":"Chen B, Xiao W, Du N (2006) A New Routing Algorithm for the Shuffle-Exchange Permutation Network. Jrl Syst Sci & Complex 19:589\u20135916","journal-title":"Jrl Syst Sci & Complex"},{"key":"3694_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2016.05.025","volume":"639","author":"D Coudert","year":"2016","unstructured":"Coudert D, Ducoffe G (2016) Data center interconnection networks are not hyperbolic. Theoretical Computer Science 639:72\u201390","journal-title":"Theoretical Computer Science"},{"key":"3694_CR9","unstructured":"Cunningham DW, \u201cA Logical Introduction to Proof\u201d, Springer, New York"},{"key":"3694_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation groups","author":"JD Dixon","year":"1996","unstructured":"Dixon JD, Mortimer B (1996) Permutation groups. Springer-Verlag, New York"},{"issue":"1","key":"3694_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/jpdc.1995.1006","volume":"24","author":"P Fragapoulou","year":"1995","unstructured":"Fragapoulou P, Akl SG (1995) Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions. Journal of Parallel and Distributed Computing 24(1):55\u201371","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"3694_CR12","unstructured":"Ganesan A (2016) Cayley graphs and symmetric interconnection networks, In Proceedings of the Pre-Conference Workshop on Algebraic and Applied Combinatorics (31st Annual Conference of the Ramanujan Mathematical Society), Trichy, Tamilnadu, India, 118\u2013170"},{"key":"3694_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8937-6_5","volume-title":"Cayley graphs and interconnection networks","author":"MC Heydemann","year":"1997","unstructured":"Heydemann MC (1997) Cayley graphs and interconnection networks. Springer, Netherlands, Dordrecht"},{"key":"3694_CR14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ipl.2010.04.023","volume":"110","author":"T Iwasaki","year":"2010","unstructured":"Iwasaki T, Kaneko K (2010) Fault-tolerant routing in burnt pancake graphs. Information Processing Letters 110:535\u2013538","journal-title":"Information Processing Letters"},{"issue":"11\u201312","key":"3694_CR15","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1016\/j.laa.2008.05.010","volume":"429","author":"E Konstantinova","year":"2008","unstructured":"Konstantinova E (2008) Some problems on Cayley graphs. Linear Algebra and its Applications 429(11\u201312):2754\u20132769","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"3694_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.31772\/2587-6066-2020-21-2-187-194","volume":"21","author":"AA Kuznetsov","year":"2020","unstructured":"Kuznetsov AA, Kishkan VV (2020) A routing algorithm for the Cayley graphs generated by permutation groups. Siberian Journal of Science and Technology 21(2):187\u2013194","journal-title":"Siberian Journal of Science and Technology"},{"key":"3694_CR17","first-page":"207","volume":"12","author":"S Latifi","year":"1999","unstructured":"Latifi S, Srimani PK (1999) SEP: A fixed degree regular network for massively parallel systems. The Journal of Supercomputing 12:207\u2013214","journal-title":"The Journal of Supercomputing"},{"issue":"3","key":"3694_CR18","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1137\/S0097539796311818","volume":"28","author":"M Bruce","year":"1998","unstructured":"Bruce M, Maggs BM, Sitaraman RK (1998) Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. SIAM Journal on Computing 28(3):984\u20131003","journal-title":"SIAM Journal on Computing"},{"issue":"10","key":"3694_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2012\/124245","volume":"8","author":"J Ryu","year":"2012","unstructured":"Ryu J, Noel E, Wendy Tang K (2012) Distributed and Fault-Tolerant Routing for Borel Cayley Graphs. International Journal of Distributed Sensor Networks 8(10):1\u201315","journal-title":"International Journal of Distributed Sensor Networks"},{"key":"3694_CR20","doi-asserted-by":"crossref","unstructured":"Sawada J, Williams A (2018) A Hamilton path for the sigma-tau problem, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 568\u2013575. SIAM, Philadelphia, PA","DOI":"10.1137\/1.9781611975031.37"},{"key":"3694_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0166-218X(92)90005-U","volume":"40","author":"ST Schibell","year":"1992","unstructured":"Schibell ST, Stafford RM (1992) Processor interconnection networks from Cayley graphs. Discrete Applied Mathematics 40:333\u2013357","journal-title":"Discrete Applied Mathematics"},{"key":"3694_CR22","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s11227-011-0716-z","volume":"64","author":"J Seo","year":"2013","unstructured":"Seo J (2013) Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers. The Journal of Supercomputing 64:987\u20131007","journal-title":"The Journal of Supercomputing"},{"key":"3694_CR23","unstructured":"Tan YS, On the diameter of Cayley graphs of finite groups, (available at: https:\/\/www.math.uchicago.edu\/~may\/VIGRE\/VIGRE2011\/REUPapers\/Tan.pdf)"},{"key":"3694_CR24","unstructured":"Williams A, Hamiltonicity of the Cayley digraph on the symmetric group generated by $$(1 2)$$ and $$(1 2\\cdots n)$$, arXiv:1307.2549 [.org\/abs], 2013, 14 pp"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03694-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03694-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03694-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T09:22:08Z","timestamp":1631092928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03694-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["3694"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03694-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"15 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}