Development of Stochastic Fault-tolerant Routing Methods in Cayley Graphs
Project/Area Number |
25330079
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Software
|
Research Institution | Tokyo University of Agriculture and Technology |
Principal Investigator |
Kaneko Keiichi 東京農工大学, 工学(系)研究科(研究院), 教授 (20194904)
|
Project Period (FY) |
2013-04-01 – 2016-03-31
|
Project Status |
Completed (Fiscal Year 2015)
|
Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | 高信頼システム / ディペンダブルコンピューティング / ハイパーキューブ / 焦げたパンケーキグラフ / メビウスキューブ / デュアルキューブ / 耐故障経路選択 / アルゴリズム / ハイパースターグラフ / パンケーキグラフ / スターグラフ |
Outline of Final Research Achievements |
First, to investigate the properties of Cayley graphs, this project developed the algorithms that solves various problems related to disjoint paths in a Mobius cube, a hypercube, a hierarchical hypercube, and a hyper-star graph. Next, the project developed the fault-tolerant routing algorithms based on restricted global information in a burnt pancake graph, a dual cube, a pancake graph, an (n,k)-star graph, a hyper-star graph. Finally, this project developed the stochastic fault-tolerant routing algorithms in a hypercube and a hyper-star graph, and it extended them to be link-fault-tolerant.
|
Report
(4 results)
Research Products
(28 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Fault-tolerant Routing in (n, k)-Star Graphs2014
Author(s)
Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko
Organizer
15th International Conference on Parallel and Distributed Computing, Applications and Technologies
Place of Presentation
Hong Kong, China
Year and Date
2014-12-09 – 2014-12-11
Related Report
-
-
-
-
-
-
-
-