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: Minkevičius, Saulius
Affiliations: Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. E-mail: [email protected]
Abstract: Queueing systems with a single device are well developed (see, for example, Borovkov, 1972; 1980). But there are only several works in the theory of multiphase queueing systems in heavy traffic (see Iglehart, Whitt, 1970b) and no proof of laws of the iterated logarithm for the probabilistic characteristics of multiphase queuing systems in heavy traffic. The law of the iterated logarithm for the waiting time of a customer is proved in the first part of the paper (see Minkevičius, 1995). In this work, theorems on laws of the iterated logarithm for the other main characteristics of multiphase queuing systems in heavy traffic (a summary queue length of customers, a queue length of customers, a waiting time of a customer) are proved.
Keywords: multiphase queuing system, the law of the iterated logarithm, a summary queue length of customers, a queue length of customers, a waiting time of a customer
DOI: 10.3233/INF-1997-8304
Journal: Informatica, vol. 8, no. 3, pp. 367-376, 1997
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]