Queues with semi-Markovian arrivals-Reference-Cited by-同舟云学术

Queues with semi-Markovian arrivals

Published:1967-08 Issue:02 Volume:4 Page:365-379
ISSN:0021-9002
Container-title:Journal of Applied Probability
language:en
Short-container-title:J. Appl. Probab.

Author:

Çinlar Erhan

Abstract

A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals. The queue size, waiting time, and busy period processes are investigated. Both transient and limiting results are given.

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference9 articles.

1. Unzerlegbare, nicht negative Matrizen

2. Regenerative stochastic processes

3. Recherches sur les chaînes de Markoff: Premier Mémoire

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotic Analysis of the Queueing Network $$SM-(GI/\infty )^K$$ S M - ( G I / ∞ ) K;Communications in Computer and Information Science;2015

2. Processor-sharing and random-service queues with semi-Markovian arrivals;Journal of Applied Probability;2005-06

3. Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains;Advances in Applied Probability;1997-09

4. Spectral analysis of M/G/1 and G/M/1 type Markov chains;Advances in Applied Probability;1996-03

5. MR/GI/1 queues by positively correlated arrival stream;Journal of Applied Probability;1994-06