Fault-tolerant routing in circulant networks and cycle prefix networks
β Scribed by Sheng-Chyang Liaw; Gerald J. Chang; Feng Cao; D. Frank Hsu
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 552 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina
## Abstract A hierarchical cubic network was proposed as an alternative to the hypercube. By HCN(__n__), we denote the hierarchical cubic network that contains 2^__n__^ __n__βdimensional hypercubes. In this paper, using Gray codes, we construct faultβfree Hamiltonian cycles in an HCN(__n__) with __