{"id":{"repo_id":"bradford","oai_identifier":"oai:bradscholars.brad.ac.uk:10454/4877"},"canonical_url":"https://search.dev.ndltd.org/etd/bradford/oai:bradscholars.brad.ac.uk:10454/4877","repository":{"repo_id":"bradford","name":"University of Bradford","base_url":"https://bradscholars.brad.ac.uk/oai/request"},"display":{"title":"Performance 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.","abstract":"Analytical 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.","abstract_html":"Analytical 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.","abstract_has_math":false,"creators":["Alsawaai, Amina S.M."],"institution":"University of Bradford","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Awan, Irfan U.","Fretwell, Rod J."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-11","date_published":"2011-05-11","updated_at":"2026-07-24T01:14:20Z","subjects":["Weighted Fair Queueing (WFQ) System","Performance analysis","Modelling","Communication networks","Scheduling algorithms"],"languages":["en"],"rights":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10454/4877","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Awan, Irfan U.","Fretwell, Rod J."]},{"key":"dc:creator","label":"Author","values":["Alsawaai, Amina S.M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-05-11T14:52:23Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-05-11T14:52:23Z"]},{"key":"dc:date.issued","label":"Date","values":["2011-05-11"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["School of Computing, Informatics and Media"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Bradford"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Weighted Fair Queueing (WFQ) System","Performance analysis","Modelling","Communication networks","Scheduling algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10454/4877"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Analytical 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."]},{"key":"dc:title","label":"Title","values":["Performance 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."]}]}],"canonical_facts":{"dc:contributor.advisor":["Awan, Irfan U.","Fretwell, Rod J."],"dc:creator":["Alsawaai, Amina S.M."],"dc:date.accessioned":["2011-05-11T14:52:23Z"],"dc:date.available":["2011-05-11T14:52:23Z"],"dc:date.issued":["2011-05-11"],"dc:description.abstract":["Analytical 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."],"dc:identifier.uri":["http://hdl.handle.net/10454/4877"],"dc:language.iso":["en"],"dc:publisher.department":["School of Computing, Informatics and Media"],"dc:publisher.institution":["University of Bradford"],"dc:rights":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."],"dc:subject":["Weighted Fair Queueing (WFQ) System","Performance analysis","Modelling","Communication networks","Scheduling algorithms"],"dc:title":["Performance 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."],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["PhD"]},"updated_at":"2026-07-24T01:14:20Z"}