Packet routing in fixed-connection networks: A survey

DOI10.1006/jpdc.1998.1483zbMath0911.68018OpenAlexW1976150119MaRDI QIDQ1273848

Miro Kraetzl, D. Frank Hsu, Miltos D. Grammatikakis, Jop F. Sibeyn

Publication date: 19 April 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/13b01b190e3a3e28bd7dd726a6dd0f94d5a71bb8

zbMATH Keywords

routing problems

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Related Items (12)

Algorithms for data migration ⋮ Generalized crossed rings-multirings with a decreased degree of node ⋮ Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus ⋮ Routing automorphisms of the hypercube ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Store-and-forward multicast routing on the mesh ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Optimal oblivious routing on \(d\)-dimensional meshes ⋮ Optimal permutation routing for low-dimensional hypercubes ⋮ Exploiting colored Petri nets to decide on permutation admissibility ⋮ Optimal many-to-one routing on the mesh with constant queues

This page was built for publication: Packet routing in fixed-connection networks: A survey