Simulated annealing for throughput optimization in communication networks with window flow control

A queuing model of a multichain network is presented where the network is window flow controlled on its virtual channel of the communication network. Its performance is optimized based on simulated annealing. The solution space is assumed to be the set of all admissible service rates of all stations with the nonlinear cost constraint. The optimum total throughput of the network is determined for different chain packets. It is shown that the most desirable method against congestion in any region is to speed up the transmission rate of that channel, but since this costs too much, alternative methods should be considered which reduce the window size within the tolerable limit of throughputs