Robust algorithms for packet routing in a mesh

DOI10.1007/BF01294592MaRDI QIDQ4327376zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 5 April 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01294592

zbMATH Keywords

robust algorithmsrouting algorithmpermutation packet routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Efficient and fair routing for mesh networks
• Robust routing in communication networks
• scientific article; zbMATH DE number 4049037
• Routing algorithms in honeycomb meshes

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Sorting on a mesh-connected parallel computer

Cited in

(7)

• Improving robustness of next-hop routing
• Packet Routing on grids of processors
• Flit-serial packet routing on meshes and tori
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 4155881 (Why is no real title available?)
• Online Multi-path Routing in a Maze
• Routing algorithms in honeycomb meshes

This page was built for publication: Robust algorithms for packet routing in a mesh

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