Deterministic routing

In telecommunications, deterministic routing is the advance determination of the routes between given pairs of nodes. Examples: 1. * In a network…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

An nDT torus is a topology where each node comprises 2 identical (n+1)‐port communication cards interconnected by 1 port. By…

2016

Hybrid wired-wireless Network-on-Chip (WiNoC) has emerged as an alternative solution to the poor scalability and performance…

2013

The design of efficient communication networks is a challenging task for modern vehicle development. Due to novel technologies…

2009

An image processing apparatus reads and processes images on the documents successively presented to an original image reading…

2009

In this paper we present high performance dynamically allocated multi-queue (DAMQ) buffer schemes for fault tolerance systems on…

2006

Many Internet applications and workflow systems employ multi-tier software architectures. The performance of such multi-tier…

2000

A deterministic fault-tolerant wormhole routing algorithm is presented for mesh networks in this paper. The proposed algorithm…

1994

We consider the problem of permutation routing on a star graph, an interconnection network which has better properties than the…

1994

Abstract In this paper the properties of paths in a star graph are investigated through the analysis of the corresponding star…

1993

In this paper we introduce a new derandomization technique for mesh-connected arrays of processors that allows us to convert…