Some results for the queues Mx/M/c and GIx/ G/c

We develop for the queue M^x/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GI^x/G/c. Preliminary numerical studies have indicated excellent performance of the results.     

Optimal incentive-compatible pricing for M/G/1 queues

This paper extends the applicability of the pricing results of Mendelson and Whang (Oper. Res. 38 (5) (1990) 870) and Balachandran and Radhakrishnan (Management Sci. 40 (10) (1994) 353) for congested service facilities by considering general, class-dependent, service time distributions. Two theorems for nonpreemptive M/G/1 queues and preemptive-resume M/G/1 queues are presented.     

Comparison conjectures about the M/G/s queue

We conjecture that the equilibrium waiting-time distribution in an M/G/s queue increases stochastically when the service-time distribution becomes more variable. We discuss evidence in support of this conjecture and others based partly on light-traffic and heavy-traffic limits. We also establish an insensitivity property for the case of many servers in light traffic.     

The interior of the Šilov boundary of M(G) is trivial

Let G be a non-discrete locally compact abelian group, and let M(G) be the convolution algebra of regular bounded Borel measures on G. Let Γ denote the dual group of G. Then the interior of the ?ilov boundary of M(G) is exactly Γ. The proof uses generalized Riesz products for the compact metrizable case and standard liftings from that case.     

Analysis of an M/G/∞ queue with batch arrivals and batch-dedicated servers

We analyze an M/G/∞ queue with batch arrivals, where jobs belonging to a batch have to be processed by the same server. The number of jobs in the system is characterized as a compound Poisson random variable through a scaling of the original arrival and batch size processes.     

Fluid model driven by an M/G/1 queue with multiple exponential vacations

This paper studies a fluid model driven by an M/G/1 queue with multiple exponential vacations. By introducing various vacation strategies to the fluid model, we can provide greater flexibility for the design and control of input rate and output rate. The Laplace transform of the steady-state distribution of the buffer content is expressed through the minimal positive solution to a crucial equation. Then the performance measure-mean buffer content, which is independent of the vacation parameter, is obtained. Finally, with some numerical examples, the parameter effect on the mean buffer content is presented.     

The Banach algebra l1(S)

Let S be the free semigroup with a finite or countably infinite set of generators plus an identity. It is shown that there is a natural involution 1 on the convolution Banach algebra l¹(S) such that (l¹(S), 1) has a separating family of finite-dimensional star representations. The star representations of the l¹-algebra of some other semigroups are also considered. The spectrum of every element of l¹(S) which is not a scalar multiple of the identity is shown to be a connected set with interior.     

Transient analysis of an M/G/1 retrial queue subject to disasters and server failures

An M/G/1 retrial queueing system with disasters and unreliable server is investigated in this paper. Primary customers arrive in the system according to a Poisson process, and they receive service immediately if the server is available upon their arrivals. Otherwise, they will enter a retrial orbit and try their luck after a random time interval. We assume the catastrophes occur following a Poisson stream, and if a catastrophe occurs, all customers in the system are deleted immediately and it also causes the server’s breakdown. Besides, the server has an exponential lifetime in addition to the catastrophe process. Whenever the server breaks down, it is sent for repair immediately. It is assumed that the service time and two kinds of repair time of the server are all arbitrarily distributed. By applying the supplementary variables method, we obtain the Laplace transforms of the transient solutions and also the steady-state solutions for both queueing measures and reliability quantities of interest. Finally, numerical inversion of Laplace transforms is carried out for the blocking probability of the system, and the effects of several system parameters on the blocking probability are illustrated by numerical inversion results.     

Translation-invariant linear forms on C0(G), C(G), Lp(G) for noncompact groups

Suppose G is a locally compact noncompact group. For abelian such G's, it is shown in this paper that L¹(G), C(G), and L^∞(G) always have discontinuous translation-invariant linear forms(TILF's) while C₀(G) and L^p(G) for 1 < p < ∞ have such forms if and only if $\text{G}\text{H}$ is a torsion group for some open σ-compact subgroup H of $\text{G}$. For σ-compact amenable G's, all the above spaces have discontinuous left TILF's.     

Uniqueness of norm on L(G) and C(G) when G is a compact group

Let G be a compact group. If the trivial representation of G is not weakly contained in the left regular representation of G on L₀²(G) and X is either L^p(G) for 1<p?∞ or C(G), then we show that every complete norm |·| on X that makes translations from (X,|·|) into itself continuous is equivalent to ||·||_p or ||·||_∞ respectively. If 1<p?∞ and every left invariant linear functional on L^p(G) is a constant multiple of the Haar integral, then we show that every complete norm |·| on L^p(G) that makes translations from (L^p(G),|·|) into itself continuous and that makes the map t?L_t from G into bounded is equivalent to ||·||_p.     

An M/G/1 queue with two phases of service subject to the server breakdown and delayed repair

This paper deals with the steady-state behaviour of an M/G/1 queue with an additional second phase of optional service subject to breakdowns occurring randomly at any instant while serving the customers and delayed repair. This model generalizes both the classical M/G/1 queue subject to random breakdown and delayed repair as well as M/G/1 queue with second optional service and server breakdowns. For this model, we first derive the joint distributions of state of the server and queue size, which is one of chief objectives of the paper. Secondly, we derive the probability generating function of the stationary queue size distribution at a departure epoch as a classical generalization of Pollaczek–Khinchin formula. Next, we derive Laplace Stieltjes transform of busy period distribution and waiting time distribution. Finally, we obtain some important performance measures and reliability indices of this model.     

Diffusion-equation model of slightly loaded M/M/1 queue

Another derivation of the diffusion approximation of the M/M/1 queue is presented, which results in a new boundary condition. The model proposed approximates the time-dependent behavior of the M/M/1 system for all values of channel utilization.     

Steady state analysis of an M/G/1 queue with two phase service and Bernoulli vacation schedule under multiple vacation policy

This paper examines the steady state behaviour of a batch arrival queue with two phases of heterogeneous service along and Bernoulli schedule vacation under multiple vacation policy, where after two successive phases service or first vacation the server may go for further vacations until it finds a new batch of customer in the system. We carry out an extensive stationary analysis of the system, including existence of stationary regime, queue size distribution of idle period process, embedded Markov chain steady state distribution of stationary queue size, busy period distribution along with some system characteristics.     

Approximation of M/M/s/K retrial queue with nonpersistent customers

We consider the M/M/s/K retrial queues in which a customer who is blocked to enter the service facility may leave the system with a probability that depends on the number of attempts of the customer to enter the service facility. Approximation formulae for the distributions of the number of customers in service facility, waiting time in the system and the number of retrials made by a customer during its waiting time are derived. Approximation results are compared with the simulation.     

Steady state analysis of an M/G/1 queue with linear retrial policy and two phase service under Bernoulli vacation schedule

We consider a single server queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under the so called linear retrial policy. This model extends both the classical M/G/1 retrial queue with linear retrial policy as well as the M/G/1 queue with two phases of service and Bernoulli vacation model. We carry out an extensive analysis of the model.     

G-decomposition of Kn, where G has four vertices or less

The complete graph K_n, is said to have a G-decomposition if it is the union of edge disjoint subgraphs each isomorphic to G. The set of values of n for which K_n has a G-decomposition is determined if G has four vertices or less.