Sampled Time Flow Control for Wide Area Connection Oriented Communication Networks

Abstract

This paper presents a new, sampled time flow control algorithm for fast connection oriented communication networks. The algorithm employs a simple, proportional controller together with Smith predictor applied for delay compensation. It has been proved that an appropriate selection of the bottleneck buffer capacity assures no cell loss and the maximum possible throughput of the controlled virtual circuit. Moreover, transmission rates generated by the algorithm are always non-negative and bounded by the maximum bandwidth available for the controlled connection. These properties of the proposed algorithm enable its direct implementation in the network environment. The steady state queue length of the bottleneck node buffer is estimated.