1,832 research outputs found
Queues in Reliability
Queueing models can be useful in solving many complex reliability problems. Component
failures are usually interpreted as the arrival of customers and the repair or
replacement of failed components is typically associated with the service facility. A
distinctive characteristic of queues in reliability is that requests for service are usually
generated by a finite customer population because, in general, there are a limited number
of units, e.g. machines which can fail, and when they are all in the system, being
repaired or waiting for repair, no more can arrive. Thus the arrivals do not form a
renewal process as they may depend on the number of units in the system. This is an
essential difference from typical queueing systems, where the population of potential
arrivals can be considered to be effectively limitless. This article overviews the main
queueing models used in reliability which are illustrated using the classical machine
repairmen model. Some statistical methods to estimate the main quantities of interest
in a queue are also discussed
Performance analysis of a discrete-time queueing system with customer deadlines
This paper studies a discrete-time queueing system where each customer has a maximum allowed sojourn time in the system, referred to as the "deadline" of the customer. Deadlines of consecutive customers are modelled as independent and geometrically distributed random variables. The arrival process of new customers, furthermore, is assumed to be general and independent, while service times of the customers are deterministically equal to one slot each. For this queueing model, we are able to obtain exact formulas for quantities as the mean system content, the mean customer delay, and the deadline-expiration ratio. These formulas, however, contain infinite sums and infinite products, which implies that truncations are required to actually compute numerical values. Therefore, we also derive some easy-to-evaluate approximate results for the main performance measures. These approximate results are quite accurate, as we show in some numerical examples. Possible applications of this type of queueing model are numerous: the (variable) deadlines could model, for instance, the fact that customers may become impatient and leave the queue unserved if they have to wait too long in line, but they could also reflect the fact that the service of a customer is not useful anymore if it cannot be delivered soon enough, etc
Bayesian prediction of the transient behaviour and busy period in short and long-tailed GI/G/1 queueing systems
Bayesian inference for the transient behavior and duration of a busy period in a single server queueing
system with general, unknown distributions for the interarrival and service times is investigated. Both
the interarrival and service time distributions are approximated using the dense family of Coxian distributions. A suitable reparameterization allows the definition of a non-informative prior and Bayesian
inference is then undertaken using reversible jump Markov chain Monte Carlo methods. An advantage of
the proposed procedure is that heavy tailed interarrival and service time distributions such as the Pareto
can be well approximated. The proposed procedure for estimating the system measures is based on
recent theoretical results for the Coxian/Coxian/1 system. A numerical technique is developed for every
MCMC iteration so that the transient queue length and waiting time distributions and the duration of
a busy period can be estimated. The approach is illustrated with both simulated and real data
A model-driven approach to broaden the detection of software performance antipatterns at runtime
Performance antipatterns document bad design patterns that have negative
influence on system performance. In our previous work we formalized such
antipatterns as logical predicates that predicate on four views: (i) the static
view that captures the software elements (e.g. classes, components) and the
static relationships among them; (ii) the dynamic view that represents the
interaction (e.g. messages) that occurs between the software entities elements
to provide the system functionalities; (iii) the deployment view that describes
the hardware elements (e.g. processing nodes) and the mapping of the software
entities onto the hardware platform; (iv) the performance view that collects
specific performance indices. In this paper we present a lightweight
infrastructure that is able to detect performance antipatterns at runtime
through monitoring. The proposed approach precalculates such predicates and
identifies antipatterns whose static, dynamic and deployment sub-predicates are
validated by the current system configuration and brings at runtime the
verification of performance sub-predicates. The proposed infrastructure
leverages model-driven techniques to generate probes for monitoring the
performance sub-predicates and detecting antipatterns at runtime.Comment: In Proceedings FESCA 2014, arXiv:1404.043
A stochastic user-operator assignment game for microtransit service evaluation: A case study of Kussbus in Luxembourg
This paper proposes a stochastic variant of the stable matching model from
Rasulkhani and Chow [1] which allows microtransit operators to evaluate their
operation policy and resource allocations. The proposed model takes into
account the stochastic nature of users' travel utility perception, resulting in
a probabilistic stable operation cost allocation outcome to design ticket price
and ridership forecasting. We applied the model for the operation policy
evaluation of a microtransit service in Luxembourg and its border area. The
methodology for the model parameters estimation and calibration is developed.
The results provide useful insights for the operator and the government to
improve the ridership of the service.Comment: arXiv admin note: substantial text overlap with arXiv:1912.0198
EUROPEAN CONFERENCE ON QUEUEING THEORY 2016
International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"
Pilot interaction with automated airborne decision making systems
An investigation was made of interaction between a human pilot and automated on-board decision making systems. Research was initiated on the topic of pilot problem solving in automated and semi-automated flight management systems and attempts were made to develop a model of human decision making in a multi-task situation. A study was made of allocation of responsibility between human and computer, and discussed were various pilot performance parameters with varying degrees of automation. Optimal allocation of responsibility between human and computer was considered and some theoretical results found in the literature were presented. The pilot as a problem solver was discussed. Finally the design of displays, controls, procedures, and computer aids for problem solving tasks in automated and semi-automated systems was considered
A development of logistics management models for the Space Transportation System
A new analytic queueing approach was described which relates stockage levels, repair level decisions, and the project network schedule of prelaunch operations directly to the probability distribution of the space transportation system launch delay. Finite source population and limited repair capability were additional factors included in this logistics management model developed specifically for STS maintenance requirements. Data presently available to support logistics decisions were based on a comparability study of heavy aircraft components. A two-phase program is recommended by which NASA would implement an integrated data collection system, assemble logistics data from previous STS flights, revise extant logistics planning and resource requirement parameters using Bayes-Lin techniques, and adjust for uncertainty surrounding logistics systems performance parameters. The implementation of these recommendations can be expected to deliver more cost-effective logistics support
- …