메뉴 건너뛰기




Volumn 16, Issue 5, 2000, Pages 543-556

A simple approach to the MAP/D/s queue

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0345531118     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326340008807603     Document Type: Article
Times cited : (7)

References (14)
  • 1
    • 0002819666 scopus 로고
    • Delay probability formulae when the holding times are constant
    • Crommelin, C. D. (1932) Delay probability formulae when the holding times are constant. Post Office Electrical Engineer's Journal 25, 41-50.
    • (1932) Post Office Electrical Engineer's Journal , vol.25 , pp. 41-50
    • Crommelin, C.D.1
  • 3
    • 0002796413 scopus 로고
    • Efficient algorithms for solving the non-linear matrix equations arising in phase type queues
    • Lucantoni, D. M. and Ramaswami, V. (1985) Efficient algorithms for solving the non-linear matrix equations arising in phase type queues. Stoch. Mod. 1, 29-51.
    • (1985) Stoch. Mod. , vol.1 , pp. 29-51
    • Lucantoni, D.M.1    Ramaswami, V.2
  • 4
    • 0000799590 scopus 로고
    • A single-server queue with server vacations and a class of non-renewal arrival processes
    • Lucantoni, D. M., Meier-Hellstern, K. S. and Neuts, M. F. (1990) A single-server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob. 22, 676-705.
    • (1990) Adv. Appl. Prob. , vol.22 , pp. 676-705
    • Lucantoni, D.M.1    Meier-Hellstern, K.S.2    Neuts, M.F.3
  • 5
    • 0005036977 scopus 로고
    • The c-server queue with constant service times and a versatile Markovian arrival process
    • R. L. Disney and T. J. Ott (eds), Birkhäuser, Boston
    • Neuts, M. F. (1982) The c-server queue with constant service times and a versatile Markovian arrival process. Applied Probability - Computer Science: The Interface, Vol.I, R. L. Disney and T. J. Ott (eds), Birkhäuser, Boston, 31-67.
    • (1982) Applied Probability - Computer Science: The Interface, Vol.I , vol.1 , pp. 31-67
    • Neuts, M.F.1
  • 8
    • 84963178759 scopus 로고
    • Stable recursion for the steady state vector for Markov chains of M/G/1 type
    • Ramaswami, V. (1988) Stable recursion for the steady state vector for Markov chains of M/G/1 type. Stoch. Mod. 4, 183-188.
    • (1988) Stoch. Mod. , vol.4 , pp. 183-188
    • Ramaswami, V.1
  • 9
    • 0001120020 scopus 로고
    • The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority
    • Takine, T. and Hasegawa, T. (1994) The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority. Stock. Mod. 10, 183-204.
    • (1994) Stock. Mod. , vol.10 , pp. 183-204
    • Takine, T.1    Hasegawa, T.2
  • 10
    • 0028422661 scopus 로고
    • Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes
    • Takine, T., Matsumoto, Y., Suda, T. and Hasegawa, T. (1994) Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes. Perfor. Eval. 20, 131-149.
    • (1994) Perfor. Eval. , vol.20 , pp. 131-149
    • Takine, T.1    Matsumoto, Y.2    Suda, T.3    Hasegawa, T.4
  • 11
    • 0001015030 scopus 로고    scopus 로고
    • On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals
    • Takine, T. and Takahashi, Y. (1998) On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals. Stock. Mod. 14, 601-610.
    • (1998) Stock. Mod. , vol.14 , pp. 601-610
    • Takine, T.1    Takahashi, Y.2
  • 13
    • 33747217405 scopus 로고    scopus 로고
    • Distributional form of Little's law for FIFO queues with multiple Markovian arrival streams and its application to queues with vacations
    • Takine, T. (2000) Distributional form of Little's law for FIFO queues with multiple Markovian arrival streams and its application to queues with vacations, to appear in Queueing Systems.
    • (2000) Queueing Systems
    • Takine, T.1


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