메뉴 건너뛰기




Volumn 35, Issue 1, 1999, Pages 19-48

Stochastic complement analysis of multi-server threshold queues with hysteresis

Author keywords

[No Author keywords available]

Indexed keywords

GREEN'S FUNCTION; HYSTERESIS; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING; VECTORS;

EID: 0032638956     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(98)00043-1     Document Type: Article
Times cited : (37)

References (21)
  • 2
    • 0022776080 scopus 로고
    • Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models
    • P.J. Courtois, P. Semal, Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models, IEEE JSAC 4(6) (1986).
    • (1986) IEEE JSAC , vol.4 , Issue.6
    • Courtois, P.J.1    Semal, P.2
  • 3
    • 0031168266 scopus 로고    scopus 로고
    • Bounding of performance measures for a threshold-based queueing system with hysteresis
    • June
    • L. Golubchik, J.C.S. Lui, Bounding of performance measures for a threshold-based queueing system with hysteresis, ACM SIGMETRICS '97 Conference, vol. 25, 1, June 1997, pp. 147-157.
    • (1997) ACM SIGMETRICS '97 Conference , vol.25 , Issue.1 , pp. 147-157
    • Golubchik, L.1    Lui, J.C.S.2
  • 4
    • 0017444511 scopus 로고
    • Transient solutions in Markovian queueing systems
    • Grassman W.K. Transient solutions in Markovian queueing systems. Comput. Oper. Res. 4:1977;47-53.
    • (1977) Comput. Oper. Res. , vol.4 , pp. 47-53
    • Grassman, W.K.1
  • 5
    • 0019562166 scopus 로고
    • The compensation method applied to a one-product production/inventory problem
    • S.C. Graves, J. Keilson. The compensation method applied to a one-product production/inventory problem, J. Math. Oper. Res. 6 (1981) 246-262.
    • (1981) J. Math. Oper. Res. , vol.6 , pp. 246-262
    • Graves, S.C.1    Keilson, J.2
  • 7
    • 0022012777 scopus 로고
    • An approximation method for a class of queueing systems
    • Ibe O.C., Maruyama K. An approximation method for a class of queueing systems. Performance Evaluation. 5:1985;15-27.
    • (1985) Performance Evaluation , vol.5 , pp. 15-27
    • Ibe, O.C.1    Maruyama, K.2
  • 8
    • 0029210161 scopus 로고
    • Multi-server threshold queues with hysteresis
    • Ibe O.C., Keilson J. Multi-server threshold queues with hysteresis. Performance Evaluation. 21:1995;185-212.
    • (1995) Performance Evaluation , vol.21 , pp. 185-212
    • Ibe, O.C.1    Keilson, J.2
  • 12
    • 0004210802 scopus 로고
    • Wiley Interscience, New York
    • L. Kleinrock, Queueing Systems, vol. I, Wiley Interscience, New York, 1975.
    • (1975) Queueing Systems , vol.1
    • Kleinrock, L.1
  • 13
    • 0020781164 scopus 로고
    • Control of a heterogeneous two-server exponential queueing system
    • Larsen R.L., Agrawala A.K. Control of a heterogeneous two-server exponential queueing system. IEEE Trans. Software Eng. 9:1983;526-552.
    • (1983) IEEE Trans. Software Eng. , vol.9 , pp. 526-552
    • Larsen, R.L.1    Agrawala, A.K.2
  • 14
    • 0021476582 scopus 로고
    • Optimal control of a queueing system with two heterogeneous servers
    • Lin W., Kumar P.R. Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automatic Control. 29:1984;696-703.
    • (1984) IEEE Trans. Automatic Control , vol.29 , pp. 696-703
    • Lin, W.1    Kumar, P.R.2
  • 15
    • 0000861722 scopus 로고
    • A proof of the queueing formula L=λW
    • Little J.D.C. A proof of the queueing formula. L=λW Oper. Res. 9:1967;383-387.
    • (1967) Oper. Res. , vol.9 , pp. 383-387
    • Little, J.D.C.1
  • 16
    • 0028460281 scopus 로고
    • Bounding methodology for computing steady state availability of repairable computer systems
    • J.C.S. Lui, R.R. Muntz, Bounding methodology for computing steady state availability of repairable computer systems, J. ACM (1994) 676-707.
    • (1994) J. ACM , pp. 676-707
    • Lui, J.C.S.1    Muntz, R.R.2
  • 17
    • 84938172584 scopus 로고
    • Bounding the mean response time of the minimum expected delay routing policy: An algorithmic approach
    • Lui J.C.S., Muntz R.R., Towsley D. Bounding the mean response time of the minimum expected delay routing policy: An algorithmic approach. IEEE Trans. Comput. 44(5):1995;1371-1382.
    • (1995) IEEE Trans. Comput. , vol.44 , Issue.5 , pp. 1371-1382
    • Lui, J.C.S.1    Muntz, R.R.2    Towsley, D.3
  • 18
    • 0024680811 scopus 로고
    • Stochastic complementation, uncoupling Markov chains and the theory of nearly reducible systems
    • Meyer C.D. Stochastic complementation, uncoupling Markov chains and the theory of nearly reducible systems. SIAM Rev. 31(2):1989;240-272.
    • (1989) SIAM Rev. , vol.31 , Issue.2 , pp. 240-272
    • Meyer, C.D.1
  • 19
    • 0000548781 scopus 로고
    • Two-server queue with one server idle below a threshold
    • Morrison J.A. Two-server queue with one server idle below a threshold. Queueing Systems. 7:1990;325-336.
    • (1990) Queueing Systems , vol.7 , pp. 325-336
    • Morrison, J.A.1
  • 20
    • 0023343337 scopus 로고
    • Approximating the mean time in system in a multiple-server queue that uses threshold scheduling
    • Nelson R., Towsley D. Approximating the mean time in system in a multiple-server queue that uses threshold scheduling. J. Oper. Res. 35:1987;419-427.
    • (1987) J. Oper. Res. , vol.35 , pp. 419-427
    • Nelson, R.1    Towsley, D.2


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