9 research outputs found
Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service
We analyze an infinite-buffer batch-size-dependent batch-service queue with Poisson arrival and arbitrarily distributed service time. Using supplementary variable technique, we derive a bivariate probability generating function from which the joint distribution of queue and server content at departure epoch of a batch is extracted and presented in terms of roots of the characteristic equation. We also obtain the joint distribution of queue and server content at arbitrary epoch. Finally, the utility of analytical results is demonstrated by the inclusion of some numerical examples which also includes the investigation of multiple zeros
Tandem queues with impatient customers for blood screening procedures
We study a blood testing procedure for detecting viruses like HIV, HBV and HCV. In this procedure, blood samples go through two screening steps. The first test is ELISA (antibody Enzyme Linked Immuno-Sorbent Assay). The portions of blood which are found not contaminated in this first phase are tested in groups through PCR (Polymerase Chain Reaction). The ELISA test is less sensitive than the PCR test and the PCR tests are considerably more expensive. We model the two test phases of blood samples as services in two queues in series; service in the second queue is in batches, as PCR tests are done in groups. The fact that blood can only be used for transfusions until a certain expiration date leads, in the tandem queue, to the feature of customer impatience. Since the first queue basically is an infinite server queue, we mainly focus on the second queue, which in its most general form is an S-server M=G[k;K]=S + G queue, with batches of sizes which are bounded by k and K. Our objective is to maximize the expected profit of the system, which is composed of the amount earned for items which pass the test (and before their patience runs out), minus costs. This is done by an appropriate choice of the decision variables, namely, the batch sizes and the number of servers at the second service station. As will be seen, even the simplest version of the batch queue, the M=M[k;K]=1 + M queue, already gives rise to serious analytical complications for any batch size larger than 1. These complications are discussed in detail. In view of the fact that we aim to solve realistic optimization problems for blood screening procedures, these analytical complications force us to take recourse to either a numerical approach or approximations. We present a numerical solution for the queue length distribution in theM=M[k;K]=S+M queue and then formulate and solve several optimization problems. The power-series algorithm, which is a numerical-analytic method, is also discussed
Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing
We introduce a novel probabilistic group testing framework, termed Poisson
group testing, in which the number of defectives follows a right-truncated
Poisson distribution. The Poisson model has a number of new applications,
including dynamic testing with diminishing relative rates of defectives. We
consider both nonadaptive and semi-adaptive identification methods. For
nonadaptive methods, we derive a lower bound on the number of tests required to
identify the defectives with a probability of error that asymptotically
converges to zero; in addition, we propose test matrix constructions for which
the number of tests closely matches the lower bound. For semi-adaptive methods,
we describe a lower bound on the expected number of tests required to identify
the defectives with zero error probability. In addition, we propose a
stage-wise reconstruction algorithm for which the expected number of tests is
only a constant factor away from the lower bound. The methods rely only on an
estimate of the average number of defectives, rather than on the individual
probabilities of subjects being defective