Deadlock-Free Packet Switching Networks
- 1 August 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (3) , 594-611
- https://doi.org/10.1137/0210044
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Some Complexity Results in the Design of Deadlock-Free Packet Switching NetworksSIAM Journal on Computing, 1981
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- The Design of Small-Diameter Networks by Local SearchIEEE Transactions on Computers, 1979
- Free buffer allocation — An investigation by simulationComputer Networks (1976), 1978
- Computer Communication Networks: Approaches, Objectives, and Performance ConsiderationsACM Computing Surveys, 1975
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Improved Construction Techniques for (d, k) GraphsIEEE Transactions on Computers, 1970
- On (d, k) GraphsIEEE Transactions on Electronic Computers, 1967
- A Design for (d, k) GraphsIEEE Transactions on Electronic Computers, 1966
- On the Construction of (d, k) GraphsIEEE Transactions on Electronic Computers, 1965