A very simple algorithm for flow control on high speed networks via La Palice queueings

Flow control algorithms specially designed for high speed networks are introduced. They are based on a new queuing model called the La Palice queue. An algorithm that is simply an extrapolation of the classic flow control algorithm with a request to the destination and an answer to the source is presented. It is shown that the overflow occurrence is lowered to a certain probability by the application of the algorithm. An intermediate algorithm is presented that cancels overflow occurrence, but allows repetition of requests with a certain probability per multipacket message