• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A Stochastic Link-fault-tolerant Routing Method in Torus Networks

Research Project

Project/Area Number 17K00093
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Software
Research InstitutionTokyo University of Agriculture and Technology

Principal Investigator

Kaneko Keiichi  東京農工大学, 工学(系)研究科(研究院), 教授 (20194904)

Project Period (FY) 2017-04-01 – 2020-03-31
Project Status Completed (Fiscal Year 2019)
Budget Amount *help
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Keywords高信頼システム / ディペンダブルコンピューティング
Outline of Final Research Achievements

The main result of this research is the development of the stochastic link-fault-tolerant routing algorithm in torus networks. Next, as a result of deep understanding of the torus structure, we could develop polynomial-time algorithms that can solve the problems such as the pairwise disjoint paths and the set-to-set disjoint paths in tori. Also, we have applied our method to other topologies and obtained stochastic fault-tolerant routing algorithms in locally twisted cubes, folded hypercubes, and dual-cubes.

Academic Significance and Societal Importance of the Research Achievements

トーラスにおける耐故障経路選択に関する先行研究では,前処理で故障ノードを包含する凸形状の故障ブロックを確定し,局所的な故障情報を用いるものが主流であっため,多くの非故障ノードが使用不能になる.本研究では,トーラスに適した制限された大域情報を新たに設計して活用するアルゴリズムを開発した.その成果は,独創的であり,画期的である.実験の結果,従来の到達率を大幅に上回る性能を発揮した.トーラスは,並列システムの相互結合網として最も利用されている位相であるため,本研究による成果は,社会の情報インフラに対して大きな意義を持つ.

Report

(4 results)
  • 2019 Annual Research Report   Final Research Report ( PDF )
  • 2018 Research-status Report
  • 2017 Research-status Report
  • Research Products

    (20 results)

All 2020 2019 2018 2017 Other

All Int'l Joint Research (2 results) Journal Article (7 results) (of which Int'l Joint Research: 1 results,  Peer Reviewed: 7 results,  Open Access: 7 results) Presentation (11 results) (of which Int'l Joint Research: 11 results)

  • [Int'l Joint Research] ネバダ大学リノ校(米国)

    • Related Report
      2018 Research-status Report
  • [Int'l Joint Research] チェコ工科大学(チェコ)

    • Related Report
      2017 Research-status Report
  • [Journal Article] Node-Disjoint Paths Problems in Directed Bijective Connection Graphs2020

    • Author(s)
      KANEKO Keiichi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E103.D Issue: 1 Pages: 93-100

    • DOI

      10.1587/transinf.2019EDP7197

    • NAID

      130007779056

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2020-01-01
    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] A Stochastic Link-fault-tolerant Routing Algorithm in Folded Hypercubes2018

    • Author(s)
      Bui Thi Thuan, Lam Boi Ngoc, and Keiichi Kaneko
    • Journal Title

      The Journal of Supercomputing

      Volume: 74 Issue: 10 Pages: 5539-5557

    • DOI

      10.1007/s11227-018-2456-9

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Torus Pairwise Disjoint-path Routing2018

    • Author(s)
      Antoine Bossard and Keiichi Kaneko
    • Journal Title

      Sensors

      Volume: 18 Issue: 11 Pages: 3912-3912

    • DOI

      10.3390/s18113912

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph2018

    • Author(s)
      Yo Nishiyama, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, and Keiichi Kaneko
    • Journal Title

      Journal of Information Science and Engineering

      Volume: 34

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] A Set-to-Set Disjoint Paths Routing Algorithm in Tori2017

    • Author(s)
      Keiichi Kaneko and Antoine Bossard
    • Journal Title

      International Journal of Networking and Computing

      Volume: 7 Pages: 173-186

    • NAID

      130006135386

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Node-to-Node Disjoint Paths Problem in Möbius Cubes2017

    • Author(s)
      David Kocik and Keiichi Kaneko
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E100.D Issue: 8 Pages: 1837-1843

    • DOI

      10.1587/transinf.2016EDP7475

    • NAID

      130005875974

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Stochastic Fault-Tolerant Routing in Dual-Cubes2017

    • Author(s)
      Junsuk Park, Nobuhiro Seki, and Keiichi Kaneko
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E100.D Issue: 8 Pages: 1920-1921

    • DOI

      10.1587/transinf.2017EDL8046

    • NAID

      130005876128

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Presentation] Fault-tolerant Routing based on Fault Information of Cross-edges in Dual-cubes2019

    • Author(s)
      Nobuhiro Seki, Kousuke Mouri, and Keiichi Kaneko
    • Organizer
      2019 International Conference on Parallel and Distributed Processing Techniques and Applications
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Stochastic Link-fault-tolerant Routing in a Torus2018

    • Author(s)
      Seiya Kuramochi, Yu-on Chatchakan, Kousuke Mouri, and Keiichi Kaneko
    • Organizer
      The 15th International Joint Conference on Computer Science and Software Engineering
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] A Fully Adaptive Minimal Routing Algorithm in a Crossed Cube2018

    • Author(s)
      Kaito Satoh, Kousuke Mouri, and Keiichi Kaneko
    • Organizer
      The 2018 International Conference on Parallel and Distributed Processing Techniques and Applications
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] On the Torus Pairwise Disjoint-path Routing Problem2018

    • Author(s)
      Antoine Bossard and Keiichi Kaneko
    • Organizer
      The 18th IEEE International Conference on Computer and Information Technology
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] On the Crossing Number of Tori2018

    • Author(s)
      Antoine Bossard, Keiichi Kaneko and Frederick C. Harris Jr.
    • Organizer
      The Fourth International Conference on Electronics and Software Science
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] Node-to-node Disjoint Paths in Twisted Crossed Cubes2018

    • Author(s)
      Hiroki Nagashima, Mouri Kousuke, and Keiichi Kaneko
    • Organizer
      The 10th International Conference on Advances in Information Technology
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] Fault-tolerant Routing Methods in Crossed Cubes2018

    • Author(s)
      Koji Otake, Kousuke Mouri, and Keiichi Kaneko
    • Organizer
      The 10th International Conference on Advances in Information Technology
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] Link-fault-tolerant Routing in Folded Hypercube using Directed Routing Probability2017

    • Author(s)
      Ngoc Boi Lam and Keiichi Kaneko
    • Organizer
      The 2017 Sixth ICT International Student Project Conference
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Stochastic Fault-tolerant Routing in Locally Twisted Cubes2017

    • Author(s)
      Yudai Takano and Keiichi Kaneko
    • Organizer
      The 2017 Sixth ICT International Student Project Conference
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Shortest-path Routing in Spined Cubes2017

    • Author(s)
      Kaito Satoh, Keiichi Kaneko, Thi Hong Hanh Phan, and Thi Thanh Binh Huynh
    • Organizer
      The 2017 Sixth ICT International Student Project Conference
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] An Algorithm for Set-to-Set Disjoint Paths Problem in a Mobius Cube2017

    • Author(s)
      Keiichi Kaneko
    • Organizer
      2017 International Conference on Parallel and Distributed Processing Techniques and Applications
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research

URL: 

Published: 2017-04-28   Modified: 2022-02-22  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi