In fat-tree data center networks, routing a packet from its source to destination includes two phases, upstream (i.e. from source to watershed switch) and downstream (i.e. from watershed switch to destination). The th...
详细信息
ISBN:
(纸本)9781509013289
In fat-tree data center networks, routing a packet from its source to destination includes two phases, upstream (i.e. from source to watershed switch) and downstream (i.e. from watershed switch to destination). The throughput/non-blocking performance of networks hinges much on the effects of two phases above. In this paper, we propose a new routing algorithm called Global Round Robin (GRR) for fat-tree data center networks. In the upstream of GRR, each packet is sent to a toppest switch based on the GRR relationship between its source and toppest switches. Then the packet can arrive at a toppest switch in a single time slot without any blocking and buffering en route. In the downstream of GRR, the packet is routed to its destination using self-routing. The simulation results show that GRR provides the best delay/throughput performance among the existing routing algorithms for data center networks.
Even though the Reactive Dynamic Source routing protocol (RDSR) has been shown via simulations to be mostly efficient among all the existed routing protocols, it increases transmission delay. To overcome the above dra...
详细信息
ISBN:
(纸本)078039335X
Even though the Reactive Dynamic Source routing protocol (RDSR) has been shown via simulations to be mostly efficient among all the existed routing protocols, it increases transmission delay. To overcome the above drawback in the Reactive Ad Hoc routing protocol, this paper proposes an enhanced reactive Ad Hoc network routing protocol: ERDSR (Enhanced Reactive Dynamic Source routing Protocol). ERDSR chooses the route by using the bandwidth and the number of hops of the available paths, and regulates the value of Send_Timeout dynamically. Compared with RDSR by using ns-2 under various environments, ERDSR reduces the transmission delay and the average path length, and significantly improves the packet delivery ratio.
In this paper, we suggest a novel routing algorithm for Network-on-Chip (NoC) based on multilevel congestion control (MLCC). MLCC improves the routing efficiency when NoC is in moderate or severe congestion level. MLC...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we suggest a novel routing algorithm for Network-on-Chip (NoC) based on multilevel congestion control (MLCC). MLCC improves the routing efficiency when NoC is in moderate or severe congestion level. MLCC decides how to do congestion control depending on the different congestion level of the routers. Our experimental results show that MLCC achieves significant better performance than other traditional routing algorithms under uniform and transpose traffic.
A new routing algorithm, RABA, is proposed in this paper. It seeks the shortest path between cluster head and Base Station by Ant Colony Optimization (ACO). The cluster head far away from Base Station transmits messag...
详细信息
ISBN:
(纸本)9783037853122
A new routing algorithm, RABA, is proposed in this paper. It seeks the shortest path between cluster head and Base Station by Ant Colony Optimization (ACO). The cluster head far away from Base Station transmits message along the shortest path, therefore reducing the transmission path length and lowering the node energy consumption. The simulation compared with LEACH shows that this algorithm can reduce routing length effectively and prolong network lifetime, providing more high quality of service.
With the development of wireless communication technology and the Industrial Internet, Software Defined Network (SDN) technology has been introduced to wireless sensor networks due to its agility and flexibility. This...
详细信息
ISBN:
(纸本)9798350349184;9798350349191
With the development of wireless communication technology and the Industrial Internet, Software Defined Network (SDN) technology has been introduced to wireless sensor networks due to its agility and flexibility. This meets the potential scalability and flexibility requirements of the Internet of Things. Thus, a new Industrial Internet architecture, called SDN-WSN, was formed. As the scale of SDN-WSN increases, efficient routing protocols with low latency and high security are required, while the standard routing protocol of SDN is still vulnerable to dynamic changes in traffic control rules, especially when the network is under attack. To address the above issues, a network node credibility evaluation model based on D-S evidence theory was constructed to evaluate the trust value of wireless sensor network nodes. A trustworthy secure routing algorithm based on Q-learning (QTSRA) was proposed. This method extracts knowledge from historical traffic demands by interacting with the underlying network environment to evaluate the trustworthiness of network nodes. Simultaneously, it implements dynamic optimising routing strategies based on deep reinforcement learning algorithms. We conducted simulation experiments for several network performance metrics, and the results showed that the proposed QTSRA routing algorithm exhibited good performance. In most of the cases, the QTSRA had an improved relative performance gain as compared to the traditional AODV and OLSR routing algorithms.
A radial increment WSN routing algorithm(RIRA) is proposed to reduce energy consumption and improve transmission efficiency caused by complex environment and narrow tunnel of deep mine, in which the wired network layo...
详细信息
ISBN:
(纸本)9781509030255
A radial increment WSN routing algorithm(RIRA) is proposed to reduce energy consumption and improve transmission efficiency caused by complex environment and narrow tunnel of deep mine, in which the wired network layout is limited. Multi-hop routing methods between clusters can reduce energy consumption. A weighting formula is constructed to select cluster heads, the greater the weight, the more likely to become the final cluster head. The smaller the cluster near Sink, the more the number of clusters, which can share data to the Sink by a number of cluster heads, effectively balancing the energy consumption and ensuring the reliability of data transmission. The simulation results show that the RIRA algorithm can delay the death time of the first node, balance cluster head energy, prolong the network lifetime, and improve robustness of the network.
Network on chip (NoC) is an emerging area and recognized as the future methodology for chip design. Provision of QoS in network on chip is a challenging problem and receives much attention recently. A QoS routing sche...
详细信息
ISBN:
(纸本)9781424438686
Network on chip (NoC) is an emerging area and recognized as the future methodology for chip design. Provision of QoS in network on chip is a challenging problem and receives much attention recently. A QoS routing scheme is proposed to support various traffic with different QoS requirements in the interconnection networks of NoC Specifically, three distributed QoS routing algorithms are developed based on different blocking handling methods. The algorithms use local information and are proven to be deadlock free and livelock free. Various strategies to handle blocking are utilized to lower the call failure rate. Simulations are carried on 3D torus topology The results show that the proposed algorithms increase the network capacity by 30-40% (compared with the dimension order algorithm) and by 20-30% (compared with Duato's algorithm).(1)
This paper further analyzes the energy consumption model of the LEACH protocol, and proposes a routing algorithm for wireless sensor networks based on energy balance. It uses a more reasonable clustering method;thereb...
详细信息
ISBN:
(纸本)9780769547923
This paper further analyzes the energy consumption model of the LEACH protocol, and proposes a routing algorithm for wireless sensor networks based on energy balance. It uses a more reasonable clustering method;thereby it can further balance energy consumption of the network. In this algorithm the cluster head periodically compute the residual energy of all of members in each work cycle. It takes into full account the residual energy of nodes to determine the route. It chooses an appropriate route under the premise that transmission efficiency and network energy consumption are balanced. Simulation experiments results show that the routing algorithm based on energy balance proposed by this paper can balance the relationship of routing and energy consumption, and can prolong the network lifetime.
In the current era, with technology scaling heading towards deeper submicron, system-on-chip designs have traversed from basic CISC and RISC architectures to intricated multi-core systems with higher communication req...
详细信息
ISBN:
(纸本)9781538646496
In the current era, with technology scaling heading towards deeper submicron, system-on-chip designs have traversed from basic CISC and RISC architectures to intricated multi-core systems with higher communication requirements. Network-on-chip architectures dawned as a favorable solution for the forthcoming system-on-chip communication architecture designs, having said that, the routing algorithms of the network-on-chip architecture are confronted with great challenges. To address the shortcomings of the current routing algorithms, a new deterministic routing algorithm: Encircle routing is proposed in this paper. In the proposed algorithm, the traffic heap is deflected from the center of the network and distributed to the entire network, which in turn helps to improve the overall system performance. Simulation of the proposed Encircle routing algorithm and two existing routing algorithms has been carried out using NIRGAM simulator. Simulation results indicate that the performance of the Encircle routing algorithm surpasses the performance of existing algorithms in terms of lowering the congestion at the center of the network and improving average latency.
In order to establish a trusted and secure wireless mesh network, routing protocols should not only ensure the integrity, confidentiality and authentication, but also take into consideration the fact that the applicat...
详细信息
ISBN:
(纸本)9781424446681
In order to establish a trusted and secure wireless mesh network, routing protocols should not only ensure the integrity, confidentiality and authentication, but also take into consideration the fact that the application of routing strategies should not impact the performance of routing protocols to a severe extent. This paper adopts Node's Trust as a routing parameter, and some improvements are made for the initialization and convergence rate of basic ant colony algorithm. Thereby an ant-based trusted routing algorithm for wireless mesh networks is proposed. The experimental results indicate the proposed algorithm achieves improvements in such aspects as end-to-end delay, packet delivery ratio and routing overhead compared with typical DSR protocol and AODV protocol.
暂无评论