A Random-Walk Model of a Queue Storage Problem
暂无分享,去创建一个
Abstract—A probability model of queue storage allocation problems is devised and an analysis is provided based on the theory of random walks. Two types of queue storage allocation are discussed and analyzed, after which examples are given to illustrate their relative advantages and disadvantages.
[1] Edward G. Coffman,et al. On the Motion of an Unbounded, Markov Queue in Random Access Storage , 1968, IEEE Transactions on Computers.