Login / Signup
Discrete-time analysis of a finite capacity queue with an "all or nothing policy" to reduce burst loss.
Johan M. Karlsson
Hideaki Yamashita
Published in:
Data Communications and their Performance (1995)
Keyphrases
</>
finite capacity
single product
scheduling problem
markov chain
sufficient conditions
optimal policy
arrival rate
queueing model