Back to results list
Please use this identifier to cite or link to this item:
|Title:||Optimised queuing strategies for multi-level QoS||Authors:||Yan, Ming-leong||Keywords:||Hong Kong Polytechnic University -- Dissertations
Queuing theory -- Mathematical models
TCP/IP (Computer network protocol)
Network analysis (Planning)
|Issue Date:||2006||Publisher:||The Hong Kong Polytechnic University||Abstract:||A variety of network applications, such as FTP, HTTP, video on-demand, IP phone, have different requirements on traffic parameters, such as bandwidth, loss rate, delay bound and delay jitter. In order to provide the guaranteed service on above four traffic parameters, the concept of Quality of Service (QoS) and traffic management is essential to apply on the end-to-end paths of network applications. Most QoS scheduling algorithms applies a single-parameter approach; they are based on either bandwidth or delay. In order to support more than one QoS parameter, the decoupling of bandwidth and delay in queuing can be deployed and this has been proved a difficult problem. Although recent research has tried to use rate regulator and priority-based scheduler to guarantee bandwidth and delay criteria respectively, the outgoing performance is insufficiently acceptable in order to be implemented in the present network environments. In this research, a new scheduling algorithm called Delay-Differentiable Fair Queuing (D²FQ) algorithm is proposed. This algorithm is a two-parameter approach that decouples the bandwidth and delay into a single model. Although D²FQ consists of the functions of rate regulator and delay scheduler, it has a low time complexity, O(log(L)), where L is a key component in D²FQ scheduler. This scheduling algorithm is also practicable for industrial applications. This thesis will also show the fairness analysis of D²FQ where the fairness on the bandwidth allocation is the basic criterion for QoS. The computation complexity and the delay bound will also be analyzed in detail.
For the purpose of simulation discussed in this thesis, a single-node network topology and multi-node network topology will be applied. Single-node network topology can simplify the network environment to facilitate the performance analysis of the scheduler in respect to fairness of bandwidth allocation. In this thesis, a single-node network will be applied on connectionless traffic analysis, which includes the throughput fairness and differentiate delay fairness on different offered loads and different traffic conditions. Some famous schedulers, such as WFQ, DRR and CSFQ, are used for performance comparison with D²FQ. The two traffic parameters of D²FQ, throughput weight and delay weight, produce a more complex traffic condition and provide a more useful analysis on D²FQ. A single-node network is generally used for connectionless traffic analysis. Most of the packet schedulers only use a single-node network topology. In addition to the propositions stated above, multi-node network topology will also be applied on connection-oriental traffic analysis in this thesis. Analysis on connection-oriented flow is useful because most of the traffics in present network are connection-oriented flow and the multi-node network topology can increase the increase the credibility of performance on D²FQ. The analysis for simulation on multi-node network topology includes drop rate and delay on the condition of overloading. The simulation results show that D²FQ has a good performance on throughput analysis and flow isolation, which conclude that D²FQ can fairly decouple throughput and delay.
|Description:||ix, 120, x leaves : ill. (some col.) ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577M EIE 2006 Yan
|URI:||http://hdl.handle.net/10397/3886||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|b20593235_link.htm||For PolyU Users||162 B||HTML||View/Open|
|b20593235_ir.pdf||For All Users (Non-printable)||1.84 MB||Adobe PDF||View/Open|
Citations as of Mar 18, 2018
Citations as of Mar 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.