2,434 research outputs found
Queues with random back-offs
We consider a broad class of queueing models with random state-dependent
vacation periods, which arise in the analysis of queue-based back-off
algorithms in wireless random-access networks. In contrast to conventional
models, the vacation periods may be initiated after each service completion,
and can be randomly terminated with certain probabilities that depend on the
queue length. We examine the scaled queue length and delay in a heavy-traffic
regime, and demonstrate a sharp trichotomy, depending on how the activation
rate and vacation probability behave as function of the queue length. In
particular, the effect of the vacation periods may either (i) completely vanish
in heavy-traffic conditions, (ii) contribute an additional term to the queue
lengths and delays of similar magnitude, or even (iii) give rise to an
order-of-magnitude increase. The heavy-traffic asymptotics are obtained by
combining stochastic lower and upper bounds with exact results for some
specific cases. The heavy-traffic trichotomy provides valuable insight in the
impact of the back-off algorithms on the delay performance in wireless
random-access networks
Optimization of polling systems with Bernoulli schedules
Optimization;Polling Systems;Queueing Theory;operations research
A class of multi-server queueing systems with unreliable servers: Models and application.
Where queueing systems with unreliable servers are concerned, most research that has been done focuses on one-server systems or systems with a Poisson arrival process and exponential service time. However, in some situations we need to consider non-exponential service time or service rate changes with the number of available servers. These are the queueing systems that are discussed in this thesis, none of which has ever been discussed in the literature. Since the phase type distribution is more general than the exponential distribution and captures most features of a general distribution, the phase type distributed service time is considered in unreliable queueing systems such as M/PH/n and M/PH/n/c. For the M/PH/n queueing system with unreliable servers, the mathematical model, stability condition analysis, stationary distribution calculation, computer programs and examples are all presented. For the M/PH/n/c queueing system with server failures, a finite birth-and-death mathematical model is built and the stationary distribution and performance evaluation measurements are calculated. Computer programs are developed and an example is given to demonstrate the application of this queueing system. (Abstract shortened by UMI.)Dept. of Industrial and Manufacturing Systems Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2003 .Y375. Source: Masters Abstracts International, Volume: 43-01, page: 0295. Adviser: Attahiru S. Alfa. Thesis (M.A.Sc.)--University of Windsor (Canada), 2004
A polling model with an autonomous server
Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves independently in the system. We present the analysis for such a polling model with a so-called autonomous server. In this model, the server remains for an exogenous random time at a queue, which also implies that service is preemptive. Moreover, in contrast to most of the previous research on polling models, the server does not immediately switch to a next queue when the current queue becomes empty, but rather remains for an exponentially distributed time at a queue. The analysis is based on considering imbedded Markov chains at specific instants. A system of equations for the queue-length distributions at these instant is given and solved for. Besides, we study to which extent the queues in the polling model are independent and identify parameter settings for which this is indeed the case. These results may be used to approximate performance measures for complex multi-queue models by analyzing a simple single-queue model
Performance of the IEEE 802.16e sleep mode mechanism in the presence of bidirectional traffic
We refine existing performance studies of the WiMAX sleep mode operation to take into account uplink as well as downlink traffic. This as opposed to previous studies which neglected the influence of uplink traffic. We obtain numerically efficient procedures to compute both delay and energy efficiency characteristics. A test scenario with an Individual Subscriber Internet traffic model in both directions shows that even a small amount of uplink traffic has a profound effect on the system performance
Analysis of Fluid Queues Using Level Crossing Methods ID: 11563
This dissertation is concerned with the application of the level crossing method on fluid queues driven by a background process. The basic assumption of the fluid queue in this thesis is that during the busy period of the driving process, the fluid content fills at net rate r_1, and during the idle period of the driving process, the fluid content, if positive-valued, empties at a rate r_2. Moreover, nonempty fluid content, leaks continuously at a rate r_2. The fluid models considered are: the fluid queue driven by an M/G/1 queue in Chapter 2, the fluid queue driven by an M/G/1 queue with net input and leaking rate depending on fluid level, and type of arrivals in the driving M/G/1 queue, in chapter 3, and the fluid queue driven by an M/G/1 queue with upward fluid jumps in Chapter 4. In addition, a triangle diagram has been introduced in this thesis as a technique to visualize the proportion of time that the content of the fluid queue is increasing or decreasing during nonempty cycles. Finally, we provide several examples on how the probability density function of the fluid level is related to the probability density function of the waiting time of M/G/1 queues with different disciplines
Recommended from our members
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be sufficiently realistic. The purpose of this research is to extend the work done on vacation queues and on unreliable queues by studying queueing systems which take into consideration both phenomena. We study the behavior of a batch arrival queueing system with a single server, where the system is subject to random breakdowns which require a repair process, and on the other hand, the server is allowed to take a vacation after finishing a service. The breakdowns are assumed to occur while serving a customer, and when the system breaks down, it enters a repair process immediately while the customer whose service is interrupted comes back to the head of the queue waiting for the service to resume. Server vacations are assumed to follow a Bernoulli schedule under single vacation policy. We consider the above assumptions for different queueing models: queues with generalized service time, queues with two-stages of heterogeneous service, queues with a second optional service, and queues with two types of service. For all the models mentioned above, it is assumed that the service times, vacation times, and repair times all have general arbitrary distributions. Applying the supplementary variable technique, we obtain probability generating functions of queue size at a random epoch for different states of the system, and some performance measures such as the mean queue length, mean waiting time in the queue, proportion of server's idle time, and the utilization factor. The results obtained in this research, show the effect of vacation and breakdown parameters upon main performance measures of interest. These effects are also illustrated using some numerical examples and graphs.This work is funded by the Ministry of Education, Kingdom of Bahrain
Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs
There are numerous practical examples of production systems with servers that require heating in order to process jobs. Such production systems may realize considerable energy savings by temporarily switching off the heater and building up a queue of jobs to be processed later, at the expense of extra queueing costs. In this paper, we optimize this trade-off between energy and queueing costs. We model the production system as an M/G/1 queue with a temperature-controlled server that can only process jobs if a minimum production temperature is satisfied. The time and energy required to heat a server depend on its current temperature, hence the setup times and setup costs for starting production are state dependent. We derive the optimal policy structure for a fluid queue approximation, called a wait-heat-clear policy. Building upon these insights, for the M/G/1 queue we derive exact and approximate costs for various intuitive types of wait-heat-clear policies. Numerical results indicate that the optimal wait-heat-clear policy yields average cost savings of over 40% compared to always keeping the server at the minimum production temperature. Furthermore, an encouraging result for practice is that simple heuristics, depending on the queue length only, have near-optimal performance
- …