Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T10:18:37.924Z Has data issue: false hasContentIssue false

Queues with semi-Markovian arrivals

Published online by Cambridge University Press:  14 July 2016

Erhan Çinlar*
Affiliation:
Northwestern University, Evanston, Illinois

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.

Information

Type
Research Papers
Copyright
Copyright © Sheffield: Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable