Analysis of packet-switched computer-communication networks with congestion control.

Abstract

This thesis addresses the problem of congestion control of packet-switched (or message-switched) computer-communication networks. Methods of analysis are given for the following cases: end-to-end congestion control with random routing and the local congestion control with random routing. Expressions have been derived for certain standard performance measures. Analysis is applied to certain examples.