Skip to search formSkip to main contentSkip to account menu

Deterministic routing

In telecommunications, deterministic routing is the advance determination of the routes between given pairs of nodes. Examples: 1. * In a network… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
CodeDatabaseNetwork switchRouting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Configuration and Routing Effects on the SET Propagation in Flash-Based FPGAs
New insights on SET propagation in flash-based FPGAs are investigated, with regards to their technology and unique non-volatile… 
2008
2008
Mesh-of-tree deterministic routing for network-on-chip architecture
Network-on-Chip (NoC) is a new paradigm for designing future SoCs. It supports high degree of reusability, scalability, and… 
2007
2007
Modeling and Predicting End-to-End Response Times in Multi-tier Internet Applications
Many Internet applications employ multi-tier software architectures. The performance of such multi-tier Internet applications is… 
Highly Cited
2005
Highly Cited
2005
Communication and task scheduling of application-specific networks-on-chip
The objective of the paper is to introduce a novel energy-aware scheduling (EAS) algorithm which statically schedules application… 
2005
2005
Degree-optimal deterministic routing for P2P systems
We propose routing schemes that optimize the average number of hops for lookup requests in peer-to-peer (P2P) systems without… 
2004
2004
Flit admission in on-chip wormhole-switched networks with virtual channels
Flit-admission solutions for wormhole switches must minimize the complexity of the switches in order to achieve cheap… 
2004
2004
The heavy-traffic bottleneck phenomenon under splitting and superposition
2003
2003
Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Learning
An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in… 
1993
1993
Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays ofProcessors
In this paper we introduce a new derandomization technique for mesh-connected arrays of processors that allows us to convert… 
Highly Cited
1988
Highly Cited
1988
Routing and Sorting on Mesh-Connected Arrays
The problems of sorting and routing on n 1×... × n r mesh-connected arrays of processors are studied. A new sorting algorithm for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)