Development of Cluster-Fault-Tolerant Routing Algorithms in Interconnection Networks

• Project/Area Number: 19500022
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Software
• Research Institution: Tokyo University of Agriculture and Technology
• Principal Investigator: KANEKO Keiichi Tokyo University of Agriculture and Technology, 大学院・共生科学技術研究院, 准教授 (20194904)
• Project Period (FY): 2007 – 2009
• Project Status: Completed (Fiscal Year 2009)
• Budget Amount: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000); Fiscal Year 2009: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2008: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2007: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
• Keywords: アルゴリズム / 計算機システム / ディペンダブル・コンピューティング / ネットワーク

Research Abstract

In pancake and burnt pancake graphs which are topologies for interconnection networks, we have developed cluster-fault tolerant routing algorithms for one-to-one communication. We have also developed cluster-fault-tolerant disjoint-path routing algorithms for one-to-many and pairwise communication. In the process of research activities, we have also developed new topologies with good properties and new fault-tolerant routing algorithms.

Research Products

• [Journal Article] The Container Problem in Bubble-Sort Graphs (2008)
  • Author(s): Suzuki, Yasuto, Keiichi Kaneko
  • Journal Title: IEICE Transactions on Information and Systems Vol.E91-D,No.4 Pages: 1003-1009
  • NAID: 10026802642
  • Peer Reviewed
• [Journal Article] (n, k)-パンケーキグラフとその特性 (2008)
  • Author(s): 澤田直樹, 金子敬一
  • Journal Title: 電子情報通信学会論文誌 Vol.J91-D,No.1 Pages: 1-11
  • NAID: 110007380896
  • Peer Reviewed
• [Journal Article] The Container Problem in Bubble-Sort Graphs (2008)
  • Author(s): Suzuki, Yasuto, Keiichi Kaneko
  • Journal Title: IEICE Transactions on Information andSystems E91-D(4) Pages: 1003-1009
  • NAID: 10026802642
  • Peer Reviewed
• [Journal Article] (n,k)-パンケーキグラフとその特性 (2008)
  • Author(s): 澤田直樹, 金子敬一
  • Journal Title: 電子情報通信学会論文誌 J91-D Pages: 1-11
  • NAID: 110007380896
  • Peer Reviewed
• [Journal Article] Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs (2007)
  • Author(s): Keiichi Kaneko
  • Journal Title: IEICE Transactions on Information and Systems E90-D Pages: 716-721
  • NAID: 110007519532
  • Peer Reviewed
• [Presentation] "Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes (2010)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • Organizer: Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing
  • Place of Presentation: Busan, Korea
• [Presentation] Clusterfault- tolerant Routing in Burnt Pancake Graphs (2010)
  • Author(s): wasawa, Nagateru, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko
  • Organizer: Proceedings of the 2010 International Symposium on Frontiers of Parallel and Distributed Computing
  • Place of Presentation: Busan, Korea
• [Presentation] Node-to-Set Disjoint Paths Problem in Perfect Hierarchical Hypercubes (2010)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • Organizer: Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Networks
  • Place of Presentation: Innsbruck, Austria
• [Presentation] A Node-to-set Disjoint-path Routing Algorithm in Metacube (2009)
  • Author(s): A.Bossard, K.Kaneko, S.Peng
  • Organizer: 10th Int'l Symp.Pervasive Systems, Algorithms and Networks
  • Place of Presentation: Kaohsiung, Taiwan, ROC
  • Year and Date: 2009-12-14
• [Presentation] Node-to-set Disjoint-path Routing in Metacube (2009)
  • Author(s): A.Bossard, K.Kaneko, S.Peng
  • Organizer: 10th Int'l Conf.Parallel and Distributed Computing, Applications and Technologies
  • Place of Presentation: Hiroshima, Japan
  • Year and Date: 2009-12-08
• [Presentation] Fault-tolerant Routing Algorithm of Burnt Pancake Graphs (2009)
  • Author(s): T.Iwasaki, K.Kaneko
  • Organizer: 2009 Int'l Conf.Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
  • Year and Date: 2009-07-13
• [Presentation] Node-to-Set Disjoint Paths Problem in Perfect Hierarchical Hypercubes (2009)
  • Author(s): A.Bossard, K.Kaneko, S.Peng
  • Organizer: 9th IASTED Int'l Conf.Parallel and Distributed Computing and Networks
  • Place of Presentation: Innsbruck, Austria
  • Year and Date: 2009-02-16
• [Presentation] A Node-to-set Disjoint-path Routing Algorithm in Metacube (2009)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • Organizer: Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms and Networks
  • Place of Presentation: Kao-Hsiung, Taiwan, ROC
