Discrete-time GeoX/G/1 queue with preemptive resume priority

Lee, Yutae

doi:10.1016/s0895-7177(01)00057-7

Cited by 23 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Discrete-time preemptive resume priority queues are the subject of [48][49][50][51][52][53]. Walraevens et al [49] and Ndreca and Scoppola [52] analyze a two-class preemptive priority queue with geometric service times.…”

Section: Introductionmentioning

confidence: 99%

“…Walraevens et al [49] and Ndreca and Scoppola [52] analyze a two-class preemptive priority queue with geometric service times. Walraevens et al [50] study a priority queue with general high-priority service times and geometric low-priority service times, while Lee [48] and Walraevens et al [53] handle a twoclass priority queue with generally distributed service times for both classes. Van Houdt and Blondia [51] analyze a three-class priority queue.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of Priority Queueing Systems in Discrete Time

Walraevens

Fiems

Bruneel

2011

Network Performance Engineering

View full text Add to dashboard Cite

Abstract. The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Priority Queueing Systems in Discrete Time

Walraevens

Fiems

Bruneel

2011

Network Performance Engineering

View full text Add to dashboard Cite

show abstract

“…In non-preemptive case, as soon as service of a particular customer is completed, the next service is given to a customer of high-priority class, i.e. [18]. A preemptive system interrupts a service to a customer once a higher-priority user arrives at the system, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…A preemptive system interrupts a service to a customer once a higher-priority user arrives at the system, i.e. [19,20]. In a discrete-time system, preemptive priority means that when at least one high-priority customer is present at the beginning of a given slot, necessarily a highpriority customer is in service at the beginning of that slot.…”

Section: Introductionmentioning

confidence: 99%

A preemptive discrete-time priority buffer system with partial buffer sharing

Jolai¹,

Asadzadeh²,

Taghizadeh³

2010

Applied Mathematical Modelling

View full text Add to dashboard Cite

a b s t r a c tThis paper considers a Geo/Geo/1 discrete-time queue with preemptive priority. Both the arrival and service processes are Bernoulli processes. There are two kinds of customers: low-priority and high-priority customers. The high-priority customers have a preemptive priority over low-priority customers. If the total number of customers is equal or more than the threshold (k), the arrival of low-priority customers will be ignored. Hence the system buffer size is finite only for the low-priority customers. A recursive numerical procedure is developed to find the steady-state probabilities. With the aid of recursive equations, we transform the infinite steady-state departure-epoch equations set to a set of (k + 1) Â (k + 2)/2 linear equations set based on the embedded Markov Chain technique. Then, this reduced linear equations set is used to compute the steady-state departureepoch probabilities. The important performance measures of the system are calculated. Finally, the applicability of the solution procedure is shown by a numerical example and the sensitivity of the performance measures to the changes in system parameters is analyzed.

show abstract

“…In Reference [8], the additional assumption of multiple servers is used. Extensions of the deterministic service time appeared in many analyses, such as [9] where the arrivals are assumed to come from three-state sources, [11] where the service time is assumed geometric, [10] where the service time is assumed general and the priority scheme assumed preemptive resume.…”

Section: Introductionmentioning

confidence: 99%

Waiting time distribution of an ATM switch routing two‐class traffic with two service rates

Nassar

Ahmed

2003

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this article we analyse the waiting time of an arbitrary packet in an output buffered space division switch routing two-class traffic, e.g. in a multimedia environment. For the purpose of the analysis, the switch is modelled as a priority, discrete time, batch arrival queueing system, with a single server having two service rates. The results of the analysis are verified in various ways, including obtaining previously published results as special cases.The fundamental contribution of this article is the assumption of two service rates, one for each class, rather than the typical assumption of one service rate for both classes. This assumption is useful in that it accounts for the different quality of service (QoS) needs of each class. Another contribution is the introduction of a new approach to analyse the waiting time}an approach not based on the system occupancy as is typical in the published literature.

show abstract

Discrete-time GeoX/G/1 queue with preemptive resume priority

Cited by 23 publications

References 14 publications

Performance Analysis of Priority Queueing Systems in Discrete Time

Performance Analysis of Priority Queueing Systems in Discrete Time

A preemptive discrete-time priority buffer system with partial buffer sharing

Waiting time distribution of an ATM switch routing two‐class traffic with two service rates

Contact Info

Product

Resources

About