A simple throughput bound for large closed queueing networks with finite capacities-Reference-Cited by-同舟云学术

A simple throughput bound for large closed queueing networks with finite capacities

Published:1989-12 Issue:3 Volume:10 Page:153-167
ISSN:0166-5316
Container-title:Performance Evaluation
language:en
Short-container-title:Performance Evaluation

Author:

van Dijk Nico M.

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Hardware and Architecture,Modelling and Simulation,Software

Reference33 articles.

1. I.J.B.F. Adan and J. van der Wal, Monotonicity of the throughput of a closed queueing network in the number of jobs, Memorandum COSOR 87-03, Eindhoven University of Technology, Dept. of Math. and Comput. Sci., Oper. Res., to appear.

2. Generalized semi-Markov schemes and open queueing networks;Barbour;J. Appl. Probab.,1982

3. Weak convergence of generalized semi-Markov processes;Hordijk;Stoch. Process. Appl.,1982

4. Networks of queues;Hordijk,1983

5. Jobshop-line queueing systems;Jackson;Management Sci.,1963

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks;Computers & Operations Research;2001-08

2. Monotonicity and Comparison Results for Nonnegative Dynamic Systems;Operations Research Proceedings 2000;2001

3. The Product form Tool for Queueing Networks;International Series in Operations Research & Management Science;2000

4. Manufacturing systems with machine vacations, arbitrary topology and finite buffers;International Journal of Production Economics;1999-01

5. Analytic comparison results for communication networks;Computer Communications;1998-11