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
A single server queue in a hard-real-time environment
β Scribed by Francois Baccelli; Kishor S Trivedi
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 336 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The throughput optimality of priority management strategies in a single buffer has been studied for a general aggregate arrival law. The tight upper bounds found are useful to understand optimality in the utilization of specific priority schemes such as push-out buffer (POB) and partial buffer shari
In this paper, we address the problem of scheduling communication over the interconnection network of a distributed-memory multicomputer video server. We show that this problem is closely related to the problem of data distribution and movie scheduling in such a system. A solution is proposed in thi