Dimensioning of message-switched computer communications networks with end-to-end flow control

A message-switched computer network with end-to-end window flow control is considered. An algorithm for the selection of the best flow-control window settings is developed using heuristics for the numberical solution of such networks. The criterion of performance is the ratio of the network average throughput to the average network delay. An example network demonstrates the results.