Skip to main content
SpringerLink
Log in

A Light-weight fault-tolerant routing algorithm tolerating faulty links and routers

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Faults at either the link or router level may result in the failure of the system. Fault-tolerant routing algorithms attempt to tolerate faults by rerouting packets around the faulty region. This rerouting would be at the cost of significant performance loss. The proposed algorithm in this paper is able to tolerate both faulty routers and links with negligible impact on the performance. In fact, the proposed algorithm avoids taking unnecessary longer paths and the shortest paths are always taken as long as a path exists. On the other hand, fault-tolerant routing algorithms might be based on deterministic routing in which all packets use a single path between each pair of source and destination routers. Using deterministic routing, packets reach the destination in the same order they have been delivered from the source so that no reordering buffer is needed at the destination. For improving the performance, fault-tolerant algorithms might be based on adaptive routing in which packets are delivered through multiple paths to destinations. In this case, packets should be reordered at the destinations demanding reordering buffers. The proposed algorithm can be configured in both working modes, such that it can be based on deterministic or adaptive routing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Palesi M, Daneshtalab M (2014) Routing Algorithms in Networks-on-Chip. Springer, Berlin

    Book  Google Scholar 

  2. Ni LM, McKinley PK (1993) A survey of wormhole routing techniques in direct networks. Computer 26(2):62–76

    Article  Google Scholar 

  3. Daneshtalab M, Ebrahimi M, Liljeberg P, Plosila J, Tenhunen H (2010) A low-latency and memory-efficient On-chip network. In: proceedings of the Fourth ACM/IEEE international symposium on networks-on-Chip (NOCS), pp 99–106

  4. Ebrahimi M, Daneshtalab M, Liljeberg P, Plosila J, Tenhunen H (2012) “CATRA- congestion aware trapezoid-based routing algorithm for on-chip networks”. In: Proceedings of the design, automation test in Europe conference exhibition (DATE), pp 320–325

  5. Ebrahimi M, Daneshtalab M, Liljeberg P, Plosila J, Tenhunen H (2012) “LEAR - A low-weight and highly adaptive routing method for distributing congestions in On-chip networks”, In: Proceedings of 20th euromicro international conference on parallel, distributed and network-based processing (PDP), pp 520–524

  6. Wang X, Mak T, Yingtao Jiang MY, Daneshtalab M, Palesi M (2013) On self-tuning networks-on-chip for dynamic network-flow dominance adaptation. In: proceedings of seventh IEEE/ACM international symposium on networks on chip (NoCS), pp 1–8

  7. Daneshtalab M, Ebrahimi M, Liljeberg P, Plosila J, Tenhunen H (2013) A systematic reordering mechanism for on-chip networks using efficient congestion-aware method. J Syst Archit (JSA-elsevier), 59(4–5):213–222

    Google Scholar 

  8. Ebrahimi M, Daneshtalab M, Sreejesh NP, Liljeberg P, Tenhunen H (2009) Efficient network interface architecture for network-on-chips. In: proceedings of NORCHIP, pp 1–4

  9. Fick D, DeOrio A, Hu J, Bertacco V, Blaauw D, Sylvester D (2009) Vicis: A reliable network for unreliable silicon. In: 46th ACM/IEEE design automation conference (DAC), pp 812–817

  10. Boppana RV, Chalasani S (1995) Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans Comput 44(7):848–864

    Article  MATH  Google Scholar 

  11. Sui P-H, Wang S-D (1997) An improved algorithm for fault-tolerant wormhole routing in meshes. IEEE Trans Comput 46(9):1040–1042

    Article  MathSciNet  Google Scholar 

  12. Zhang Z, Greiner A, Taktak S (2008) A reconfigurable routing algorithm for a fault-tolerant 2D-mesh network-on-Chip. In: proceedings of 45th ACM/IEEE design automation conference (DAC), pp 441–446

  13. Valinataj M, Mohammadi S, Plosila J, Liljeberg P, Tenhunen H (2011) A reconfigurable and adaptive routing method for fault-tolerant mesh-based networks-on-chip. AEU - Int J Electron Commun 65(7):630–640

    Article  Google Scholar 

  14. Wu J (2003) A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd–even turn model. IEEE Trans Comput 52(9):1154–1169

    Article  Google Scholar 

  15. Chiu G-M (2000) The odd-even turn model for adaptive routing. In: IEEE transactions on parallel and distributed systems 11(7):729–738

  16. Tsai W-C, Zheng D-Y, Chen S-J, Hu Y-H (2011) A fault-tolerant NoC scheme using bidirectional channel. In: proceedings of 48th ACM/EDAC/IEEE design automation conference (DAC), pp 918–923

  17. Koibuchi M, Matsutani H, Amano H, Mark Pinkston T (2008) A Lightweight Fault-Tolerant Mechanism for Network-on-Chip. In: proceedings of the second ACM/IEEE international symposium on networks-on-Chip (NoCS), pp 13–22

  18. Ebrahimi M, Daneshtalab M, Plosila J, Tenhunen H (2012) MAFA: adaptive fault-tolerant routing algorithm for networks-on-chip”, In: proceedings of 15th euromicro conference on digital system design (DSD), pp 201–207

  19. Fick D, DeOrio A, Chen G, Bertacco V, Sylvester D, Blaauw D (2009) A highly resilient routing algorithm for fault-tolerant NoCs. In: proceedings of design, automation test in Europe conference exhibition (DATE), pp 21–26

  20. Ebrahimi M, Daneshtalab M, Plosila J, Farhad Mehdipour (2013) MD: minimal path-based fault-tolerant routing in on-chip networks”, In: proceedings of the IEEE/ACM 18th Asia and South Pacific design automation conference (ASP-DAC), pp 35–40

  21. Ebrahimi M, Daneshtalab M, Plosila J, Tenhunen H (2013) Minimal-path fault-tolerant approach using connection-retaining structure in networks-on-chip”, In: proceedings of 7th international symposium on networks-on-Chip (NOCS), pp 1–8

  22. Ebrahimi M, Daneshtalab M, Plosila J (2013) High performance fault-tolerant routing algorithm for NoC-based many-core systems”, In: proceedings of 21th IEEE euromicro conference on Parallel, Distributed and network-based computing (PDP), pp 463–469

  23. Glass CJ, Glass CJ, Ni LM, Ni LM (1992) Maximally fully adaptive routing in 2D Meshes. In: proceedings of international conference on parallel processing, pp 101–104

  24. Glass CJ, Ni LM (1992) “The Turn Model for Adaptive Routing”. In proceedings of the 19th, annual international symposium on computer architecture pp 278–287

  25. Wang ZL, Yang M, Jiang Y, Daneshtalab M, Mak T (2013) A low cost, high performance dynamic-programming-based adaptive power allocation scheme for many-core architectures in the dark silicon Era. In: proceedings of the 11th IEEE symposium on embedded systems for real-time multimedia (ESTImedia)

  26. Carabano J, Dios F, Daneshtalab M, Ebrahimi M (2013) An exploration of heterogeneous systems. In: 2013 8th international workshop on reconfigurable and communication-centric Systems-on-Chip (ReCoSoC), pp 1–7

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, University of Turku, Turku, Finland

    Masoumeh Ebrahimi & Masoud Daneshtalab

Authors
  1. Masoumeh Ebrahimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masoud Daneshtalab
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masoumeh Ebrahimi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ebrahimi, M., Daneshtalab, M. A Light-weight fault-tolerant routing algorithm tolerating faulty links and routers. Computing 97, 631–648 (2015). https://doi.org/10.1007/s00607-013-0362-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-013-0362-9

Keywords

Mathematics Subject Classification

Search

Navigation