Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization-Reference-Cited by-同舟云学术

Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization

Published:2000-03 Issue:1-3 Volume:40 Page:3-26
ISSN:0166-5316
Container-title:Performance Evaluation
language:en
Short-container-title:Performance Evaluation

Author:

Haßlinger Gerhard

Publisher

Elsevier BV

Subject

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

Reference40 articles.

1. On a fundamental identity in the theory of semi-Markov processes;Arjas;Adv. Appl. Probab.,1972

2. S. Asmussen, Applied Probability and Queues, Wiley, New York, 1987.

3. A review of open queueing network models of manufacturing systems;Bitran;Queueing Systems,1992

4. Approximating nonrenewal processes by Markov chains: use of super-Erlang (SE) chains;Bitran;Oper. Res.,1993

5. O.J. Boxma, H. Daduna, Sojourn times in queueing networks, in: H. Takagi (Ed.), Stochastic Analysis of Computer and Communication Systems, North-Holland, Amsterdam, 1990, pp. 401–450.

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

1. New Approach for Finding Basic Performance Measures of Single Server Queue;Journal of Probability and Statistics;2014

2. Towards an end-to-end delay analysis of wireless multihop networks;Ad Hoc Networks;2009-07

3. Parameter estimation and optimization techniques for discrete-time semi-Markov models of H.264/AVC video traffic;Telecommunication Systems;2008-06-17

4. The use of the distributional Little’s law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues;Performance Evaluation;2008-01

5. Simulating markov-reward processes with rare events;ACM Transactions on Modeling and Computer Simulation;2005-04