Optimal routing in double loop networks

DOI10.1016/J.TCS.2007.04.002MaRDI QIDQ995561zbMATH OpenOpenAlexFDO

Authors Jaime Gutierrez, Álvar Ibeas, Domingo Gomez

Publication date 3 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.04.002

zbMATH Keywords

latticesCayley graphsshortest pathclosest vector problemdouble loop networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 2143949
• An optimal message routing algorithm for double-loop networks
• ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
• An optimal fault-tolerant routing algorithm for double-loop networks
• scientific article; zbMATH DE number 432994
• An efficient algorithm to find optimal double loop networks
• Designing of optimal double loop networks
• Computational and Information Science
• Optimal Dynamic Routing in Multidestination Networks
• An algorithm to find optimal double-loop networks

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A complementary survey on double-loop networks
• A survey on multi-loop networks.
• An optimal fault-tolerant routing algorithm for double-loop networks
• An optimal message routing algorithm for double-loop networks
• Attacking the Pollard Generator
• Circulants and their connectivities
• Computer Algebra in Scientific Computing
• Computing and Combinatorics
• Computing the Diameter in Multiple-Loop Networks
• Diameters of weighted double loop networks
• Distributed loop network with minimum transmission delay
• Factoring polynomials with rational coefficients
• Fast integer programming in fixed dimension
• Fast multiplication of large numbers
• Fault-tolerant routing in distributed loop networks
• Finding shortest paths in distributed loop networks
• Geometric algorithms and combinatorial optimization.
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Optimal distance networks of low degree for parallel computers
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Predicting nonlinear pseudorandom number generators
• Solving linear programs with finite precision. I: Condition numbers and random programs
• The Generalized Basis Reduction Algorithm
• The Generalized Gauss Reduction Algorithm

Cited in

(16)

• On Motzkin's problem in the circle group
• An efficient shortest-path routing algorithm in the data centre network DPillar
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• Analysis of the structured perturbation for the BCSCB linear system
• scientific article; zbMATH DE number 934460 (Why is no real title available?)
• The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter
• Forwarding and optical indices of 4-regular circulant networks
• A survey on undirected circulant graphs
• scientific article; zbMATH DE number 2143949 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Computing and Combinatorics
• scientific article; zbMATH DE number 1746029 (Why is no real title available?)
• Greedy routing in circulant networks
• scientific article; zbMATH DE number 6469145 (Why is no real title available?)
• An optimal message routing algorithm for double-loop networks
• On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings

This page was built for publication: Optimal routing in double loop networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995561)