Graph theoretic expansion of Borei Cayley Graphs with an optimal and distributed routing algorithm

2012 ◽  
Author(s):  
Dongsoo Kim ◽  
Eric Noel ◽  
K. Wendy Tang
Keyword(s):  
Cayley Graphs ◽  
Routing Algorithm ◽  
Distributed Routing ◽  
Graph Theoretic

THE CUBE-OF-RINGS INTERCONNECTION NETWORK

1998 ◽  
Vol 09 (01) ◽  
pp. 25-37 ◽  
Author(s):  
THOMAS J. CORTINA ◽  
ZHIWEI XU
Keyword(s):  
Graph Theory ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Parallel Computers ◽  
Closed Form Expression ◽  
Form Expression ◽  
Graph Theoretic ◽  
Basic Graph

We present a family of interconnection networks named the Cube-Of-Rings (COR) networks along with their basic graph-theoretic properties. Aspects of group graph theory are used to show the COR networks are symmetric and optimally fault tolerant. We present a closed-form expression of the diameter and optimal one-to-one routing algorithm for any member of the COR family. We also discuss the suitability of the COR networks as the interconnection network of scalable parallel computers.

An optimal distributed routing algorithm

1991 ◽  
Vol 39 (9) ◽  
pp. 1379-1388 ◽  
Author(s):  
Z. Wang ◽  
D.W. Browning
Keyword(s):  
Routing Algorithm ◽  
Distributed Routing
Sign in / Sign up

Export Citation Format

Share Document