Sign in

A Numerically Efficient Method for a MAP/D/1/K Queue when Space and Service Times are Independent.

Nail AkarErdal Arikan
Published in: Queueing Syst. Theory Appl. (1996)
Keyphrases
  • computational complexity
  • probabilistic model
  • dynamic programming
  • service times
  • search space
  • steady state
  • test bed
  • state dependent