• [Presentation] Node-to-set Disjoint-path Routing in Metacube (2009)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • Organizer: Proceedings of the Tenth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • Place of Presentation: Hiroshima, Japan
• [Presentation] A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs (2009)
  • Author(s): Iwasaki, Tatsuya, Keiichi Kaneko
  • Organizer: Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
• [Presentation] パンケーキグラフにおける節点対間の互いに素な耐クラスタ故障経路選択アルゴリズム (2009)
  • Author(s): 渡部達朗, 金子敬一, 彭旭東
  • Organizer: 情報処理学会第71回全国大会論文集
  • Place of Presentation: 立命館大学
• [Presentation] 焦げたパンケーキグラフにおける耐故障経路選択アルゴリズム (2009)
  • Author(s): 岩崎達矢, 金子敬一
  • Organizer: 情報処理学会第71回全国大会論文集
  • Place of Presentation: 立命館大学
• [Presentation] Set-to-set Disjoint Paths Rout ing in Dual-cubes (2008)
  • Author(s): Peng, Shietung, Keiich i Kaneko
  • Organizer: 9th Int'l Conf. Parallel&Distributed Computing, Applications&Technologies
  • Place of Presentation: Dunedin, New Zealand
  • Year and Date: 2008-12-01
• [Presentation] A New Conf igurat ion of an Incomplete Star Graph and itsRout i ng Algorithm (2008)
  • Author(s): Iwasaki, Tatsuya, Keiichi Kaneko
  • Organizer: Int'l Conf. Parallel and Distributed Processing Techniques and Applicat ions
  • Place of Presentation: Las Vegas, Nevada, USA
  • Year and Date: 2008-07-14
• [Presentation] Node-to-set Disjoint Paths Rout ing in Dual-cube (2008)
  • Author(s): Kaneko, Keiichi, Shie tung Peng
  • Organizer: Internat ional Sympos i um on Parallel Architectures, Algorithms and Networks
  • Place of Presentation: Sydney, Australia
  • Year and Date: 2008-05-07
• [Presentation] Set-to-set Disjoint Paths Routing in Dualcubes (2008)
  • Author(s): Peng, Shietung, Keiichi Kaneko
  • Organizer: Proceedings of the Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • Place of Presentation: Dunedin, New Zealand
• [Presentation] A New Configuration of an Incomplete Star Graph and its Routing Algorithm (2008)
  • Author(s): Iwasaki, Tatsuya, Keiichi Kaneko
  • Organizer: Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
• [Presentation] Nodeto- set Disjoint Paths Routing in Dual-cube (2008)
  • Author(s): Kaneko, Keiichi, Shietung Peng
  • Organizer: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks
  • Place of Presentation: Sydney, Australia
• [Presentation] 焦げたパンケーキグラフの改善 (2008)
  • Author(s): 澤田直樹, 金子敬一
  • Organizer: 電子情報通信学会総合大会論文集
  • Place of Presentation: 九州学術研究都市
• [Presentation] An(n,k)-Pancake Graph and its Properties (2007)
  • Author(s): Naoki Sawada and Keiichi Kaneko
  • Organizer: 2007 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: ラスベガス(米国)
  • Year and Date: 2007-06-25
• [Presentation] "Pairwise Disjoint Paths in Pancake Graphs, " Proceedings of the Eighth International Conference on Parallel and Distributed Computing (2007)
  • Author(s): Sawada, Naoki, Keiichi Kaneko, Shietung Peng
  • Organizer: Applications and Technologies
  • Place of Presentation: Adelaide, Australia
• [Presentation] Cluster Fault-Tolerant Routing in Pancake Graphs (2007)
  • Author(s): Kaneko, Keiichi, Naoki Sawada, Shietung
  • Organizer: Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
  • Place of Presentation: Cambridge, Massachusetts, USA
• [Presentation] A Node-to-Set Cluster-Fault- Tolerant Disjoint Routing Algorithm in Pancake Graphs (2007)
  • Author(s): Watanabe, Tatsuro, Keiichi Kaneko, Shietung Peng
  • Organizer: Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems
  • Place of Presentation: Las Vegas, USA
• [Presentation] パンケーキグラフにおける半素な耐クラスタ故障経路選択 (2007)
  • Author(s): 渡部達朗, 金子敬一, 彭旭東
  • Organizer: 電子情報通信学会技術研究報告
  • Place of Presentation: 旭川国際会議場, 北海道
• [Presentation] An (n, k)-Pancake Graph and its Properties (2007)
  • Author(s): Sawada, Naoki, Keiichi Kaneko
  • Organizer: Proceedings of the 2007 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, USA