Deadlock-Free Packet Switching Networks

DOI10.1137/0210044zbMath0461.68038OpenAlexW1989693809MaRDI QIDQ3911385

Sam Toueg, Jeffrey D. Ullman

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210044

zbMATH Keywords

communication networkflow controlcomputer networksfixed-adaptive routinguniform controller

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (6)

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms ⋮ Deadlock in packet switching networks ⋮ The snap-stabilizing message forwarding algorithm on tree topologies ⋮ On deadlocks of exclusive AND-requests for resources ⋮ Optimization aspects of deadlock prevention in packet-switching networks ⋮ How to improve snap-stabilizing point-to-point communication space complexity?

This page was built for publication: Deadlock-Free Packet Switching Networks