메뉴 건너뛰기




Volumn 124, Issue 3, 2000, Pages 447-467

Higher order approximations for the single server queue with splitting, merging and feedback

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CLIENT SERVER COMPUTER SYSTEMS; FEEDBACK; MARKOV PROCESSES; MERGING; PERFORMANCE; QUEUEING NETWORKS;

EID: 0033745768     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00174-5     Document Type: Article
Times cited : (11)

References (32)
  • 1
    • 0021488833 scopus 로고
    • Approximating a point process by a renewal process, II: Superposition arrival processes to queues
    • Albin S.L. Approximating a point process by a renewal process, II: Superposition arrival processes to queues. Operations Research. 32:1984;1133-1162.
    • (1984) Operations Research , vol.32 , pp. 1133-1162
    • Albin, S.L.1
  • 4
    • 0010584720 scopus 로고
    • Approximating nonrenewal processes by Markov chains: Use of Super-Erlang (SE) chains
    • Bitran G.R., Dasu S. Approximating nonrenewal processes by Markov chains: Use of Super-Erlang (SE) chains. Operations Research. 41(5):1993;903-923.
    • (1993) Operations Research , vol.41 , Issue.5 , pp. 903-923
    • Bitran, G.R.1    Dasu, S.2
  • 6
    • 34250125012 scopus 로고
    • On queueing network models of flexible manufacturing systems
    • Buzacott J.A., Yao D.D. On queueing network models of flexible manufacturing systems. Questa. 1:1986;5-27.
    • (1986) Questa , vol.1 , pp. 5-27
    • Buzacott, J.A.1    Yao, D.D.2
  • 8
    • 0343971510 scopus 로고
    • Ph.D. Dissertation and Technical Report No. 72-10, Department of Industrial Engineering and Operations Research, University of Michigan, Ann Arbor, MI
    • Cherry, W.P., 1972. The Superposition of Two Independent Markov Renewal Processes, Ph.D. Dissertation and Technical Report No. 72-10, Department of Industrial Engineering and Operations Research, University of Michigan, Ann Arbor, MI.
    • (1972) The Superposition of Two Independent Markov Renewal Processes
    • Cherry, W.P.1
  • 10
    • 0030508133 scopus 로고    scopus 로고
    • Higher order approximations for tandem queueing networks
    • Girish M.K., Hu J.Q. Higher order approximations for tandem queueing networks. Questa. 22:1996;249-276.
    • (1996) Questa , vol.22 , pp. 249-276
    • Girish, M.K.1    Hu, J.Q.2
  • 13
    • 0031322689 scopus 로고    scopus 로고
    • An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation
    • Girish M.K., Hu J.Q. An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation. Questa. 26:1997;269-284.
    • (1997) Questa , vol.26 , pp. 269-284
    • Girish, M.K.1    Hu, J.Q.2
  • 14
  • 15
    • 0001167316 scopus 로고
    • Closed queueing systems with exponential servers
    • Gordon W.J., Newell G.F. Closed queueing systems with exponential servers. Operations Research. 15(2):1967;254-265.
    • (1967) Operations Research , vol.15 , Issue.2 , pp. 254-265
    • Gordon, W.J.1    Newell, G.F.2
  • 16
    • 0001828819 scopus 로고
    • The QNET method for two-moment analysis of open queueing networks
    • Harrison J.M., Nguyen V. The QNET method for two-moment analysis of open queueing networks. Questa. 6:1990;1-32.
    • (1990) Questa , vol.6 , pp. 1-32
    • Harrison, J.M.1    Nguyen, V.2
  • 17
    • 0030233188 scopus 로고    scopus 로고
    • The departure process of the GI/G/1 queue and its MacLaurin series
    • Hu J.Q. The departure process of the GI/G/1 queue and its MacLaurin series. Operations Research. 44:1996;810-815.
    • (1996) Operations Research , vol.44 , pp. 810-815
    • Hu, J.Q.1
  • 18
    • 0001930641 scopus 로고
    • Jobshop-like queueing systems
    • Jackson J.R. Jobshop-like queueing systems. Management Science. 10(1):1963;131-142.
    • (1963) Management Science , vol.10 , Issue.1 , pp. 131-142
    • Jackson, J.R.1
  • 19
    • 0001607009 scopus 로고
    • Matching moments to phase distributions: Mixtures of Erlang distributions of common order
    • Johnson M.A., Taaffe M.R. Matching moments to phase distributions: Mixtures of Erlang distributions of common order. Stochastic Models. 5(4):1989;711-743.
    • (1989) Stochastic Models , vol.5 , Issue.4 , pp. 711-743
    • Johnson, M.A.1    Taaffe, M.R.2
  • 20
    • 0001332637 scopus 로고
    • An investigation of phase-distribution moment matching algorithms for use in queueing models
    • Johnson M.A., Taaffe M.R. An investigation of phase-distribution moment matching algorithms for use in queueing models. Questa. 8:1991;129-148.
    • (1991) Questa , vol.8 , pp. 129-148
    • Johnson, M.A.1    Taaffe, M.R.2
  • 21
    • 0039492245 scopus 로고
    • A graphical investigation of error bounds for moment-based queueing approximations
    • Johnson M.A., Taaffe M.R. A graphical investigation of error bounds for moment-based queueing approximations. Questa. 8:1991;295-312.
    • (1991) Questa , vol.8 , pp. 295-312
    • Johnson, M.A.1    Taaffe, M.R.2
  • 22
    • 0040677673 scopus 로고
    • Selecting parameters of phase distributions: Combining nonlinear programming, heuristics, and Erlang distributions
    • Johnson M.A. Selecting parameters of phase distributions: Combining nonlinear programming, heuristics, and Erlang distributions. ORSA Journal on Computing. 5(1):1993;69-83.
    • (1993) ORSA Journal on Computing , vol.5 , Issue.1 , pp. 69-83
    • Johnson, M.A.1
  • 25
    • 0018286765 scopus 로고
    • Approximate analysis of general queueing networks by decomposition
    • Kuehn P.J. Approximate analysis of general queueing networks by decomposition. IEEE Transactions on Communications. 27:1979;113-126.
    • (1979) IEEE Transactions on Communications , vol.27 , pp. 113-126
    • Kuehn, P.J.1
  • 27
    • 0039492246 scopus 로고
    • MEDA: Mixed Erlang distributions as phase-type representations of empirical distribution functions
    • Schmickler L. MEDA: Mixed Erlang distributions as phase-type representations of empirical distribution functions. Stochastic Models. 8(1):1992;131-155.
    • (1992) Stochastic Models , vol.8 , Issue.1 , pp. 131-155
    • Schmickler, L.1
  • 29
    • 0020848139 scopus 로고
    • The queueing network analyzer
    • Whitt W. The queueing network analyzer. Bell System Technical Journal. 62(9):1983;2779-2815.
    • (1983) Bell System Technical Journal , vol.62 , Issue.9 , pp. 2779-2815
    • Whitt, W.1
  • 30
    • 0020843490 scopus 로고
    • Performance of the queueing network analyzer
    • Whitt W. Performance of the queueing network analyzer. The Bell System Technical Journal. 62(9):1983;2817-2843.
    • (1983) The Bell System Technical Journal , vol.62 , Issue.9 , pp. 2817-2843
    • Whitt, W.1
  • 31
    • 0019900567 scopus 로고
    • Approximating a point process by a renewal process I: Two basic methods
    • Whitt W. Approximating a point process by a renewal process I: Two basic methods. Operations Research. 50:1982;125-147.
    • (1982) Operations Research , vol.50 , pp. 125-147
    • Whitt, W.1
  • 32
    • 21144477912 scopus 로고
    • The MacLaurin expansion for a G/G/1 queue with Markov-modulated arrivals and services
    • Zhu Y., Li H. The MacLaurin expansion for a G/G/1 queue with Markov-modulated arrivals and services. Questa. 14:1993;125-134.
    • (1993) Questa , vol.14 , pp. 125-134
    • Zhu, Y.1    Li, H.2


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