Performance analysis of computer communication networks with local and global window flow control

A message-switched network with local and global window flow controls is analyzed. Messages arriving to find the global window full or the first destination´s local window full are assumed to be lost. Further, if a message from a source system is sent to a destination system of which the local window is full, the message blocks the source system until it can be received from the destination. In that time, no other message can be processed by the source system. An open tandem queueing network model with blocking is developed where the service times are assumed to be general and the scheduling disciplines are first-come, first-served. An approximation algorithm for the effective computation of performance measures, such as the throughput of the system, mean number of messages in the global window, and the mean delay time of the system, is given. The approximation has been validated by several examples; comparing the analytical results with simulation demonstrates good agreement