Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Puškorius, Stasys | Minkevičius, Saulius
Affiliations: Lithuanian Military Academy, Šilo 5a, 2055 Vilnius, Lithuania | Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. E-mail: mathematica.ktl.mii.lt
Abstract: The queueing system theory is well developed. Such an important problem as the efficient of customer service in efficiency a multichannel queueing system with different productivity of service channels is well developed, too. Exact formulas are obtained from which the loss probability can be computed (if the input stream of customers distributed as Poisson and service time of the customer is the exponential service time). However, these formulas are very complex. So, in this paper, two theorems are proved, in which upper and lower estimates of the loss probability are presented. These estimates are simple formulas that don't become more complex with the growing number of service channels in the queueing system.
Keywords: M/M/n queueing system, output stream of customers, the loss probability, upper and lower estimates of the loss probability
DOI: 10.3233/INF-1996-7306
Journal: Informatica, vol. 7, no. 3, pp. 361-370, 1996
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]