ERA: An Efficient Routing Algorithm for Power, Throughput and Latency in Network-on-Chips

Sharma, Varsha; Agarwal, Rekha; Gaur, Manoj Singh; Laxmi, Vijay; Vineetha, V

doi:10.1007/978-3-642-15672-4_41

Cited by 4 publications

(3 citation statements)

References 14 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Taking average value of performance metrics power, latency and throughput into account, a parameter called power-performance factor is defined in [21]. Derived from average delay and average throughput, a similar parameter, which is called performance factor, is adopted in this paper to evaluate the performance of a NoC.…”

Section: Robustness Evaluation Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks

Fang

Han

et al. 2013

2013 IEEE Eighth International Conference on Networking, Architecture and Storage

View full text Add to dashboard Cite

The attacks such as Denial of Service (DoS) violate the security of Network-on-Chip (NoC) which emerges as a promising solution for multi-core system. In this paper, we explore the robustness of mesh-based NoC architecture under various flooding-based DoS attacks. Simulation results reveal that the robustness of NoC architecture can be correlated with parameters such as routing algorithm, the number and positions of attacked nodes. It indicates that deterministic routing algorithm xy will result in less performance degradation than using other four adaptive routing algorithms studied in this paper when the attack traffic rate is lower than 0.65. However, the opposite conclusion can be made if much higher attack traffic rate is used. The performance degradation would escalate with the increasing number of attacked nodes. Moreover, the locations of attacked nodes will have an impact on the degree of performance degradation. Last but not least, some design guidelines for NoC against DoS attacks are proposed.

show abstract

Section: Robustness Evaluation Methodsmentioning

confidence: 99%

“…They are one deterministic routing xy, four adaptive routing algorithms odd-even, west-first, north-last and negative-first respectively. Those routing algorithms are selected due to that they are deadlock-free and widely used in academia for performance comparison [17]- [21].…”

Section: B Routing Algorithmmentioning

confidence: 99%

Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks

Fang

Han

et al. 2013

2013 IEEE Eighth International Conference on Networking, Architecture and Storage

View full text Add to dashboard Cite

show abstract

“…Sharma, et al [25] provided a routing algorithm for WSNs. The algorithm includes clustering in WSN called Efficient Routing Algorithm (ERA) routing steps.…”

Section: Related Workmentioning

confidence: 99%

Cluster Head Selection and Routing Protocol for Wireless Sensor Networks (WSNs) Based on Software-Defined Network (SDN) Via Game of Theory

Sefati¹,

Tabrizi²

2021

JEEE

View full text Add to dashboard Cite

There is a way to prolong the life of sensor networks according to which a hierarchical routing algorithm is used intelligently, which employs all network elements in data transmission. Clustering the nodes is one of the best methods that can significantly increase the network life. Making a cluster, selecting a Cluster Head (CH) and data transmission in Wireless Sensor Network (WSN) are the issues that affect energy consumption. Software-Defined Networks (SDN) are a modern network architecture that distinguishes the network control panel from the data plate also this architecture cause the network utilizing is increased, and the operational cost is reduced. This method also causes creativity and perfection in the network area. Moreover, the possibility of implementing management protocols, including traffic management, which is an inevitable part of networks, can be implemented in SDN with a higher level of flexibility. In this paper, the CH has selected trough game theory, which sends data with the help of game theory rewards and calculating the geographical location of other nodes. Then, high-priority data is sent according to the proposed algorithm with the help of game theory. The simulation results in NS3 software show that the proposed method has obtained acceptable results compared with Artificial Bee Colony algorithm (ABC), Genetic Algorithm (GA), Cuckoo Search algorithm (CS), Firefly algorithm (FA) and Grey Wolf Optimization Algorithm (GWO).

show abstract

A highly efficient dynamic router for application-oriented network on chip

Wang

et al. 2018

J Supercomput

View full text Add to dashboard Cite

ERA: An Efficient Routing Algorithm for Power, Throughput and Latency in Network-on-Chips

Cited by 4 publications

References 14 publications

Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks

Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks

Cluster Head Selection and Routing Protocol for Wireless Sensor Networks (WSNs) Based on Software-Defined Network (SDN) Via Game of Theory

A highly efficient dynamic router for application-oriented network on chip

Contact Info

Product

Resources

About