G I X / M Y / 1 systems with resident server and generally distributed arrival and service groups

Alexander Dukhovny

International Journal of Stochastic Analysis, 1996, vol. 9, 1-12

Abstract:

Considered are bulk systems of G I / M / 1 type in which the server stands by when it is idle, waits for the first group to arrive if the queue is empty, takes customers up to its capacity and is not available when busy. Distributions of arrival group size and server's capacity are not restricted. The queueing process is analyzed via an augmented imbedded Markov chain. In the general case, the generating function of the steady-state probabilities of the chain is found as a solution of a Riemann boundary value problem. This function is proven to be rational when the generating function of the arrival group size is rational, in which case the solution is given in terms of roots of a characteristic equation. A necessary and sufficient condition of ergodicity is proven in the general case. Several special cases are studied in detail: single arrivals, geometric arrivals, bounded arrivals, and an arrival group with a geometric tail.

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/9/252703.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/9/252703.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:252703

DOI: 10.1155/S1048953396000160

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().