Improving Non-minimal and Adaptive Routing Algorithms in Slim Fly Networks

2017 ◽  
Author(s):  
Pedro Yebenes ◽  
Jesus Escudero-Sahuquillo ◽  
Pedro Javier Garcia ◽  
Francisco J. Quiles ◽  
Torsten Hoefler
Keyword(s):  
Adaptive Routing ◽  
Routing Algorithms

scholarly journals Adaptive Routing Algorithms and Implementation for TESH Network

2013 ◽  
Vol 05 (01) ◽  
pp. 34-49 ◽  
Author(s):  
Yasuyuki Miura ◽  
Masahiro Kaneko ◽  
M. M. Hafizur Rahman ◽  
Shigeyoshi Watanabe
Keyword(s):  
Adaptive Routing ◽  
Routing Algorithms

Comparative Performance Analysis of 
Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based 
Network-On-Chip

2021 ◽  
Vol 20 (3) ◽  
pp. 1-6
Author(s):  
Mohammed Shaba Saliu ◽  
Muyideen Omuya Momoh ◽  
Pascal Uchenna Chinedu ◽  
Wilson Nwankwo ◽  
Aliu Daniel
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Injection Rate ◽  
Network On Chip ◽  
Routing Algorithms ◽  
Comparative Performance ◽  
Traffic Pattern ◽  
Mesh Topology ◽  
Similar Vein ◽  
On Chip

Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.

A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes

2005 ◽  
Vol 15 (01n02) ◽  
pp. 153-168 ◽  
Author(s):  
A. KHONSARI ◽  
H. SARBAZI-AZAD ◽  
M. OULD-KHAOUA
Keyword(s):  
Routing Algorithm ◽  
Queueing Systems ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Performance Model ◽  
Deadlock Detection ◽  
Impatient Customers ◽  
Simulation Experiments ◽  
Proposed Model ◽  
Fully Adaptive

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

RELIABILITY PERFORMANCE COMPARISON OF ADAPTIVE ROUTING ALGORITHMS IN A TACTICAL WIRELESS TELEPHONE NETWORK

1996 ◽  
Vol 03 (04) ◽  
pp. 353-363 ◽  
Author(s):  
CELT M. SCHIRA
Keyword(s):  
Wireless Systems ◽  
Adaptive Routing ◽  
Transient Behavior ◽  
Performance Comparison ◽  
Routing Algorithms ◽  
Network Configuration ◽  
Call Blocking ◽  
Switched Network ◽  
Reliability Performance ◽  
Increasing Load

This paper compares the reliability performance of five adaptive and two fixed routing algorithms in the context of a simplified military wireless network. The network is abstracted as a circuit switched network where the connectivity can change. The five algorithms are shown to differ widely in their sensitivity to the gain parameter, transient behavior and response to increasing load or lost trunk capacity. All the adaptive algorithms had a higher transient call blocking ratio under general overload conditions than an optimized fixed algorithm where the originating switch retains supervision of the call. This is consistent with the philosophy of network design that adaptive routing is most valuable when the network configuration is not fully known or when local overloads exist but additional capacity is available elsewhere. These results are applicable to commercial as well as military wireless systems. Interference on a wireless connection can lead to changes in network topology, or a local overload may exist at a congested node, creating the conditions where adaptive routing algorithms are useful.

Sign in / Sign up

Export Citation Format

Share Document