Constructing one-to-many disjoint paths in folded hypercubes

IEEE Transactions on Computers

Volumn 51, Issue 1, 2002, Pages 33-45

  Lai, Cheng Nan ^a   Chen, Gen Huey ^b   Duh, Dyi Rong ^c  

^a CHUNGHWA TELECOM CO LTD   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Disjoint paths; Folded hypercube; Hypercube; Optimization problem; Rabin number

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; FUNCTIONS; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; ROUTERS;

DISJOINT PATHS; FOLDED HYPERCUBE; RABIN NUMBER; ROUTING FUNCTIONS;

MULTIPROCESSING SYSTEMS;

EID: 0036163478     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.980015     Document Type: Article

References (20)

1. Fault tolerance properties of pyramid networks
2. Nearly optimal one-to-many parallel routing in star networks
3. A comparative study of topological properties of hypercubes and star graphs
4. Three disjoint path paradigms in star networks
5. Topological properties of WK-recursive networks
6. On the rabin number problem
7. Properties and performance of folded hypercubes
8. From hall's matching theorem to optimal routing on hypercubes
9. k-pairwise cluster fault tolerant routing in hypercubes
10. Cluster fault-tolerant routing in star graphs
11. On container width and length in graphs, groups and networks
12. A graph-theoretical study of transmission delay and fault tolerance
13. One-to-many disjoint paths in the hypercube and folded hypercube
14. Routing functions - An effective approach to deriving one-to-many disjoint paths
15. Generalized diameters and rabin numbers of networks
16. Fault-tolerant routing in circulant networks and cycle prefix networks
17. Efficient dispersal of information for security, load balancing, and fault tolerance
18. Topological properties of hypercubes