Queuing network models of packet switching networks part 1: Open networks
- 1 May 1982
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 2 (1), 9-21
- https://doi.org/10.1016/0166-5316(82)90017-7
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Queueing network models of packet switching networks part 2: Networks with population size constraintsPerformance Evaluation, 1982
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Routing and flow control in Systems Network ArchitectureIBM Systems Journal, 1979
- Queuing Networks with Population Size ConstraintsIBM Journal of Research and Development, 1977
- Store-and-Forward Buffer Requirements in a Packet Switching NetworkIEEE Transactions on Communications, 1976
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973
- Jobshop-Like Queueing SystemsManagement Science, 1963
- A Proof for the Queuing Formula: L = λWOperations Research, 1961