Greedy hot-potato routing on the two-dimensional mesh

DOI10.1007/BF01784239zbMath1448.68073MaRDI QIDQ5136999

Tamar Eilam, Assaf Schuster, Ishai Ben-Aroya

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

greedy routingmesh architecturepackethot potato (deflection) routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus ⋮ Networks on which hot-potato routing does not livelock

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on evacuation time for deflection routing
• Routing, merging, and sorting on parallel models of computation
• Randomized Single-Target Hot-Potato Routing
• Deflection routing in hypercube networks
• Potential function analysis of greedy hot-potato routing
• Fast deflection routing for packets and worms
• An optimal shortest-path routing policy for network computers with regular mesh-connected topologies

This page was built for publication: Greedy hot-potato routing on the two-dimensional mesh