Statistical techniques for a numerical evaluation of the proximity of <mml:math altimg="si37.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn></mml:math> and <mml:math altimg="si38.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn></mml:math> queueing systems-Reference-Cited by-同舟云学术

Statistical techniques for a numerical evaluation of the proximity of G/G/1 and G/M/1 queueing systems

Published:2011-03 Issue:5 Volume:61 Page:1296-1304
ISSN:0898-1221
Container-title:Computers & Mathematics with Applications
language:en
Short-container-title:Computers & Mathematics with Applications

Author:

Bareche Aïcha,Aïssani Djamil

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation

Reference24 articles.

1. Ergodicity and stability of Markov chains with respect to operator topology in the space of transition kernels;Aissani;Dokl. Akad. Nauk Ukr. SSR, Ser. A,1983

2. Strong Stable Markov Chains;Kartashov,1996

3. Taylor expansions for stationary Markov chains;Heidergott;Adv. Appl. Probab.,2003

4. Series expansions for finite-state Markov chains;Heidergott;Probab. Engrg. Inform. Sci.,2007

5. Series expansions for continuous-time Markov processes;Heidergott;Oper. Res.,2010

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

1. Cost function analysis of a single-server queueing system with Poisson input stream and Erlang-k service time;Applied Mathematics and Computation;2024-08

2. Asymmetric kernel method in the study of strong stability of the PH/M/1 queuing system;Monte Carlo Methods and Applications;2023-12-13

3. Strong Stability of Queueing Systems and Networks: a Survey and Perspectives;Queueing Theory 1;2021-04-12

4. An optimal approximation of the characteristics of the GI/M/1 queue with two-stage service policy;Operational Research;2017-10-10

5. Nonparametric estimation of the claim amount in the strong stability analysis of the classical risk model;Insurance: Mathematics and Economics;2017-05