A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks

Doo Il Choi, Charles Knessl and Charles Tier

International Journal of Stochastic Analysis, 1999, vol. 12, 1-28

Abstract:

A queueing system ( M / G 1 , G 2 / 1 / K ) is considered in which the service time of a customer entering service depends on whether the queue length, N ( t ) , is above or below a threshold L . The arrival process is Poisson, and the general service times S 1 and S 2 depend on whether the queue length at the time service is initiated is < L or ≥ L , respectively. Balance equations are given for the stationary probabilities of the Markov process ( N ( t ) , X ( t ) ) , where X ( t ) is the remaining service time of the customer currently in service. Exact solutions for the stationary probabilities are constructed for both infinite and finite capacity systems. Asymptotic approximations of the solutions are given, which yield simple formulas for performance measures such as loss rates and tail probabilities. The numerical accuracy of the asymptotic results is tested.

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/12/780913.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/12/780913.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:780913

DOI: 10.1155/S1048953399000052

Access Statistics for this article

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