FADyAD- Fault and congestion aware routing algorithm based on DyAD algorithm

Mehranzadeh, Amin; Khademzadeh, Ahmad; Mehran, Armin

doi:10.1109/istel.2010.5734036

Cited by 13 publications

(17 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MoNoC, as the majority of works presented in this section (e.g. [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30]), employs distributed monitoring based on communicating pairs of PEs, being scalable, supporting the requirements of the large amount of modules of recent and future systems.…”

Section: Related Work and Proposed Approachmentioning

confidence: 99%

See 1 more Smart Citation

MoNoC: A monitored network on chip with path adaptation mechanism

Moreno

Webber

Marcon

et al. 2014

Journal of Systems Architecture

View full text Add to dashboard Cite

Section: Related Work and Proposed Approachmentioning

confidence: 99%

“…[3,4,18,20]), throughput increase (e.g. [3,4,19,25]) and energy consumption or power dissipation reduction (e.g. [5,12,28,30]).…”

Section: Related Work and Proposed Approachmentioning

confidence: 99%

MoNoC: A monitored network on chip with path adaptation mechanism

Moreno

Webber

Marcon

et al. 2014

Journal of Systems Architecture

View full text Add to dashboard Cite

“…Generally, there are two main categories of these algorithms: 1) turn model based [4][5][6] and 2) virtual channels (VCs) [7] based fault-tolerant routing algorithms.…”

Section: Related Workmentioning

confidence: 99%

“…The turn model based fault-tolerant routing algorithms [4][5][6] place restrictions on the routing function. The restrictions prohibit particular turns next to the faulty region.…”

Section: Turn Model Based Fault-tolerant Routingmentioning

confidence: 99%

See 1 more Smart Citation

ACO-based fault-aware routing algorithm for Network-on-Chip systems

Lin

Hsin

Chang

et al. 2013

SiPS 2013 Proceedings

View full text Add to dashboard Cite

With the shrinking size of circuits and the scaling of Network-on-Chip (NoC), the on-chip components will have a higher chance to fail. The on-chip failures can cause traffic congestion and even system crash. To overcome this problem, the NoC routing algorithm should be implemented with fault-tolerant capability. Inspired by the fault-tolerant behavior of ant colony consisting of three steps: Encounter, Search, and Select, we propose Ant Colony Optimizationbased Fault-aware Routing (ACO-FAR) algorithm for traffic balancing. To effectively forward the packets to a non-faulty region, three mechanisms of ACO-FAR correspond to the three-step behaviors of ants are proposed in this work. The simulation results show that proposed ACO-FAR has higher throughput than related works by 12.5%-77.7%. Also, this routing method improves the reachable packet ratio to 99.50%-99.98% and the distribution of traffic load in the faulty network.

show abstract

Fine-Grained Fault-Tolerant Adaptive Routing for Networks-on-Chip

Liu

Harkin

Maguire

et al. 2015

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Wireless sensor networks have become incredibly popular due to the Internet of Things' (IoT) rapid development. IoT routing is the basis for the efficient operation of the perception-layer network. As a popular type of machine learning, reinforcement learning techniques have gained significant attention due to their successful application in the field of network communication. In the traditional Routing Protocol for lowpower and Lossy Networks (RPL) protocol, to solve the fairness of control message transmission between IoT terminals, a fair broadcast suppression mechanism, or Drizzle algorithm, is usually used, but the Drizzle algorithm cannot allocate priority. Moreover, the Drizzle algorithm keeps changing its redundant constant k value but never converges to the optimal value of k. To address this problem, this paper uses a combination based on reinforcement learning (RL) and trickle timer. This paper proposes an RL Intelligent Adaptive Trickle-Timer Algorithm (RLATT) for routing optimization of the IoT awareness layer. RLATT has triple-optimized the trickle timer algorithm. To verify the algorithm's effectiveness, the simulation is carried out on Contiki operating system and compared with the standard trickling timer and Drizzle algorithm. Experiments show that the proposed algorithm performs better in terms of packet delivery ratio (PDR), power consumption, network convergence time, and total control cost ratio.

show abstract

FADyAD- Fault and congestion aware routing algorithm based on DyAD algorithm

Cited by 13 publications

References 16 publications

MoNoC: A monitored network on chip with path adaptation mechanism

MoNoC: A monitored network on chip with path adaptation mechanism

ACO-based fault-aware routing algorithm for Network-on-Chip systems

Fine-Grained Fault-Tolerant Adaptive Routing for Networks-on-Chip

Contact Info

Product

Resources

About