We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Routing algorithms for the shuffle-exchange permutation network.
- Authors
Khosravi, Behnam; Khosravi, Behrooz; Khosravi, Bahman
- Abstract
For a natural number n, let S n denote the symmetric group on n letters. Let SEP n be the Cayley graph Cay (S n , { σ , σ - 1 , τ }) , where τ = (12) and σ = (1 , ... , n) . In this note, we present an easy static routing algorithm for SEP n which gives us an exact formula for the path between every pair of nodes in SEP n and it does not need any calculations. Also, we show that an upper bound of this algorithm is ⌊ (3 n + 1) 2 / 9 ⌋ . Furthermore, we use our results to present a dynamic routing algorithm for SEP n which needs at most n calculations for routing and also it does not need large amount of memory for routing tables.
- Subjects
ROUTING algorithms; CAYLEY graphs; NATURAL numbers; PERMUTATIONS; ALGORITHMS
- Publication
Journal of Supercomputing, 2021, Vol 77, Issue 10, p11556
- ISSN
0920-8542
- Publication type
Article
- DOI
10.1007/s11227-021-03694-8