Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic (Q607269)

From MaRDI portal





scientific article; zbMATH DE number 5817765
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic
    scientific article; zbMATH DE number 5817765

      Statements

      Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic (English)
      0 references
      19 November 2010
      0 references
      In this paper a stochastic processing system with variable arrival and service rates both drift control policy as well as rejection control policy are given consideration. The authors established a necessary and sufficient condition for the optimal buffer size. Then, with the aid of the assumed cost function, including a penalty for each rejected customers, the explicit optimal strategy for the limiting diffusion control problem (the Brownian control problem or BCP) was determined. In detail, an optimal buffer size and an optimal service rate for the queueing system in heavy traffic was established. The above referenced BCP problem addresses the cost structure for the control problem, as well as the main result of this paper. In my opinion it provides the proofs confirming the asymptotic optimality for the queueing system in heavy traffic. Furthermore, the problem of optimal buffer size and dynamic rate control for this queueing system with the rejection and impatient customers was effectively clarified. The specification about the BCP problem can be studied independently of other parts.
      0 references
      0 references
      queueing theory
      0 references
      performance evaluation
      0 references
      queueing
      0 references
      applications of diffusion theory
      0 references
      queues and services
      0 references
      scheduling theory
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references