David Carmel, Haggai Roitman, et al.
ACM TIST
A two-stage queueing network with feedback and a finite intermediate waiting room is studied. The first-stage server is blocked whenever M requests are enqueued in the second stage. The analysis of this system under exponential assumptions is carried out. An algorithm to calculate the stationary state probabilities is given and some special cases are considered. © 1976, ACM. All rights reserved.
David Carmel, Haggai Roitman, et al.
ACM TIST
Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM