We design a new oblivious routing algorithm for two-dimensional mesh-based Networks-on-Chip (NoCs) called LEF (Long Edge First) which offers high throughput with low design complexity. LEF's basic idea comes from ...
详细信息
We design a new oblivious routing algorithm for two-dimensional mesh-based Networks-on-Chip (NoCs) called LEF (Long Edge First) which offers high throughput with low design complexity. LEF's basic idea comes from conventional wisdom in choosing the appropriate dimension-order routing (DOR) algorithm for supercomputers with asymmetric mesh or torus interconnects: routing longest dimensions first provides better performance than other strategies. In LEF, we combine the XY DOR and the YX DOR. When routing a packet, which DOR algorithm is chosen depends on the relative position between the source node and the destination node. Decisions of selecting the appropriate DOR algorithm are not fixed to the network shape but instead made on a per-packet basis. We also propose an efficient deadlock avoidance method for LEF in which the use of virtual channels is more flexible than in the conventional method. We evaluate LEF against O1TURN, another effective oblivious routing algorithm, and a minimal adaptive routing algorithm based on the odd-even turn model. The evaluation results show that LEF is particularly effective when the communication is within an asymmetric mesh. In a 16 x 8 NoC, LEF even outperforms the adaptive routing algorithm in some cases and delivers from around 4% up to around 64.5% higher throughput than O1TURN. Our results also show that the proposed deadlock avoidance method helps to improve LEF's performance significantly and can be used to improve O1TURN's performance. We also examine LEF in large-scale NoCs with thousands of nodes. Our results show that, as the NoC size increases, the performance of the routing algorithms becomes more strongly influenced by the resource allocation policy in the network and the effect is different for each algorithm. This is evident in that results of middle-scale NoCs with around 100 nodes cannot be applied directly to large-scale NoCs.
Rapid developments in the field of processors and radio technology have provided the context of small sensor nodes which are able to communicate in wireless sensor networks. But data security is restricted by these fa...
详细信息
Rapid developments in the field of processors and radio technology have provided the context of small sensor nodes which are able to communicate in wireless sensor networks. But data security is restricted by these factors. An intelligent trust management plan needs to be applied for detection of the reliability of sensor nodes to distinguish between malicious nodes from other nodes. In this paper a trust-based energy-aware routing algorithm has been proposed. Considering direct and indirect trust of nodes and energy saving issue, the routing function metrics are optimized by Gravitational Search Approach. This routing method is called Energy-aware Trust-based Gravitational Search Approach (ETGSA). Simulation has been done by NS-2 and it is shown that the main characteristics such as reduction of computational overhead and increasing reliability against of attacks in the network are improved compared with other efficient algorithms in this field.
Continuous technology scaling in semiconductor industry makes the system reliability as a serious concern in the area of nanoscale computing. In this paper, a fully adaptive routing algorithm is proposed to overcome f...
详细信息
Continuous technology scaling in semiconductor industry makes the system reliability as a serious concern in the area of nanoscale computing. In this paper, a fully adaptive routing algorithm is proposed to overcome faults in NoCs (Network-on-Chip). This algorithm called DINRA-NoC (DIstiributed and New routing algorithm for NoC) is distributed, fault tolerant and congestion-aware. First, each node selects the appropriate output to route packets to neighbor routers according to the state of each link and router. Secondly, the proposed routing algorithm takes in account the status of adjacent routers traffic to update the congestion metric. DINRA-NoC does not use any VCs (Virtual Channels) and is deadlock-free. A simulation of the proposed routing algorithm has been carried out using Noxim simulator. The results show that DINRA ensures a good reliability rate despite of the presence of many faulty routers/links. In other hand, the simulation results indicate that the performance of the proposed routing algorithm surpasses the performance of existing algorithms in terms of lowering the congestion, improving average latency and increasing throughput.
Space networking has captured increasing attentions because of its wide application scenarios. Facing to the technical challenges of space networking including topology alteration, non-realtime condition capture and c...
详细信息
Space networking has captured increasing attentions because of its wide application scenarios. Facing to the technical challenges of space networking including topology alteration, non-realtime condition capture and control, and instable communication and control reliability, this article introduce software-defined networking (SDN) into space networking and proposes software-defined space networking, named SDSN. The architecture and the detailed strategy based routing algorithm are designed. SDSN has three key features: the predeterminate rules, strategy based routing algorithm, and redundant space-ground controlling strategy. These features address the three challenges pointedly. The simulation results confirm the advantages.
Efficient routing algorithms are essential to guarantee reliable communication in Vehicular Adhoc Networks (VANETs). In this paper, we present a twofold approach entailing the design of a new route metric for VANET co...
详细信息
Efficient routing algorithms are essential to guarantee reliable communication in Vehicular Adhoc Networks (VANETs). In this paper, we present a twofold approach entailing the design of a new route metric for VANET communication, which considers important parameters such as the received signal strength;transmit power, frequency and the path loss. We further present an improved genetic algorithm-based route optimization technique (IGAROT) that guarantees better routing in VANETs. We used IGAROT to determine optimal routes required to communicate road anomalies effectively between vehicles in VANETs. The performance of our proposed algorithm was compared with the well-known conventional Genetic algorithm (GA) route optimization technique under same simulation conditions. Based on the average route results obtained, our findings indicate that IGAROT provided 4.24%, 75.7% and 420% increment over the conventional GA in the low, medium and high car density scenarios, respectively. Our findings suggest that IGAROT improves road anomaly communication among vehicles thus enabling drivers to better navigate anomalous roads with the aim to reduce road-anomaly induced accidents. Further benefits of our system may include the prompt notification of road maintenance agencies concerning persisting road conditions via vehicle to infrastructure communication. (C) 2019 Karabuk University. Publishing services by Elsevier B.V.
In order to maximize the network performance of heterogeneous sensor networks and effectively control the network cost, a clustering routing algorithm based on wolf pack algorithm (CLWPA) for heterogeneous wireless se...
详细信息
In order to maximize the network performance of heterogeneous sensor networks and effectively control the network cost, a clustering routing algorithm based on wolf pack algorithm (CLWPA) for heterogeneous wireless sensor networks is proposed. Firstly, the optimal deployment of heterogeneous nodes is transformed into a mixed integer programming problem. The approximate optimal solution of the problem is obtained by through the wolf pack algorithm (WPA) which improved by logistic function and levy flight then a heterogeneous network routing algorithm based on the improved wolf pack algorithm (LWPA) is proposed. Secondly, in order to solve the problem of fixed path in LWPA routing algorithm, the concept of edge degree is introduced to improve DEEC algorithm. The improved DEEC algorithm (IDEEC) is used to dynamically cluster common nodes in heterogeneous networks, and the data transmission mode is carried out after the clustering mode set. Finally, through simulation analysis, compared with other three heterogeneous network routing algorithms, CLWPA algorithm effectively prolongs the network's stable period and lifetime, and the energy consumption is more balanced. (C) 2019 Elsevier B.V. All rights reserved.
A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban envir...
详细信息
A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban environment, the nodes will have certain social attributes. In many cases, a node can decide whether to execute the routing policy or not. Due to the limited resources and poor social relationships, nodes may be unwilling to forward messages from other nodes and have strong motivation to implement selfish policies. As a result, increased network latency reduces message delivery rates and affects the overall network performance. In order to solve this problem, we propose a perceptual routing protocol to promote node cooperation from the perspective of game theory. Specifically, We introduce the concept of virtual currency and construct a price function, and nodes can obtain a certain virtual currency through cooperation. In the process of message forwarding, we consider the change of link degree and energy of node (the energy exists in the form of electricity in this article), and use them as factors of the trading node quotation. The trading node finally makes it through the multiple rounds of bargaining games, so that the proposed game between both sides reaches the Nash equilibrium. Experiments show that the algorithm outperforms Epidemic, EPSR, MINEIRO and ICRP algorithms in terms of delivery rate, average latency and energy consumption. According to the simulation experiments, the average delivery ratio of GIR algorithm is 0.68, which is 13% higher than that of the epidemic algorithm. In terms of average delay, 7% is better than ICRP algorithm.
In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle ...
详细信息
In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle a high traffic load. In this paper, an E-XY (Entropy based XY) routing algorithm is proposed to generate information about the adjacent router based on previously communicated packets. Tests have been carried out on a mesh topology of 8x8 simulated using Omnet++ 4.4.1 using HNOCS version. Different types of traffic have been considered for result computation including uniform, bit complement, neighbour and tornado. The proposed algorithm is compared with other routing algorithms including XY, IX/Y and Odd Even. Results demonstrate that the proposed algorithm is comparable to XY routing algorithm up to the load factor of 0.8 and performs well than the XY, IX/Y and Odd Even routing algorithms with the increase in load.
Power consumption has become a key issue during the last few years and that of Internet in particular, is not negligible. With the advent of cloud computing and the exponential growth of traffic with it, power consump...
详细信息
ISBN:
(纸本)9781728116860
Power consumption has become a key issue during the last few years and that of Internet in particular, is not negligible. With the advent of cloud computing and the exponential growth of traffic with it, power consumption has become an increasing concern for data centers. While power-aware algorithms have been investigated quite well in the wireless context, their developments in wire-line networks, especially in traffic-intensive data centers remain to be explored. In this paper, we propose a novel power-aware flow routing algorithm on the premise of performance for fat-tree data center topology and call it GreenFlow. With a maximum link utilization threshold, we route flows as centrally as possible and turn off switches without traffic flowing through them. Moreover, we take load balancing into consideration when rerouting flows on the open devices and their corresponding available paths. Verified by simulation results, our algorithm performs well in typical traffic patterns including uniform traffic, mice-elephant traffic and hotspot traffic. Earning about 20%similar to 58% power reduction when the load is below 0.45, the performance of GreenFlow is still comparable to that of the current best-performing routing algorithms, such as CONGA and LetFlow.
Network-on-Chip (NoC) is widely accepted as an advanced on-chip system capable of replacing the traditional bus structure. NoC is promising as a solution for future many-core chip processors with better scalability an...
详细信息
ISBN:
(纸本)9781728148823
Network-on-Chip (NoC) is widely accepted as an advanced on-chip system capable of replacing the traditional bus structure. NoC is promising as a solution for future many-core chip processors with better scalability and flexibility. Many routing algorithms have been proposed to improve the performance of NoCs. Some routing algorithms only have superiority under a specific traffic pattern, but they can have poor performance under other traffic patterns. Compared to uniform traffic, some complex hotspot patterns are closer to reality. Traffic-aware routing algorithms are designed to solve this problem. These traffic-aware routing algorithms commonly utilize virtual channels (VC) or routing tables to predict future traffic distribution, which will have large power and hardware overheads that cannot be ignored. To solve these problems, a VC-free traffic-pattern-aware routing algorithm based on West-first routing and North-last routing is proposed in this paper. This algorithm contains a hotspot node and hotspot pattern detecting mechanism, which were designed to improve the performance of NoCs under different traffic patterns. A hotspot information block which has a small cost is connected to each router to deal with the hotspot information and detect the hotspot patterns. The simulation results show that the proposed routing algorithm combines the advantages of the two existing routing algorithms and has better performance when considering different traffic patterns.
暂无评论