Optimal Control of an M/G/1/K Queueing System with Combined <Emphasis Type="Italic">F</Emphasis> Policy and Startup Time

We investigate the optimal management problem of an M/G/1/K queueing system with combined F policy and an exponential startup time. The F policy queueing problem investigates the most common issue of controlling the arrival to a queueing system. We present a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining service time, to obtain the steady state probability distribution of the number of customers in the system. The method is illustrated analytically for exponential service time distribution. A cost model is established to determine the optimal management F policy at minimum cost. We use an efficient Maple computer program to calculate the optimal value of F and some system performance measures. Sensitivity analysis is also investigated.     

Some results on a generalized M/G/1 feedback queue with negative customers

This paper deals with a generalized M/G/1 feedback queue in which customers are either “positive" or “negative". We assume that the service time distribution of a positive customer who initiates a busy period is G _e (x) and all subsequent positive customers in the same busy period have service time drawn independently from the distribution G _b (x). The server is idle until a random number N of positive customers accumulate in the queue. Following the arrival of the N-th positive customer, the server serves exhaustively the positive customers in the queue and then a new idle period commences. This queueing system is a generalization of the conventional N-policy queue with N a constant number. Explicit expressions for the probability generating function and mean of the system size of positive customers are obtained under steady-state condition. Various vacation models are discussed as special cases. The effects of various parameters on the mean system size and the probability that the system is empty are also analysed numerically. AMS Subject Classification: Primary: 60 K 25 · Secondary: 60 K 20, 90 B 22     

The M/G/1 Queue with Finite Workload Capacity

We consider the M/G/1 queueing system in which customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Various results on the distribution of the workload are derived; in particular, we give explicit formulas for its stationary distribution for M/M/1 and in the general case, under the preemptive LIFO discipline, for the joint stationary distribution of the number of customers in the system and their residual service times. Furthermore, the Laplace transform of the length of a busy period is determined. Finally, for M/D/1 the busy period distribution is derived in closed form.     

Asymptotic analysis for loss probability of queues with finite <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 type structure

This paper discusses the asymptotic behavior of the loss probability for general queues with finite GI/M/1 type structure such as GI/M/c/K, SM/M/1/K and GI/MSP/1/K queues. We find an explicit expression for the asymptotic behavior of the loss probability as K tends to infinity. With the result, it is shown that the loss probability tends to 0 at a geometric rate. This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).     

Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers have PH-distributions. A GI/M/1 type Markov chain for a generalized age process of batches of customers is introduced. The steady state distribution of the GI/M/1 type Markov chain is found explicitly and, consequently, the steady state distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. We show that the generalized age process and a generalized total workload process have the same steady state distribution. We prove that the waiting times and sojourn times have PH-distributions and find matrix representations of those PH-distributions. When the arrival process is a Markov arrival process with marked transitions, we construct a QBD process for the age process and the total workload process. The steady state distributions of the waiting times and the sojourn times, both at the batch level and the customer level, are obtained from the steady state distribution of the QBD process. A number of numerical examples are presented to gain insight into the waiting processes of different types of customers.AMS subject classification: 60K25, 60J10This revised version was published online in June 2005 with corrected coverdate     

A note on the conditional probability of <Emphasis Type="Italic">IF</Emphasis>-events

We formulate a version of the conditional probability of an IF-event considering the Łukasiewicz operations with IF-sets. Also some properties of conditional probability are proved. The results are strengthenings of preceding ones published in [LENDELOVá, K.: Conditional IF-probability. In: Soft Methods for Integrated Uncertainty Modelling. Proceedings of the 2006 InternationalWorkshop on Soft Methods in Probability and Statistics (SMPS 2006), Bristol, UK, September 5–7, 2006. Adv. Soft Comput., Springer-Verlag, Berlin, 2006, pp. 275–283]. The paper was supported by Grant VEGA 1/0539/08.     

Bayesian inference in Markovian queues

