Maximum throughput versus minimum queue: a Martingale approach
A single server system is considered to which customers arrive according to a point process with locally integrable deterministic intensity function. Service times are independent and identically distributed random variables. Customers arriving at the system may be either refused and sent away forever or admitted to the queue. The cost of running the queueing system during a finite interval of time is defined as a function of both the number of admissions and the total time spent waiting. The author addresses the problem of finding an admission policy that minimizes the expected cost of running the system. This problem is solved using martingale theory.
- On queueing systems with variable intensities (martingale approach)
- Asymptotic analysis of queueingnetworks
- Martingale methods for analysing single-server queues
- scientific article; zbMATH DE number 3866340
- Maximizing throughput in queueing networks with limited flexibility
- Maximizing Throughput in Queueing Networks with Limited Flexibility
- Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
- scientific article; zbMATH DE number 431649
This page was built for publication: Maximum throughput versus minimum queue: a Martingale approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4721359)