Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy

Hwang, Gang Uk; Choi, Bong Dae

doi:10.1016/s0305-0548(03)00175-8

Cited by 9 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Once the number of unprioritised effective arrivals is known, it is straightforward that prioritized packets are accepted as long as the queue is not entirely full. 6. Numerical examples.…”

Section: 1mentioning

confidence: 99%

Partially shared buffers with full or mixed priority

Demoor¹,

Fiems²,

Walraevens³

et al. 2011

Journal of Industrial &Amp; Management Optimization

View full text Add to dashboard Cite

This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.

show abstract

“…Once the number of unprioritised effective arrivals is known, it is straightforward that prioritized packets are accepted as long as the queue is not entirely full. 6. Numerical examples.…”

Section: 1mentioning

confidence: 99%

Partially shared buffers with full or mixed priority

Demoor¹,

Fiems²,

Walraevens³

et al. 2011

Journal of Industrial &Amp; Management Optimization

View full text Add to dashboard Cite

show abstract

“…Among the set of articles in the literature, [7], [26], and [5] provide an appropriate overview of the latter techniques, respectively. In [27] and [12], performance analysis studies of a number of buffer management schemes are provided. The tradeoff between the available bandwidth and buffer space is studied in [20].…”

Section: Introductionmentioning

confidence: 99%

A neuro-forecastwater-filling scheme of server scheduling

Yousefi'zadeh

2006

2006 International Conference on Systems and Networks Communications (ICSNC'06)

View full text Add to dashboard Cite

Dynamic server scheduling schemes in queuing systems accommodating delay-sensitive traffic need to address the tradeoff between efficiency and fairness. For delay-sensitive traffic, threshold-exceeding delay or equivalently loss is used as a measure of efficiency. In this paper, a pair of dynamic server scheduling schemes for queuing systems accommodating delaysensitive traffic are compared. Each scheme consists of two components. The first component attempts at forecasting the arriving traffic patterns of the sources sharing the server bandwidth and the second component makes the assignment of server bandwidth among the sources. The schemes utilize BFGS and resilient backpropagation learning in perceptron neural networks to forecast the arriving traffic patterns, respectively. Once the traffic patterns are forecast, the schemes rely on water-filling to make the server bandwidth assignments max-min fair. Our simulations reveal the efficiency and fairness characteristics of the schemes.

show abstract

“…The latter is due to the fact that the schemes can allow packet loss in a partitioned buffer while another partitioned buffer is not full. The work in [27] provides a discussion of performance analysis for a class of SPS methods.…”

Section: Introductionmentioning

confidence: 99%

“…Among the set of articles in the literature, the work in [12], [15], and [52] provides an appropriate overview of the latter techniques, respectively. In [27] and [53], performance analysis studies of a number of buffer management schemes are provided. The tradeoff between the available bandwidth and buffer space is studied in [40].…”

Section: Introductionmentioning

confidence: 99%