This paper is concerned with the Bayesian analysis of general queues with Poisson input and exponential service times. Joint posterior distribution of the arrival rate and the individual service rate is obtained from a sample consisting inn observations of the interarrival process andm complete service times. Posterior distribution of traffic intensity inM/M/c is also obtained and the statistical analysis of the ergodic condition from a decision point of view is discussed.     

Numerical approximations for the steady‐state waiting times in a GI/G/1 queue

This paper focuses on easily computable numerical approximations for the distribution and moments of the steadystate waiting times in a stable GI/G/1 queue. The approximation methodology is based on the theory of Fredholm integral equations and involves solving a linear system of equations. Numerical experimentation for various M/G/1 and GI/M/1 queues reveals that the methodology results in estimates for the mean and variance of waiting times within ±1% of the corresponding exact values. Comparisons with competing approaches establish that our methodology is not only more accurate, but also more amenable to obtaining waiting time approximations from the operational data. Approximations are also obtained for the distributions of steadystate idle times and interdeparture times. The approximations presented in this paper are intended to be useful in roughcut analysis and design of manufacturing, telecommunications, and computer systems as well as in the verification of the accuracies of inequalities, bounds, and approximations.     

On the rate of convergence of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> norms in the CLT for poisson and gamma random variables

In the paper, we present upper bounds of L _p norms of order ( X)^-1/2 for all 1 ≤ p ≤ ∞ in the central limit theorem for a standardized random variable (X− X)/ √ X, where a random variable X is distributed by the Poisson distribution with parameter λ > 0 or by the standard gamma distribution Γ(α, 0, 1) with parameter α > 0. The research was partially supported by the Lithuanian State Science and Studies Foundation, grant No. T-70/09.     

Three Cases of Light-Traffic Insensitivity of the Loss Probability in a GI/G/m/0 Loss System to the Shape of the Service Time Distribution

A GI/G/m/0 loss system is considered. Three cases of light-traffic insensitivity of the loss probability to the shape of the service time distribution, given its first moment, are investigated in a triangle array setting.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

TheM/G/1 queue with processor sharing and its relation to a feedback queue

The central model of this paper is anM/M/1 queue with a general probabilistic feedback mechanism. When a customer completes his ith service, he departs from the system with probability 1–p(i) and he cycles back with probabilityp(i). The mean service time of each customer is the same for each cycle. We determine the joint distribution of the successive sojourn times of a tagged customer at his loops through the system. Subsequently we let the mean service time at each loop shrink to zero and the feedback probabilities approach one in such a way that the mean total required service time remains constant. The behaviour of the feedback queue then approaches that of anM/G/1 processor sharing queue, different choices of the feedback probabilities leading to different service time distributions in the processor sharing model. This is exploited to analyse the sojourn time distribution in theM/G/1 queue with processor sharing.Some variants are also considered, viz., anM/M/1 feedback queue with additional customers who are always present, and anM/G/1 processor sharing queue with feedback.     

Performance Analysis with Truncated Heavy-Tailed Distributions

This paper deals with queues and insurance risk processes where a generic service time, resp. generic claim, has the form U ∧ K for some r.v. U with distribution B which is heavy-tailed, say Pareto or Weibull, and a typically large K, say much larger than . We study the compound Poisson ruin probability ψ(u) or, equivalently, the tail of the M/G/1 steady-state waiting time W. In the first part of the paper, we present numerical values of ψ(u) for different values of K by using the classical Siegmund algorithm as well as a more recent algorithm designed for heavy-tailed claims/service times, and compare the results to different approximations of ψ(u) in order to figure out the threshold between the light-tailed regime and the heavy-tailed regime. In the second part, we investigate the asymptotics as K → ∞ of the asymptotic exponential decay rate γ = γ ^(K) in a more general truncated Lévy process setting, and give a discussion of some of the implications for the approximations. AMS 2000 Subject Classification Primary 68M20, Secondary 60K25 †Partially supported by MaPhySto—A Network in Mathematical Physics and Stochastics, founded by the Danish National Research Foundation. An erratum to this article is available at .     

Design of a production system with a feedback buffer

