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.
No takes yet. Share an insight, caveat, or question.
Konheim et al. (1976) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: