메뉴 건너뛰기




Volumn 30, Issue 3, 2003, Pages 353-365

Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula

Author keywords

Approximations; Bounds; Duality in queues; GI G 1 K queue; Little's formula; Queue length distribution; Queueing

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; QUEUEING THEORY;

EID: 0037647739     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00101-0     Document Type: Article
Times cited : (13)

References (14)
  • 2
    • 38249001873 scopus 로고
    • Comments on duality of queues with finite buffer size
    • Hlynka M, Wang T. Comments on duality of queues with finite buffer size. Operations Research Letters 1993;14: 29-33.
    • (1993) Operations Research Letters , vol.14 , pp. 29-33
    • Hlynka, M.1    Wang, T.2
  • 3
    • 0013041241 scopus 로고
    • A generalized Pollaczek-Khinchine formula for the GI/GI/1/K queue and its application to approximation
    • Miyazawa M. A generalized Pollaczek-Khinchine formula for the GI/GI/1/K queue and its application to approximation. Communications in Statistics-Stochastic Models 1987;3:53-65.
    • (1987) Communications in Statistics-Stochastic Models , vol.3 , pp. 53-65
    • Miyazawa, M.1
  • 5
    • 0026405612 scopus 로고
    • On exact computational analysis of distributions of numbers in systems for M/G/1/N+1 and GI/M/I/N+1 queues using roots
    • Chaudhry ML, Gupta UC, Agarwal M. On exact computational analysis of distributions of numbers in systems for M/G/1/N+1 and GI/M/I/N+1 queues using roots. Computer & Operations Research 1991;18:679-94.
    • (1991) Computer and Operations Research , vol.18 , pp. 679-694
    • Chaudhry, M.L.1    Gupta, U.C.2    Agarwal, M.3
  • 7
    • 0000746017 scopus 로고
    • A review of L = λW and extensions
    • Whitt W. A review of L = λW and extensions. Queueing Systems 1991;9:235-68.
    • (1991) Queueing Systems , vol.9 , pp. 235-268
    • Whitt, W.1
  • 8
    • 0009079508 scopus 로고    scopus 로고
    • A unified method to analyze overtake free queueing systems
    • Bertsimas D, Mourtzinou G. A unified method to analyze overtake free queueing systems. Advances in Applied Probability 1996;28:588-625.
    • (1996) Advances in Applied Probability , vol.28 , pp. 588-625
    • Bertsimas, D.1    Mourtzinou, G.2
  • 10
    • 0020103086 scopus 로고
    • Poisson arrivals see time averages
    • Wolff RW. Poisson arrivals see time averages. Operations Research 1982;30:223-31.
    • (1982) Operations Research , vol.30 , pp. 223-231
    • Wolff, R.W.1
  • 11
    • 0037534988 scopus 로고
    • Customer average and time average queue lengths and waiting times
    • Marshall KT, Wolff RW. Customer average and time average queue lengths and waiting times. Journal of Applied Probability 1971;8:535-42.
    • (1971) Journal of Applied Probability , vol.8 , pp. 535-542
    • Marshall, K.T.1    Wolff, R.W.2
  • 13
    • 0002708534 scopus 로고
    • The heavy traffic approximation in the theory of queues
    • Smith WL, Wilkinson RI editors. Chapel Hill, N. Carolina: University of North Carolina Press
    • Kingman JFC. The heavy traffic approximation in the theory of queues. In: Smith WL, Wilkinson RI editors. Proceedings of the Symposium on Congestion Theory, Chapel Hill, N. Carolina: University of North Carolina Press. 1964. p. 137-69.
    • (1964) Proceedings of the Symposium on Congestion Theory , pp. 137-169
    • Kingman, J.F.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.