We partner with a secure submission system to handle manuscript submissions.
Please note:
You will need an account for the submission system, which is separate to your Cambridge Core account. For login and submission support, please visit the
submission and support pages.
Please review this journal's author instructions, particularly the
preparing your materials
page, before submitting your manuscript.
Click Proceed to submission system to continue to our partner's website.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
A sufficient condition for a function of a Markov process to be Markovian is obtained by considering a reverse process of the original Markov process. An application of this result provides a simple derivation of the joint distribution of a sequence of Pearson χ2 statistics previously obtained by Zaharov, Sarmanov and Sevast'ianov (1969).
Cohen (1969) has studied the transient and stationary queue length distributions for the M/G/1, K queue, with a fixed maximum number of customers, K, in the system at any time. The present note applies Cohen's method to generalize his results to the MX/GY/1, K queue.
A single server, two priority queueing system is studied under the heavy traffic condition where the system traffic intensity is either at or near its critical value. An approximation is developed for the transient distribution of the low priority customers' virtual waiting time process. This result is stated formally as a limit theorem involving a sequence of systems whose traffic intensities approach the critical value.