End-to-end delay of multiple packet messages in window flow controlled packet switching networks

A heuristic algorithm for computing the end-to-end delay of multiple-packet messages is developed. The network is assumed to use virtual circuits subject to window flow control. The model is presented. It results in a closed queuing network in which batch transitions may occur due to arrivals of multiple-packet messages. The algorithm is presented and developed in order to determine the message delay. Simulations are used to validate the resulting algorithm.<
>