Black box modelling of congestion control protocols for computer networks

Abstract

In this thesis, we look at some fundamental problems facing computer networking technology. An extensive treatment of these areas is presented in the first instance. A number of putative concepts, terminology and techniques, as pertinent to numerous schools of thought, are presented, investigated and critiqued. Going forward, we narrow our focus of consideration to some basic issues and trends in the management of Internet congestion control, as well as many (now) traditional attempts to address these problems. Key formulations are laid out, which set up the problem at hand, and we raise many more fundamental questions. Key trends observable in the literature are discussed. This provides a relatively smooth introduction to the subject. Reference is then made to Sierra, a novel "Black Box" congestion control algorithm/protocol, which itself is the subject of serious ongoing refinement, having already been baselined in five research papers on the subject. The "Black Box" terminology was in essence conceived many years ago by van Jacobson, and is revived in this thesis. A framework for the comparative, stochastic (theoretical) analysis of various congestion control algorithms/protocols is taken up and investigated. From a theoretical, quantitative perspective, it is shown that Sierra offers relatively superior throughput related performance levels. Finally, we take up the matter of comparative simulation of Sierra, vis-a'-vis its "competitors". For this project, the popular network simulator (tool) OPNET is taken up and deployed. We present (here) and analyze the results from numerous simulation experiments. The outcome is that Sierra enhances throughput, as against other more traditional Black Box algorithms (Vegas, Reno, New Reno, etc.).

Date of Award	2009
Original language	English