An optimal permutation routing algorithm on full-duplex hexagonal networks

MaRDI QIDQ3575430zbMATH OpenFDO

Authors Janez Žerovnik, Ignasi Sau

Publication date 27 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/960/0.html

zbMATH Keywords

communication networksdistributed algorithmhexagonal networksoblivious algorithmpermutation routingshortest path

Mathematics Subject Classification ID

Distributed systems (68M14) Deterministic network models in operations research (90B10)

Recommendations

• Permutation routing and ( , k)-routing on plane grids
• Deterministic Permutation Routing on Meshes
• Packet Routing on grids of processors
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• Mesh permutation routing with locality

Cited in

(1)

• Permutation routing and ( , k)-routing on plane grids

This page was built for publication: An optimal permutation routing algorithm on full-duplex hexagonal networks

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