Journal ArticleDOI
Packet Routing in Fixed-Connection Networks
TLDR
This work focuses on (partial) permutation, k-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results.About:
This article is published in Journal of Parallel and Distributed Computing.The article was published on 1998-11-01. It has received 103 citations till now. The article focuses on the topics: Static routing & Dynamic Source Routing.read more
Citations
More filters
Journal ArticleDOI
Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks
TL;DR: The authors have proposed an integer linear programming formulation for the scheduling problem and a greedy randomised adaptive search procedure-based heuristic for the routing problem that have been evaluated using several test cases.
Journal ArticleDOI
Design optimization of TTEthernet-based distributed real-time systems
TL;DR: This paper focuses on the design optimization of TTEthernet protocol, a deterministic, synchronized and congestion-free network protocol based on the Ethernet standard and compliant with the ARINC 664 Specification Part 7, and proposes a Tabu Search-based metaheuristic for this optimization problem.
Journal ArticleDOI
Routing optimization of AVB streams in TSN networks
TL;DR: A search-space reduction technique and a Greedy Randomized Adaptive Search Procedure-based heuristic are proposed for this routing optimization problem of the AVB streams such that all frames are schedulable and their worst-case end-to-end delay is minimized.
Proceedings ArticleDOI
Optimal load-balancing
TL;DR: Whether this particular method of load-balancing is optimal in the sense that it achieves the highest throughput for a given capacity of interconnect is explored.
Proceedings ArticleDOI
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
TL;DR: This work describes and provides optimal routing algorithms whose rate per node is equal to this upper bound on the network capacity and proposes a particular combination of two routing algorithms, the first being optimal when there are no node failures at all and the second being appropriate when the probability of node failure is high.
References
More filters
Book
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Proceedings ArticleDOI
Sorting networks and their applications
TL;DR: To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
Journal ArticleDOI
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
TL;DR: In this article, a deadlock-free routing algorithm for arbitrary interconnection networks using the concept of virtual channels is presented, where the necessary and sufficient condition for deadlock free routing is the absence of cycles in a channel dependency graph.
Book
Deadlock-free message routing in multiprocessor interconnection networks
TL;DR: A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels, which is used to develop deadlocked routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.