Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4) , 702-712
- https://doi.org/10.1137/0210053
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Determining Deadlock Exposure for a Class of Store and Forward Communication NetworksIBM Journal of Research and Development, 1980
- Deadlock-free packet switching networksPublished by Association for Computing Machinery (ACM) ,1979
- Free buffer allocation — An investigation by simulationComputer Networks (1976), 1978
- Some comments on simulated datagram store-and-forward networksComputer Networks (1976), 1978
- The Control of Congestion in Packet-Switching NetworksIEEE Transactions on Communications, 1972