The M/D/1+D queue has the minimum loss probability among M/G/1+G queues.
Yoshiaki InoueTetsuya TakinePublished in: Oper. Res. Lett. (2015)
Keyphrases
- markov model
- loss probability
- finite buffer
- markov chain
- steady state
- stationary distribution
- queue length
- service times
- queueing networks
- queueing systems
- service rates
- single server
- queueing model
- state dependent
- finite capacity
- waiting times
- heavy traffic
- transition probabilities
- poisson arrivals
- arrival process
- arrival rate
- pose estimation
- image registration
- single server queue
- processor sharing
- production system
- learning algorithm