Paper Info
Title
Simulation studies of a multi-priority dual queue (MPDQ) with preemptive and non-preemptive scheduling
Abstract
Traffic management in communication environments like the Internet is vital in meeting the demand of users. The recent introduction of various dynamic scheduling algorithms has been to target improvements in QoS (Quality of Service). These new algorithms, such as dual queueing, aim to give better QoS to most traffic at the expense of a few rather than fairly give poor QoS to all customers. This is achieved through scheduling decisions that can change depending on the traffic conditions. The MPDQ introduces different classes into this type of scheme with the aim of enhancing higher-class packets QoS without great expense to lower class packets. In this paper we analyse the differences in loss and waiting time between preemptive and non-preemptive service disciplines for the MPDQ and then identify the best queueing regime for the pre-emptive MPDQ. We show that non-preemptive service dispensing is superior to packets of two classes than the preemptive scheme, and that highest class first (HCF) is the best queueing regime for either of these algorithms.
Year
DOI
Venue
2003
10.1007/3-540-44863-2_19
International Conference on Computational Science
Keywords
Field
DocType
traffic management,better qos,dual queueing,great expense,multi-priority dual queue,non-preemptive scheduling,traffic condition,simulation study,pre-emptive mpdq,poor qos,different class,queueing regime,highest class,dynamic scheduling,quality of service,preemptive scheduling
Fixed-priority pre-emptive scheduling,Computer science,Scheduling (computing),Network packet,Queue,Computer network,Quality of service,Queueing theory,Dynamic priority scheduling,Distributed computing,The Internet
Conference
Volume
ISSN
ISBN
2659
0302-9743
3-540-40196-2
Citations 
PageRank 
References 
0
0.34
3
Authors
2
Name
Order
Citations
PageRank
Anthony Bedford100.34
Panlop Zeephongsekul214419.11