End to end congestion control of packet switched networks

Abstract

This paper proposes an adaptive methodology to prevent congestion in packet switched networks such as the internet, where the internal network nodes convey very little information to the ingress nodes. A novel architecture of preventing the congestion is presented when the traffic arrival rates and bottleneck queue levels are known. In the architecture, the congestion is controlled by adjusting the transmission rates of non real-time and certain real-time sources in response to the feedback information so that a desired quality of service (QoS) can be met instead of using the existing additive increase multiplicative decrease (AIMD) algorithm. The QoS is defined in terms of packet loss, transmission delay, network utilization and fairness. Mathematical analysis is given to demonstrate the stability of the closed-loop system. The proposed methodology can be readily applied to network planning, designing routing algorithms and transmission links as well as for real-time video and voice data transfer in unicast networks.