Potential function analysis of greedy hot-potato routing

DOI10.1007/s002240000076zbMath0893.68083OpenAlexW2119184028WikidataQ127972168 ScholiaQ127972168MaRDI QIDQ1384707

Shai Halevi, Assaf Schuster, Amir Ben-Dor

Publication date: 3 August 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

greedy hot-potato routing algorithmspacket routing in synchronous networks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (4)

Direct routing: Algorithms and complexity ⋮ Methods and problems of communication in usual networks ⋮ Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus ⋮ Networks on which hot-potato routing does not livelock

This page was built for publication: Potential function analysis of greedy hot-potato routing