FPGA-Assisted Deterministic Routing for FPGAs

2019 ◽  
Author(s):  
Dario Korolija ◽  
Mirjana Stojilovic
Keyword(s):  
Deterministic Routing

Design of Router Supporting Multiply Routing Algorithm for NoC

2014 ◽  
Vol 981 ◽  
pp. 431-434
Author(s):  
Zhan Peng Jiang ◽  
Rui Xu ◽  
Chang Chun Dong ◽  
Lin Hai Cui
Keyword(s):  
Complex System ◽  
High Performance ◽  
Routing Algorithm ◽  
Network On Chip ◽  
System On Chip ◽  
Low Latency ◽  
Deterministic Routing ◽  
Key Features ◽  
Design Challenge ◽  
On Chip

Network on Chip(NoC)，a new proposed solution to solve global communication problem in complex System on Chip (SoC) design，has absorbed more and more researchers to do research in this area. Due to some distinct characteristics, NoC is different from both traditional off-chip network and traditional on-chip bus，and is facing with the huge design challenge. NoC router design is one of the most important issues in NoC system. The paper present a high-performance, low-latency two-stage pipelined router architecture suitable for NoC designs and providing a solution to irregular 2Dmesh topology for NoC. The key features of the proposed Mix Router are its suitability for 2Dmesh NoC topology and its capability of suorting both full-adaptive routing and deterministic routing algorithm.

Robust Data-Driven Vehicle Routing with Time Windows

2021 ◽  
Author(s):  
Yu Zhang ◽  
Zhenzhen Zhang ◽  
Andrew Lim ◽  
Melvyn Sim
Keyword(s):  
Time Windows ◽  
Risk Index ◽  
Decision Criterion ◽  
Wasserstein Distance ◽  
Branch And Cut ◽  
Travel Times ◽  
Robust Solution ◽  
Deterministic Routing ◽  
Service Fulfillment ◽  
Timely Delivery

On-time delivery is of utmost importance in today’s urban logistics. However, travel times are uncertain and classical deterministic routing solutions often fail to ensure timely delivery. In this paper, a robust solution that exploits travel times data to determine the best routes for maximal timely delivery is proposed. A new decision criterion is introduced, the service fulfillment risk index (sri), which accounts for both the late arrival probability and its magnitude. Together with Wasserstein distance–based ambiguity in travel times, sri can be evaluated efficiently in closed form. In addition, an exact branch-and-cut approach and a meta-heuristic algorithm are developed to minimize sri with a given travel cost. Simulation studies demonstrate that handling uncertainty improves service punctuality, and that incorporating ambiguity prevents overfitting. Most importantly, sri outperforms the canonical decision criteria of lateness probability and expected lateness duration.

Opportunistic Frame Forwarding in Wireless Mesh Networks

2015 ◽  
Vol 764-765 ◽  
pp. 941-945
Author(s):  
Shih Tsung Liang ◽  
Bo Yi Song ◽  
Yu Yao Su
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Opportunistic Routing ◽  
Wireless Channel ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Delivery Probability ◽  
Wireless Mesh ◽  
Deterministic Routing ◽  
The One

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is <em>transmitted</em> and forwarded along with a fixed and predetermined <em>path</em>, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

PERFORMANCE ANALYSIS OF DETERMINISTIC ROUTING IN WORMHOLE k-ARY n-CUBES WITH VIRTUAL CHANNELS

2002 ◽  
Vol 03 (01n02) ◽  
pp. 67-83 ◽  
Author(s):  
H. SARBAZI-AZAD ◽  
A. KHONSARI ◽  
M. OULD-KHAOUA
Keyword(s):  
Network Performance ◽  
Operating Conditions ◽  
Analytical Models ◽  
Virtual Channel ◽  
Simple Analytical Model ◽  
Simulation Experiments ◽  
Virtual Channels ◽  
Deterministic Routing ◽  
Proposed Model ◽  
Wormhole Routed

Adding virtual channels to wormhole-routed networks greatly improves performance because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Although several analytical models have been proposed in the literature for k-ary n-cubes with deterministic routing, most of them have not included the effects of virtual channel multiplexing on network performance. This paper proposes a new and simple analytical model to compute message latency in k-ary n-cubes with an arbitrary number of virtual channels. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions. The proposed model is then used to investigate the relative performance merits of two different organisations of virtual channels.

Sign in / Sign up

Export Citation Format

Share Document