On the Maximum Average Throughput Rate for a Tandem Node Network

The problem of regulating inputs into a tandem store-and-forward node pair with finite queue limits in order to maximize the average message completion rate is considered from the viewpoint of Markov Decision Theory. A variation of the policy iteration procedure due to Howard [3] is used to compute optimum control policies and message completion rates for various configurations of system parameters. Comparative data are provided on the performance of the optimum control law relative to simpler local control laws which require no information sharing.