Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with
β¦ LIBER β¦
Stochastic comparisons for single-server queues
β Scribed by Carl M. Harrissp; N. U. Prabhu
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 613 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Stochastic analysis of a single server r
β
A. GΓ³mez-Corral
π
Article
π
1999
π
John Wiley and Sons
π
English
β 153 KB
Some Qualitative Properties of Single Se
β
Dietrich; Helga Stoyan
π
Article
π
1975
π
John Wiley and Sons
π
English
β 309 KB
Single server queues with hyperexponenti
β
Irwin Greenberg
π
Article
π
1977
π
John Wiley and Sons
π
English
β 230 KB
An approximation for the waiting time di
β
Irwin Greenberg
π
Article
π
1980
π
John Wiley and Sons
π
English
β 357 KB
On a single-server queue with state-depe
β
J. G. Shanthikumar
π
Article
π
1979
π
John Wiley and Sons
π
English
β 269 KB
Dynamic server assignment policies for a
β
Yi-Chun Tsai; Nilay TanΔ±k Argon
π
Article
π
2008
π
John Wiley and Sons
π
English
β 194 KB
## Abstract We seek dynamic server assignment policies in finiteβcapacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steadyβstate throughput. We completely characterize the optimal policy for a