Development of Cluster-Fault-Tolerant Routing Algorithms in Cayley Graphs

2012 Fiscal Year Final Research Report

• Project/Area Number: 22500041
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Computer system/Network
• Research Institution: Tokyo University of Agriculture and Technology
• Principal Investigator: KANEKO Keiichi 東京農工大学, 大学院・工学研究院, 教授 (20194904)
• Project Period (FY): 2010 – 2012
• Keywords: ディペンダブルコンピューティング

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.

Research Products

• [Journal Article] Node-to-set Disjoint-path Routing in Hierarchical Cubic Networks (2012)
  • Author(s): Bossard, Antoine, and Keiichi Kaneko
  • Journal Title: The Computer Journal Volume: Vol.55, No.12 Pages: 1440-1446
  • DOI: doi:10.1093/comjnl/bxr137
  • Peer Reviewed
• [Journal Article] TheSet-to-set Disjoint-path Problem in Perfect Hierarchical Hypercubes (2012)
  • Author(s): Bossard, Antoine, and Keiichi Kaneko
  • Journal Title: The Computer Journal Volume: Vol.55, No.6 Pages: 769-775
  • DOI: doi:10.1093/comjnl/bxr135
  • Peer Reviewed
• [Journal Article] 部分列反転グラフにおける内素な経路 (2012)
  • Author(s): 金子敬一
  • Journal Title: 電子情報通信学会論文誌 Volume: Vol.J95-D,No.1 Pages: 47-53
  • Peer Reviewed
• [Journal Article] A New Node-to-set Disjoint-path Algorithm in Perfect Hierarchical Hypercubes (2011)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, and Shie-tung Peng
  • Journal Title: The Computer Journal Volume: Vol.54, No.8 Pages: 1372-1381
  • DOI: doi:10.1093/comjnl/bxr047
  • Peer Reviewed
• [Journal Article] Fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • Author(s): Iwasaki, Tatsuya, and Keiichi Kaneko
  • Journal Title: Information Processing Letters Volume: Vol.110, No.14-15 Pages: 535-538
  • DOI: doi:10.1016/j.ipl.2010.04.023
  • Peer Reviewed
• [Presentation] Fault-tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph (2012)
  • Author(s): Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
  • Organizer: Proceedings of the International Conference on Advanced Computer Science, Applications and Technologies
  • Place of Presentation: Kuala Lumpur, Malaysia
  • Year and Date: 20121126-28
• [Presentation] Fault-tolerant Routing Based on Safety Levels in a Hyper-star Graph (2012)
  • Author(s): Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
  • Organizer: Proceedings of the IADIS International Conference on Applied Computing 2012
  • Place of Presentation: Madrid, Spain
  • Year and Date: 20121019-21
• [Presentation] A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Net-works (2012)
  • Author(s): Myojin, Manabu, and Keiichi Kaneko
  • Organizer: Proceedings of the 2012 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
  • Year and Date: 20120716-19
• [Presentation] Fault-tolerant Routing Algorithms based on Approximate Directed Routable Probabilities for Hypercubes (2011)
  • Author(s): Dinh Thuy Duong and Keiichi Kaneko
  • Organizer: Proceedings of the 11th International Conference on Algorithms and Architectures for Parallel Processing
  • Place of Presentation: Melbourne, Australia
  • Year and Date: 20111024-26
• [Presentation] ARouting Algorithm of Pairwise Disjoint Paths in a Burnt Pancake Graph (2011)
  • Author(s): Iwasaki, Tatsuya, and Keiichi Kaneko
  • Organizer: Proceedings of the2nd International Symposium on Information and Communication Technology
  • Place of Presentation: Hanoi, Vietnam
  • Year and Date: 20111013-14
• [Presentation] Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks (2011)
  • Author(s): Dinh Thuy Duong and Keiichi Kaneko
  • Organizer: Proceedings of the 2011 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
  • Year and Date: 20110718-21
• [Presentation] Node-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • Organizer: Proceedings of the International Conference on Computational Science
  • Place of Presentation: Singapore
  • Year and Date: 20110601-03
• [Presentation] Set-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • Organizer: Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering
  • Place of Presentation: Montreal, Quebec, Canada
  • Year and Date: 20110516-18
• [Presentation] An Algorithm for Node-to-set Disjoint Paths Problem in a Substring Reversal Graph (2011)
  • Author(s): Jung, Sinyu, and Keiichi Kaneko
  • Organizer: Proceedings of the 8th Joint Conference on Computer Science and Software Engineering
  • Place of Presentation: Nakhon Pathom, Thailand
  • Year and Date: 20110511-13
• [Presentation] Set-to-set Disjoint Path Routing Algorithm in Burnt Pancake Graphs (2011)
  • Author(s): Iwasawa, Nagateru, Antoine Bossard, and Keiichi Kaneko
  • Organizer: Proceedings of the ISCA 26th International Conference on Computers and their Applications
  • Place of Presentation: New Orleans, Louisiana, USA
  • Year and Date: 20110323-25
• [Presentation] Set-to-set Disjoint-path Routing in Metacube (2010)
  • Author(s): Peng, Shietung, and Keiichi Kaneko
  • Organizer: Proceedings of the Eleventh International Conference on Parallel and Distributed Computing, Applications and Technologies
  • Place of Presentation: Wuhan, China
  • Year and Date: 20101208-11
• [Presentation] Node-to-set Disjoint Paths Routing in Metacube (2010)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, andShietung Peng
  • Organizer: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
  • Place of Presentation: Marina del Rey, California, USA
  • Year and Date: 20101108-10
• [Presentation] A Node-to-set Disjoint-path Routing Algorithm in Perfect Hierarchical Hypercubes (2010)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • Organizer: Proceedings of the First International Conference on Advanced Computing and Communications
  • Place of Presentation: Orlando, Florida, USA
  • Year and Date: 20100915-17
• [Presentation] A FeedbackVertex Set on Pancake Graphs (2010)
  • Author(s): Jung, Sinyu, and Keiichi Kaneko
  • Organizer: Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications
  • Place of Presentation: Las Vegas, Nevada, USA
  • Year and Date: 20100712-15
• [Presentation] Cluster-fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • Author(s): Iwasawa, 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
  • Year and Date: 20100521-23
• [Presentation] Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes (2010)
  • Author(s): Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • Organizer: Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing
  • Place of Presentation: Busan, Korea
  • Year and Date: 20100521-23