| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Research Abstract |
In pancake graphs, we have developed a fault-tolerant routing algorithm and a cluster-fault-tolerant routing algorithm for one-to-one communication. As a preliminary step for applying this approach to various Cayley graphs, we have developed in perfect hierarchical hypercubes and hierarchical cubic networks disjoint-path routing algorithms for one-to-many communication. In addition, we have developed an internally disjoint paths routing algorithm in substring reversal graphs. We have also developed a disjoint paths routing algorithm for many-to-many communication in perfect hierarchical hypercubes.
|
