scholarly journals A Period-Aware Routing Method for IEEE 802.1Qbv TSN Networks

Electronics ◽  
2020 ◽  
Vol 10 (1) ◽  
pp. 58
Author(s):  
Kai Huang ◽  
Jingkang Wu ◽  
Xiaowen Jiang ◽  
Dongliang Xiong ◽  
Kaitian Huang ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Traffic Load ◽  
Bandwidth Utilization ◽  
Shortest Path Routing ◽  
Periodic Flows ◽  
Scheduled Traffic ◽  
Transmission Schedule ◽  
Low Jitter ◽  
Time Critical ◽  
Load Balanced

The IEEE 802.1Qbv standard provides deterministic delay and low jitter guarantee for time-critical communication using a precomputed cyclic transmission schedule. Computing such transmission schedule requires routing the flows first, which significantly affects the quality of the schedule. So far off-the-shelf algorithms like load-balanced routing, which minimize the maximum scheduled traffic load (MSTL), have been used to accommodate more time-triggered traffic. However, they do not consider that the bandwidth utilization of periodic flows is decentralized and their criteria for bottleneck of scheduling are imprecise. In this paper, we firstly explore the combinability among different periods of flows, which can measure their ability to share bandwidth without conflict. Then, we propose a novel period-aware routing algorithm to reduce the scheduling bottleneck, thus more flows can be accommodated. The experiment results show that the success rate of scheduling is significantly improved compared to shortest path routing and load balanced routing.

scholarly journals Load-balanced routing algorithm for Network-on-Chip employing fair arbiter

2021 ◽  
Vol 1871 (1) ◽  
pp. 012117
Author(s):  
Lu Liu ◽  
Yanfei Yang ◽  
Qianqian Lei ◽  
Huhu Wang ◽  
Song Lixun
Keyword(s):  
Routing Algorithm ◽  
Network On Chip ◽  
On Chip ◽  
Load Balanced

A Recursive Shortest Path Routing Algorithm With Application for Wireless Sensor Network Localization

2016 ◽  
Vol 16 (11) ◽  
pp. 4631-4637 ◽  
Author(s):  
Juan Cota-Ruiz ◽  
Pablo Rivas-Perea ◽  
Ernesto Sifuentes ◽  
Rafael Gonzalez-Landaeta
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Sensor Network Localization ◽  
Shortest Path Routing ◽  
Network Localization

scholarly journals SDN-Based Routing for Backhauling in Ultra-Dense Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 23 ◽  
Author(s):  
Dania Marabissi ◽  
Romano Fantacci ◽  
Linda Simoncini
Keyword(s):  
Mobile Networks ◽  
Routing Algorithm ◽  
Traffic Load ◽  
Convergence Time ◽  
Routing Schemes ◽  
Traffic Routing ◽  
Fifth Generation ◽  
Central Controller ◽  
And Control ◽  
Control Traffic

Ultra-Dense Network (UDN) deployment is considered a key element to achieve the requested capacity in future fifth-generation (5G) mobile networks. Backhaul networks in UDNs are formed by heterogeneous links with multi-hop connections and must handle massive traffic. Backhauling in future 5G networks may represent the capacity bottleneck. Therefore, there is the need for efficient and flexible routing schemes able to handle the dynamism of the traffic load in capacity-limited networks. Toward this goal, the emerging Software-Defined Network (SDN) paradigm provides an efficient solution, transferring the routing operation from the data plane switches to a central controller, thus achieving more flexibility, efficiency, and faster convergence time in comparison to conventional networks. This paper proposes and investigates an SDN-approach for an efficient routing in a capacity-limited backhaul network that carries data and control traffic of a heterogeneous UDN. The routing algorithm is centralized in the SDN controller and two different types of traffic flow are considered: data and control plane coordination traffic. The goal is to reduce or even to avoid the amount of traffic that the backhaul network is not able to support, distributing in a fair way the eventual lack of bandwidth among different access points. Simulation results show that with the considered approach the performance significantly improves, especially when there is an excess of traffic load in the network. Moreover, thanks to the SDN-based design, the network can reconfigure the traffic routing depending on the changing conditions.

scholarly journals A Network Adaptive Fault-Tolerant Routing Algorithm for Demanding Latency and Throughput Applications of Network-on-a-Chip Designs

Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1076 ◽  
Author(s):  
Zulqar Nain ◽  
Rashid Ali ◽  
Sheraz Anjum ◽  
Muhammad Khalil Afzal ◽  
Sung Won Kim
Keyword(s):  
Fault Tolerant ◽  
Current System ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Processing Elements ◽  
System On A Chip ◽  
On Chip ◽  
Network On A Chip

Scalability is a significant issue in system-on-a-chip architectures because of the rapid increase in numerous on-chip resources. Moreover, hybrid processing elements demand diverse communication requirements, which system-on-a-chip architectures are unable to handle gracefully. Network-on-a-chip architectures have been proposed to address the scalability, contention, reusability, and congestion-related problems of current system-on-a-chip architectures. The reliability appears to be a challenging aspect of network-on-a-chip architectures because of the physical faults introduced in post-manufacturing processes. Therefore, to overcome such failures in network-on-a-chip architectures, fault-tolerant routing is critical. In this article, a network adaptive fault-tolerant routing algorithm is proposed, where the proposed algorithm enhances an efficient dynamic and adaptive routing algorithm. The proposed algorithm avoids livelocks because of its ability to select an alternate outport. It also manages to bypass congested regions of the network and balances the traffic load between outports that have an equal number of hop counts to its destination. Simulation results verified that in a fault-free scenario, the proposed solution outperformed a fault-tolerant XY by achieving a lower latency. At the same time, it attained a higher flit delivery ratio compared to the efficient dynamic and adaptive routing algorithm. Meanwhile, in the situation of a faulty network, the proposed algorithm could reach a higher flit delivery ratio of up to 18% while still consuming less power compared to the efficient dynamic and adaptive routing algorithm.

OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES

2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG
Keyword(s):  
Shortest Path ◽  
Time Complexity ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Optimum Time ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Bisection Width ◽  
Twisted Cube ◽  
Twisted Cubes

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.

Sign in / Sign up

Export Citation Format

Share Document