Local congestion control in computer-communication networks with random routing
SIGCOMM '77 Proceedings of the fifth symposium on Data communications
Queuing networks with population size constraints
IBM Journal of Research and Development
Queuing networks with multiple closed chains: theory and computational algorithms
IBM Journal of Research and Development
Hi-index | 0.24 |
Congestion in a store-and-forward data communications network manifests itself by a rapid degradation of network throughput and a fast increase in the average transit delay. A study of a congestion control mechanism in a packet-switched data network is presented. Buffer limits are placed on the input, transit and exit packets in each switching node. By a judicious choice of the buffer limits, it is shown that the network throughput can be maintained at a constant level, while the average transit delay remains within acceptable bounds for offered loads beyond the congestion point.