Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T07:20:50.954Z Has data issue: false hasContentIssue false

On a many server queue with non-recurrent input and negative exponential servers

Published online by Cambridge University Press:  09 April 2009

C. Pearce
Affiliation:
Department of Probability and StatisticsSheffield University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a queueing system with k identical servers in parallel, the services being negative exponential with parameter μ. The input is a natural generalisation of the usual general recurrent input. If we denote the sequence of arrival points by {An, n ≧ 0} then the inter-arrival intervals are given by where the ƒi: are (integrable) non-negative functions and {Ui} is a sequence of identically and independently distributed random variables. In the simplest case, p = 0, this is just a general recurrent input. We write U(·) for the probability distribution function of the Un.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1968