Congestion Control in Packet Switching Computer Communication Networks

Research output: ThesisDoctoral Thesis (monograph)

Standard

Congestion Control in Packet Switching Computer Communication Networks. / Körner, Ulf.

1982.

Research output: ThesisDoctoral Thesis (monograph)

Harvard

Körner, U 1982, 'Congestion Control in Packet Switching Computer Communication Networks', Doctor, Department of Electrical and Information Technology.

APA

CBE

MLA

Vancouver

Author

RIS

TY - THES

T1 - Congestion Control in Packet Switching Computer Communication Networks

AU - Körner, Ulf

N1 - Defence details Date: 1982-04-16 Time: 10:15 Place: Sal E:B, Elektronikhuset, Lund Tekniska Högskola External reviewer(s) Name: B. Iversen, Villy Title: Dr Affiliation: Danmarks Tekniska Högskola --- The information about affiliations in this record was updated in December 2015. The record was previously connected to the following departments: Department of Communication Systems (011020000)

PY - 1982

Y1 - 1982

N2 - 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.

AB - 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.

M3 - Doctoral Thesis (monograph)

ER -