Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Transmitting in the n-dimensional cube
Discrete Applied Mathematics - Special double volume: interconnection networks
Efficient Routing and Sorting Schemes for de Bruijn Networks
IEEE Transactions on Parallel and Distributed Systems
An optimal broadcasting algorithm for de bruijn network dBG(d,k)
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Efficient routing and broadcasting algorithms in de bruijn networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Fault free shortest path routing on the de bruijn networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
| Hi-index | 14.98 |
De Bruijn graphs, both directed and undirected, have received considerable attention as architecture for interconnection networks. In this paper, we focus on undirected de Bruijn networks of radix d and dimension n, denoted by UB(d, n). We first discuss the shortest-path routing problem. We present properties of the shortest paths between any two vertices of UB(d, n) and propose two shortest-path routing algorithms, one of which has linear time complexity. Secondly, we study the transmitting problem. We establish a lower bound for the optimal transmitting time which implies in particular that the optimal transmitting problem is trivial for UB(d, n) when d驴 5. We present a transmitting scheme on undirected binary de Bruijn networks UB(2, n) with transmitting time n驴 1 for n驴 5, and conjecture that the optimal transmitting time is n驴 1 for UB(2, n), and n for UB(3, n) and UB(4, n).