University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
|Title: ||Bounds and Approximations for Stochastic Fluid Networks|
|Authors: ||Haddad, Jean-Paul|
|Keywords: ||Stochastic Fluid Networks|
|Approved Date: ||12-Aug-2011 |
|Date Submitted: ||2011 |
|Abstract: ||The success of modern networked systems has led to an increased reliance and greater demand of their services. To ensure that the next generation of networks meet these demands, it is critical that the behaviour and performance of these networks can be reliably predicted prior to deployment. Analytical modeling is an important step in the design phase to achieve both a qualitative and quantitative understanding of the system. This thesis contributes towards understanding the behaviour of such systems by providing new results for two fluid network models: The stochastic fluid network model and the flow level model.
The stochastic fluid network model is a simple but powerful modeling paradigm. Unfortunately, except for simple cases, the steady state distribution which is vital for many performance calculations, can not be computed analytically. A common technique to alleviate this problem is to use the so-called Heavy Traffic Approximation (HTA) to obtain a tractable approximation of the workload process, for which the steady state distribution can be computed. Though this begs the question: Does the steady-state distribution from the HTA correspond to the steady-state distribution of the original network model? It is shown that the answer to this question is yes. Additionally, new results for this model concerning the sample-path properties of the workload are obtained.
File transfers compose much of the traffic of the current Internet. They typically use the transmission control protocol (TCP) and adapt their transmission rate to the available bandwidth. When congestion occurs, users experience delays, packet losses and low transfer rates. Thus it is essential to use congestion control algorithms that minimize the probability of occurrence of such congestion periods. Flow level models hide the complex underlying packet-level mechanisms and simply represent congestion control algorithms as bandwidth sharing policies between flows. Balanced Fairness is a key bandwidth sharing policy that is efficient, tractable and insensitive. Unlike the stochastic fluid network model, an analytical formula for the steady-state distribution is known. Unfortunately, performance calculations for realistic systems are extremely time consuming. Efficient and tight approximations for performance calculations involving congestion are obtained.|
|Program: ||Electrical and Computer Engineering|
|Department: ||Electrical and Computer Engineering|
|Degree: ||Doctor of Philosophy|
|Appears in Collections:||Faculty of Engineering Theses and Dissertations |
Electronic Theses and Dissertations (UW)
All items in UWSpace are protected by copyright, with all rights reserved.