Packet Routing in Fixed-Connection Networks: A Survey

Grammatikakis, Miltos D.; Hsu, David; Kraetzl, M.; Sibeyn, Jop F.

doi:10.1006/jpdc.1998.1483

Cited by 76 publications

(43 citation statements)

References 308 publications

(384 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many candidates exist (see [7] for a survey). To minimize hardware cost, we restrict our attention to algorithms for the "one packet" model, in which at each step every node holds at most one packet (and consequentially each node can send at most one packet and receive at most one packet per step).…”

Section: A Routing-based Circuitmentioning

confidence: 99%

Analysis of Bernstein’s Factorization Circuit

Lenstra

Shamir

Tomlinson

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.In [1], Bernstein proposed a circuit-based implementation of the matrix step of the number field sieve factorization algorithm. These circuits offer an asymptotic cost reduction under the measure "construction cost × run time". We evaluate the cost of these circuits, in agreement with [1], but argue that compared to previously known methods these circuits can factor integers that are 1.17 times larger, rather than 3.01 as claimed (and even this, only under the non-standard cost measure). We also propose an improved circuit design based on a new mesh routing algorithm, and show that for factorization of 1024-bit integers the matrix step can, under an optimistic assumption about the matrix size, be completed within a day by a device that costs a few thousand dollars. We conclude that from a practical standpoint, the security of RSA relies exclusively on the hardness of the relation collection step of the number field sieve.

show abstract

Section: A Routing-based Circuitmentioning

confidence: 99%

Analysis of Bernstein’s Factorization Circuit

Lenstra

Shamir

Tomlinson

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Routing optimization is a well-studied subject where Wang et al [42] and Grammatikakis et al [19] provide excellent overviews of the different centralized and distributed routing algorithms. Researchers have also addressed routing in safety-critical systems [20,27].…”

Section: Brief Review Of Related Workmentioning

confidence: 99%

Design optimisation of cyber‐physical distributed systems using IEEE time‐sensitive networks

Pop

Raagaard

Craciunas

et al. 2016

IET cyber-phys. syst.

128

View full text Add to dashboard Cite

In this paper we are interested in safety-critical real-time applications implemented on distributed architectures supporting the TimeSensitive Networking (TSN) standard. The ongoing standardization of TSN is an IEEE effort to bring deterministic real-time capabilities into the IEEE 802.1 Ethernet standard supporting safety-critical systems and guaranteed Quality-of-Service. TSN will support TimeTriggered (TT) communication based on schedule tables, AudioVideo-Bridging (AVB) flows with bounded end-to-end latency as well as Best-Effort messages. We first present a survey of research related to the optimization of distributed cyber-physical systems using real-time Ethernet for communication. Then, we formulate two novel optimization problems related to the scheduling and routing of TT and AVB traffic in TSN. Thus, we consider that we know the topology of the network as well as the set of TT and AVB flows. We are interested to determine the routing of both TT and AVB flows as well as the scheduling of the TT flows such that all frames are schedulable and the AVB worst-case end-to-end delay is minimized. We have proposed an Integer Linear Programming (ILP) formulation for the scheduling problem and a Greedy Randomized Adaptive Search Procedure (GRASP)-based heuristic for the routing problem. The proposed approaches have been evaluated using several test cases.

show abstract

“…Dimension order routing has only one route for a sourcedestination pair. Bit permutation and computation [30] is a class of non-uniform traffic patterns which are very common in scientific applications, where the source node sends messages to a predefined destination. Both dimension order routing and bit permutation & communication create significant congestion under dimension order routing in the network, and when congestion occurs, the network throughput decreases precipitously.…”

Section: Traffic Patternsmentioning

confidence: 99%

TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers

Rahman

Inoguchi²,

Sato³

et al. 2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYInterconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.

show abstract

Packet Routing in Fixed-Connection Networks: A Survey

Cited by 76 publications

References 308 publications

Analysis of Bernstein’s Factorization Circuit

Analysis of Bernstein’s Factorization Circuit

Design optimisation of cyber‐physical distributed systems using IEEE time‐sensitive networks

TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers

Contact Info

Product

Resources

About