Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently\ud received considerable attention by several researches since WFQ offers the minimum\ud delay and optimal fairness guarantee. However, all previous work on WFQ has\ud focused on developing approximations of the scheduler with an infinite buffer because of\ud supposed scalability problems in the WFQ computation.\ud The main aims of this thesis are to study WFQ system, by providing an analytical WFQ\ud model which is a theoretical construct based on a form of processor sharing for finite\ud capacity. Furthermore, the solutions for classes with Poisson arrivals and exponential\ud service are derived and verified against global balance solution.\ud This thesis shows that the analytical models proposed can give very good results under\ud particular conditions which are very close to WFQ algorithms, where accuracy of\ud the models is verified by simulations of WFQ model. Simulations were performed with\ud QNAP-2 simulator. In addition, the thesis presents several performance studies signifying\ud the power of the proposed analytical model in providing an accurate delay bounds to\ud a large number of classes.\ud These results are not able to cover all unsolved issues in the WFQ system. They represent\ud a starting point for the research activities that the Author will conduct in the future. The\ud author believes that the most promising research activities exist in the scheduler method\ud to provide statistical guarantees to multi-class services. The author is convinced that\ud alternative software, for example, on the three class model buffer case, is able to satisfy\ud the large number of buffer because of the software limitation in this thesis. While they can\ud be a good topic for long-term research, the short-medium term will show an increasing\ud interest in the modification of the WFQ models to provide differentiated services.Ministry of Higher Educatio
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.