Computational Procedures for a Class of GI/D/ k Systems in Discrete Time

Md. Mostafizur Rahman and Attahiru Sule Alfa

Journal of Probability and Statistics, 2009, vol. 2009, 1-18

Abstract:

A class of discrete time GI/D/ systems is considered for which the interarrival times have finite support and customers are served in first-in first-out (FIFO) order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by assuming cyclic assignment of customers to the identical servers. Then the queue length is set up as a quasi-birth-death (QBD) type Markov chain. It is shown that this transformed GI/D/1 system has special structures which make the computation of the matrix R simple and efficient, thereby reducing the number of multiplications in each iteration significantly. As a result we were able to keep the computation time very low. Moreover, use of the resulting structural properties makes the computation of the distribution of queue length of the transformed system efficient. The computation of the distribution of waiting time is also shown to be simple by exploiting the special structures.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JPS/2009/716364.pdf (application/pdf)
http://downloads.hindawi.com/journals/JPS/2009/716364.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:jnljps:716364

DOI: 10.1155/2009/716364

Access Statistics for this article

More articles in Journal of Probability and Statistics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().