5,148 research outputs found
Partially shared buffers with full or mixed priority
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
Performance analysis of a multiplexer with priority queues and correlated arrivals
Broadband networks are integrating different applications such as data, voice and video in a single network. The priority mechanism allows differentiating among services such that they can meet their QoS requirements. Since a switch output port may be considered as a statistical multiplexer, and the packets coming from an application are correlated, it is very important to obtain a good understanding of the statistical multiplexing with priority queues and correlated arrivals. In this thesis, we present performance analysis of a discrete-time system with two priority queues and correlated arrivals. A packet is transmitted during a slot if there are packets available in either queue. The packets in the low-priority queue are transmitted only if the high-priority queue is empty. The arrival process to each priority queue consists of the superposition of the traffic generated by a number of independent binary Markov sources and the arrivals to the two queues are independent of each other. The joint Probability Generating Function (PGF) of the two queue lengths and the number of sources is derived and the unknown boundary function is determined using the busy period distribution of the high-priority queue. From here, we determine closed form expressions for mean and variance of queue lengths as well as mean packet delay. Also we show the correspondence of our results with previous work by reducing our solution to the results of a multiplexer without priority in many special cases. At last we present numerical results, which show the effect of the high-priority traffic on the low-priority traffic and demonstrate the significance of the correlation on the performance of the system
A batch-service queueing model with a discrete batch Markovian arrival process
Queueing systems with batch service have been investigated extensively during the past decades. However, nearly all the studied models share the common feature that an uncorrelated arrival process is considered, which is unrealistic in several real-life situations. In this paper, we study a discrete-time queueing model, with a server that only initiates service when the amount of customers in system (system content) reaches or exceeds a threshold. Correlation is taken into account by assuming a discrete batch Markovian arrival process (D-BMAP), i.e. the distribution of the number of customer arrivals per slot depends on a background state which is determined by a first-order Markov chain. We deduce the probability generating function of the system content at random slot marks and we examine the influence of correlation in the arrival process on the behavior of the system. We show that correlation merely has a small impact on the threshold that minimizes the mean system content. In addition, we demonstrate that correlation might have a significant influence on the system content and therefore has to be included in the model
Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy
In this paper, we focus on the scheduling problem in multi-channel wireless
networks, e.g., the downlink of a single cell in fourth generation (4G)
OFDM-based cellular networks. Our goal is to design practical scheduling
policies that can achieve provably good performance in terms of both throughput
and delay, at a low complexity. While a class of -complexity
hybrid scheduling policies are recently developed to guarantee both
rate-function delay optimality (in the many-channel many-user asymptotic
regime) and throughput optimality (in the general non-asymptotic setting),
their practical complexity is typically high. To address this issue, we develop
a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with a
\lower complexity , and rigorously prove that D-SSG not only achieves
throughput optimality, but also guarantees near-optimal asymptotic delay
performance. Specifically, we show that the rate-function attained by D-SSG for
any delay-violation threshold , is no smaller than the maximum achievable
rate-function by any scheduling policy for threshold . Thus, we are able
to achieve a reduction in complexity (from of the hybrid
policies to ) with a minimal drop in the delay performance. More
importantly, in practice, D-SSG generally has a substantially lower complexity
than the hybrid policies that typically have a large constant factor hidden in
the notation. Finally, we conduct numerical simulations to validate
our theoretical results in various scenarios. The simulation results show that
D-SSG not only guarantees a near-optimal rate-function, but also empirically is
virtually indistinguishable from delay-optimal policies.Comment: Accepted for publication by the IEEE/ACM Transactions on Networking,
February 2014. A preliminary version of this work was presented at IEEE
INFOCOM 2013, Turin, Italy, April 201
Markovian queues with correlated arrival processes
In an attempt to examine the effect of dependencies in the arrival process on the steady state
queue length process in single server queueing models with exponential service time distribution,
four different models for the arrival process, each with marginally distributed exponential interarrivals
to the queueing system, are considered. Two of these models are based upon the upper
and lower bounding joint distribution functions given by the Fréchet bounds for bivariate
distributions with specified marginals, the third is based on Downtonâs bivariate exponential
distribution and fourthly the usual M/M/1 model. The aim of the paper is to compare conditions
for stability and explore the queueing behaviour of the different models
- âŠ