In this paper, we deal with an M/G/1 Bernoulli feedback queue and apply it to the design of a production system. New arrivals enter a “main queue” before processing. Processed items leave the system with probability 1-p or are fed back with probability p into an intermediate finite “feedback queue”. As soon as the feedback queue is fully occupied, the items in the feedback queue are released, all at a time, into the main queue for another processing. Using transform methods, various performance measures are derived such as the joint distribution of the number of items in each queue and the dispatching rate. We then derive the optimal buffer size which minimizes the overall operating cost under a cost structure. This revised version was published online in June 2006 with corrections to the Cover Date.     

A sample path relation for the sojourn times in G/G/1−PS systems and its applications

For the single server system under processor sharing (PS) a sample path result for the sojourn times in a busy period is proved, which yields a sample path relation between the sojourn times under PS and FCFS discipline. This relation provides a corresponding one between the mean stationary sojourn times in G/G/1 under PS and FCFS. In particular, the mean stationary sojourn time in G/D/1 under PS is given in terms of the mean stationary sojourn time under FCFS, generalizing known results for GI/M/1 and M/GI/1. Extensions of these results suggest an approximation of the mean stationary sojourn time in G/GI/1 under PS in terms of the mean stationary sojourn time under FCFS. Mathematics Subject Classification (MSC 2000) 60K25· 68M20· 60G17· 60G10 This work was supported by a grant from the Siemens AG.     

Riesz <Emphasis Type="Italic">s</Emphasis>-Equilibrium Measures on <Emphasis Type="Italic">d</Emphasis>-Rectifiable Sets as <Emphasis Type="Italic">s</Emphasis> Approaches <Emphasis Type="Italic">d</Emphasis>

Let A be a compact set in of Hausdorff dimension d. For s ∈ (0,d) the Riesz s-equilibrium measure μ ^s is the unique Borel probability measure with support in A that minimizes

Classification and Liouville type theorems for <Emphasis Type="Italic">p</Emphasis>-harmonic morphisms

We prove firstly the classification theorem for p-harmonic morphisms between Euclidean domains. Secondly, we show that if is a p-harmonic morphism (p ≥ 2) from a complete Riemannian manifold M of nonnegative Ricci curvature into a Riemannian manifold N of non-positive scalar curvature such that the L ^q -energy is finite, then is constant, which improve the corresponding result due to G. Choi, G. Yun in (Geometriae Dedicata 101 (2003), 53–59).      

Busy periods in M/M/∞ systems with heterogeneous servers

This note gives a solution for the problem of finding the probability density and probability distribution functions of the N-busy-period length for the M/M/∞ system where the servers are not necessarily the same. A solution in case of the same servers was done in [3]. AMS Subject Classification 60K25 68M20     

Groupoid C *-Algebras and Index Theory on Manifolds with Singularities

The simplest case of a manifold with singularities is a manifold M with boundary, together with an identification M M × P, where P is a fixed manifold. The associated singular space is obtained by collapsing P to a point. When P = Z/k or S ¹, we show how to attach to such a space a noncommutative C ^*-algebra that captures the extra structure. We then use this C ^*-algebra to give a new proof of the Freed–Melrose Z/k-index theorem and a proof of an index theorem for manifolds with S ¹ singularities. Our proofs apply to the real as well as to the complex case. Applications are given to the study of metrics of positive scalar curvature.     

<Emphasis Type="Italic">I</Emphasis>-projection onto isotonic cones and its applications to maximum likelihood estimation for log-linear models

A frequently occurring problem is to find a probability vector,p∈D, which minimizes theI-divergence between it and a given probability vector π. This is referred to as theI-projection of π ontoD. Darroch and Ratcliff (1972,Ann. Math. Statist.,43, 1470–1480) gave an algorithm whenD is defined by some linear equalities and in this paper, for simplicity of exposition, we propose an iterative procedure whenD is defined by some linear inequalities. We also discuss the relationship betweenI-projection and the maximum likelihood estimation for multinomial distribution. All of the results can be applied to isotonic cone.