Show simple item record

dc.contributor.advisorAwan, Irfan U.
dc.contributor.advisorFretwell, Rod J.
dc.contributor.authorAlsawaai, Amina S.M.*
dc.date.accessioned2011-05-11T14:52:23Z
dc.date.available2011-05-11T14:52:23Z
dc.date.issued2011-05-11
dc.identifier.urihttp://hdl.handle.net/10454/4877
dc.description.abstractAnalytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received considerable attention by several researches since WFQ offers the minimum delay and optimal fairness guarantee. However, all previous work on WFQ has focused on developing approximations of the scheduler with an infinite buffer because of supposed scalability problems in the WFQ computation. The main aims of this thesis are to study WFQ system, by providing an analytical WFQ model which is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solutions for classes with Poisson arrivals and exponential service are derived and verified against global balance solution. This thesis shows that the analytical models proposed can give very good results under particular conditions which are very close to WFQ algorithms, where accuracy of the models is verified by simulations of WFQ model. Simulations were performed with QNAP-2 simulator. In addition, the thesis presents several performance studies signifying the power of the proposed analytical model in providing an accurate delay bounds to a large number of classes. These results are not able to cover all unsolved issues in the WFQ system. They represent a starting point for the research activities that the Author will conduct in the future. The author believes that the most promising research activities exist in the scheduler method to provide statistical guarantees to multi-class services. The author is convinced that alternative software, for example, on the three class model buffer case, is able to satisfy the large number of buffer because of the software limitation in this thesis. While they can be a good topic for long-term research, the short-medium term will show an increasing interest in the modification of the WFQ models to provide differentiated services.en_US
dc.description.sponsorshipMinistry of Higher Educationen_US
dc.language.isoenen_US
dc.rights<a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-nc-nd/3.0/88x31.png" /></a><br />The University of Bradford theses are licenced under a <a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/">Creative Commons Licence</a>.en_US
dc.subjectWeighted Fair Queueing (WFQ) Systemen_US
dc.subjectPerformance analysisen_US
dc.subjectModellingen_US
dc.subjectCommunication networksen_US
dc.subjectScheduling algorithmsen_US
dc.titlePerformance Modelling and Analysis of Weighted Fair Queueing for Scheduling in Communication Networks. An investigation into the Development of New Scheduling Algorithms for Weighted Fair Queueing System with Finite Buffer.en_US
dc.type.qualificationleveldoctoralen_US
dc.publisher.institutionUniversity of Bradfordeng
dc.publisher.departmentSchool of Computing, Informatics and Mediaen_US
dc.typeThesiseng
dc.type.qualificationnamePhDen_US
dc.date.awarded2010
refterms.dateFOA2018-07-19T04:57:42Z


Item file(s)

Thumbnail
Name:
AminaPhdThesis.pdf
Size:
2.292Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record