Congestion Control in Packet Switching Computer Communication Networks

Sammanfattning: The objective of this research is in general to develop analytic tools for the performance study of computer networks, and is in particular motivated by a need to understand how restricted buffer sharing policies can be used for congestion control in the nodes of a packet switching computer communication network. Models of a single packet switching node with finite storage and restricted buffer sharing policies are developed. Effexts of acknowledgement signals as well as retransmission are considered. We introduce the concept of "penalty functions" and incorporate these in the packet switching node model in order to give priority to packets that have reached their destination node and thus should be lost. The single packet switching node models are used to form a model of a complete packet switching network. We present for the different models comprehensive results as thoughput, delays, blocking probabilities and buffe allocation schemes. We derive a number of analytic tools, inroduce some new concepts and clarify some techniques, used in our models, to compute the main performance characteristics.