Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T04:55:36.795Z Has data issue: false hasContentIssue false

Etude d'une file GI/G/1 à service autonome (avec vacances du serveur)

Published online by Cambridge University Press:  01 July 2016

C. Fricker*
Affiliation:
Université Paris VI
*
∗Postal address: Université Paris VI, Laboratoire de Probabilités, 4 Place Jussieu—Tour 56, 75230 Paris Cedex 05, France.
Rights & Permissions [Opens in a new window]

Abstract

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.

The purpose of this letter is to study a modified GI/G/1 queueing system in which the server becomes unavailable for (independent) random periods each time he is free. This problem was first studied by Gelenbe and Iasnogorodski [6] who obtained the stationary law of the waiting time of a customer. We construct a simple probabilistic model coupling a G//G/1 queue with an autonomous server (in Borovkov's terminology [1]) with a GI/G/1 queue of classical type having the same characteristics, to compare them stochastically. We prove that the waiting time is a Markov chain, using a renewal process property which has not previously been noted.

Information

Type
Letters to the Editor
Copyright
Copyright © Applied Probability Trust 1986