Queueing systems with random service rate

Authors
Citation
V. Sharma, Queueing systems with random service rate, PERF EVAL, 40(4), 2000, pp. 223-238
Citations number
40
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Computer Science & Engineering
Journal title
PERFORMANCE EVALUATION
ISSN journal
0166-5316 → ACNP
Volume
40
Issue
4
Year of publication
2000
Pages
223 - 238
Database
ISI
SICI code
0166-5316(200004)40:4<223:QSWRSR>2.0.ZU;2-8
Abstract
We consider a queue with the arrival process, the service time process and the service rate process as regenerative processes. We provide conditions f or its stability, rates of convergence, finiteness of moments and functiona l limit theorems. This queue can model a queue serving ABR and UBR traffic in an ATM switch; a multiple access channel with TDMA or CDMA protocol and fading; a queue holding best effort or controlled and guaranteed traffic in a router in the integrated service architecture (ISA) of IP-based Internet and a scheduler in the router of a differentiated service architecture. In the process we also provide results for a queue with a leaky bucket contro lled bandwidth scheduler. This result is of independent interest. We extend these results to feed-forward networks of queues. We also obtain the resul ts when the arrival rate to the queue can be feedback controlled based on t he congestion information in the queue (as in ABR service in the ATM networ ks or in the real time applications controlled by RTCP protocol in the Inte rnet). (C) 2000 Elsevier Science B.V. All rights reserved.