Approximating the Mean Waiting Time in the <Emphasis Type="Italic">GI/G/s</Emphasis> Queue

We provide two distribution-dependent approximations for the mean waiting time in a GI/G/s queue. Both approximations are weighted combinations of the exact mean waiting times for the GI/M/s and M/D/s queues each of which has the same mean service time and traffic intensity as in the approximating GI/G/s queue. The weights in the approximations are expressed by the service-time c.d.f. and the first two moments of interarrival and service times. To examine the performance of our approximations, they are numerically compared with exact solutions and previous two-moment approximations for various cases. Extensive numerical comparisons indicate that the relative percentage errors of the approximations are of the order of 5% in moderate traffic and 1% in heavy traffic, except for extreme cases.     

On the Relative Waiting Times in the GI/M/s and the GI/M/1 Queueing Systems

The expected steady-state waiting time, Wq(s), in a GI/M/s system with interarrival-time distribution H(·) is compared with the mean waiting time, Wq, in an "equivalent" system comprised of s separate GI/M/1 queues each fed by an interarrival-time distribution G(·) with mean arrival rate equal to 1/s times that of H(·). For H(·) assumed to be Exponential, Gamma or Deterministic three possible relationships between H(·) and G(·) are considered: G(·) can be of the "same type" as H(·); G(·) can be derived from H(·) by assigning new arrivals to the individual channels in a cyclic order; and G(·) may be obtained from H(·) by assigning customers probabilistically to the different queues. The limiting behaviour of the ratio R = Wq/Wq(s) is studied for the extreme values (1 and 0) of the common traffic intensity, ρ. Closed form results, which depend on the forms of H(·) and G(·) and on the relationships between them, are derived. It is shown that Wq is greater than Wq(s) by a factor of at least (s + 1)/2 when ρ approaches one, and that R is at least s(s!) when ρ tends to zero. In the latter case, however, R goes to infinity (!) in most cases treated. The results may be used to evaluate the effect on the waiting times when, for certain (non-queueing) reasons, it is needed to partition a group of s servers into several small groups.     

Tables of Waiting Times for <Emphasis Type="Italic">M/M/n</Emphasis>, <Emphasis Type="Italic">M/D/n</Emphasis> and <Emphasis Type="Italic">D/M/n</Emphasis> and their Use to Give Approximate Waiting Times in More General Queues

An approximation formula for average waiting time in multiserver queues is considered using tables for the queues M/M/n, M/D/n and D/M/n. The approximation is compared with that proposed by Sakasegawa. Both approximations predominantly overestimate the waiting time, the first being more accurate, but the Sakasegawa approximation is simpler to apply.     

Uniform approximations for the M/G/1 queue with subexponential processing times

This paper studies the asymptotic behavior of the steady-state waiting time, W _∞, of the M/G/1 queue with Subexponential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so-called heavy-traffic approximation and heavy-tail asymptotic hold. For queues whose service time distribution decays slower than \(e^{-\sqrt{t}}\) we identify a third region of asymptotics where neither the heavy-traffic nor the heavy-tail approximations are valid. These results are obtained by deriving approximations for P(W _∞>x) that are either uniform in the traffic intensity as the tail value goes to infinity or uniform on the positive axis as the traffic intensity converges to one. Our approach makes clear the connection between the asymptotic behavior of the steady-state waiting time distribution and that of an associated random walk.     

Approximate Queueing Formulae Based on Consideration of the Busy Period

An approximation formula to one in M/M/1 queueing theory for hours in a queue is examined. Then it is extended to models M/D/1 and M/E _k /1 whereby wasted time or queue length is found to lie between two extremes. An empirical approximation to traffic intensity called utilization rate is used.     

Approximating the Distribution of Customers in <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript><Emphasis Type="Italic">/s</Emphasis> Queues

Approximation formulae are suggested for the mean and variance of customers in M/E _n /s queues. It is shown that the distributions can be approximated by using the mean and variance to fit Gamma functions. A brief comment on the more general E _m /E _n /s case is given.     

A discrete version of the Mishou theorem. II

In 2007, H. Mishou obtained a joint universality theorem for the Riemann zetafunction ζ(s) and the Hurwitz zeta-function ζ(s, α) with transcendental parameter α. The theorem states that a pair of analytic functions can be simultaneously approximated by the shifts ζ(s + iτ ) and ζ(s + iτ, α), τ ∈ R. In 2015, E. Buivydas and the author established a version of this theorem in which the approximation is performed by the discrete shifts ζ(s + ikh) and ζ(s + ikh, α), h > 0, k = 0, 1, 2.... In the present study, we prove joint universality for the functions ζ(s) and ζ(s, α) in the sense of approximation of a pair of analytic functions by the shifts ζ(s + ik ^β h) and ζ(s + ik ^β h, α) with fixed 0 < β < 1.     

On the Nitsche conjecture for harmonic mappings in ℝ<Superscript>2</Superscript> and ℝ<Superscript>3</Superscript>

We give the new inequality related to the J. C. C. Nitsche conjecture (see [6]). Moreover, we consider the two- and three-dimensional case. LetA(r, 1)={z:r<|z|<1}. Nitsche's conjecture states that if there exists a univalent harmonic mapping from an annulusA(r, 1), to an annulusA(s, 1), thens is at most 2r/(r ²+1).Lyzzaik's result states thats<t wheret is the length of the Grötzsch's ring domain associated withA(r, 1) (see [5]). Weitsman's result states thats≤1/(1+1/2(r logr)²) (see [8]).Our result for two-dimensional space states thats≤1/(1+1/2 log² r) which improves Weitsman's bound for allr, and Lyzzaik's bound forr close to 1. For three-dimensional space the result states thats≤1/(r?logr).     

A class of large solutions to the 3D incompressible MHD and Euler equations with damping

In this paper, we derive the global existence of smooth solutions of the 3 D incompressible Euler equations with damping for a class of laxge initial data, whose Sobolev norms H~s can be arbitrarily large for any s ≥ 0. The approach is through studying the quantity representing the difference between the vorticity and velocity. And also, we construct a family of large solutions for MHD equations with damping.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

Tong-type identity and the mean square of the error term for an extended Selberg class

In 1956, Tong established an asymptotic formula for the mean square of the error term of the summatory function of the Piltz divisor function d3(n). The aim of this paper is to generalize Tong's method to a class of Dirichlet series L(s) which satisfies a functional equation. Let a(n) be an arithmetical function related to a Dirichlet series L(s), and let E(x) be the error term of ′n xa(n). In this paper, after introducing a class of Diriclet series with a general functional equation(which contains the well-known Selberg class), we establish a Tong-type identity and a Tong-type truncated formula for the error term of the Riesz mean of the coefficients of this Dirichlet series L(s). This kind of Tong-type truncated formula could be used to study the mean square of E(x) under a certain assumption. In other words, we reduce the mean square of E(x) to the problem of finding a suitable constant σ*which is related to the mean square estimate of L(s). We shall represent some results of functions in the Selberg class of degrees 2–4.     

Frames and non linear approximations in Hilbert spaces

A simple proof of the proposition, stated in ([2], p. 346), asserting that in Hilbert spaces a Riesz basis is greedy, is given. Also, greedy approximant for frames in Hilbert spaces is defined and it is shown that frames satisfy the quasi greedy and almost greedy conditions. Finally, we give the characterizations of approximation spaces A^s(Ψ), A_q^s(Ψ) by means of weak-l_p and Lorentz sequence spaces for frames.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

On some mean values for the divisor function and the Riemann zeta-function

Let Δ(x) and E(x) denote respectively the error terms in the summatory formula for the divisor function and in the mean square formula for ζ(s) on the critical line. We consider some general mean values for Δ(x) and E(x) and discover interesting differences between these two functions. In particular, this yields evidence that E(x) is more negative than Δ(x).     

Geometric properties of the ridge function manifold

We study geometrical properties of the ridge function manifold \(\mathcal{R}_n\) consisting of all possible linear combinations of n functions of the form g(a· x), where a·x is the inner product in \({\mathbb R}^d\). We obtain an estimate for the ε-entropy numbers in terms of smaller ε-covering numbers of the compact class G _n,s formed by the intersection of the class \(\mathcal{R}_n\) with the unit ball \(B\mathcal{P}_s^d\) in the space of polynomials on \({\mathbb R}^d\) of degree s. In particular we show that for n?≤?s ^d???1 the ε-entropy number H _ε (G _n,s,L _q ) of the class G _n,s in the space L _q is of order nslog1/ε (modulo a logarithmic factor). Note that the ε-entropy number \(H_\varepsilon(B\mathcal{P}_s^d,L_q)\) of the unit ball is of order s ^d log1/ε. Moreover, we obtain an estimate for the pseudo-dimension of the ridge function class G _n,s.     

Waiting Time in a Two Station Series Queueing System: The Effect of Dependent Interarrival Times

An analysis taking into account the dependencies in the departure process from the first station of the M/E _k /1→./M/1 system is conducted. Arrivals to the second station are approximated as a general independent distribution, and the waiting times in this station are compared to those found through computer simulation.     

Optimal linear estimator of origin-destination flows with redundant data

Suppose given a network endowed with a multiflow. We want to estimate some quantities connected with this multiflow, for instance the value of an s–t flow for one of the sources–sinks pairs s–t, but only measures on some arcs are available, at least on one s–t cocycle (set of arcs having exactly one endpoint in a subset X of vertices with s∈X and t?X). These measures, supposed to be unbiased, are random variables whose variances are known. How can we combine them optimally in order to get the best estimator of the value of the s–t flow?This question arises in practical situations when the OD matrix of a transportation network must be estimated. We will give a complete answer for the case when we deal with linear combinations, not only for the value of an s–t flow but also for any quantity depending linearly from the multiflow. Interestingly, we will see that the Laplacian matrix of the network plays a central role.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

Cyclic block designs with block size 3 from Skolem-type sequences

A Skolem-type sequence is a sequence (s ₁, . . . , s _t ) of positive integers \({i\in D}\) such that for each \({i\in D}\) there is exactly one \({j\in \{1, \ldots , t - i\}}\) such that s _j  = s _j+i  = i. Positions in the sequence not occupied by integers \({i\in D}\) contain null elements. In 1939, Peltesohn solved the existence problem for cyclic Steiner triple systems for v ≡ 1, 3(mod 6), v ≠ 9. Using the same technique in 1981, Colbourn and Colbourn extended the solution to all admissible λ > 1. It is known that Skolem-type sequences may be used to construct cyclic Steiner triple systems as well as cyclic triple systems with λ = 2. The main result of this paper is an extension of former results to cyclic triple systems with λ > 2. In addition we introduce a new kind of Skolem-type sequence.     

Non-triviality of a product in the Adams <Emphasis Type="Italic">E</Emphasis> <Subscript>2</Subscript>-term

Let p be a prime greater than five and A the mod p Steenrod algebra. In this paper, we prove that \(h_n h_m \tilde \delta _{s + 4} \in Ext_A^{s + 6,t(s,n,m) + s} (Z/p,Z/p)\) is nontrivial in the Adams E₂-term when m ≥ n + 2 ≥ 7 and 0 ≤ s < p ? 4, and trivial in the Adams E₂-term when m ≥ n + 2 = 6 and 0 ≤ s < p ? 4, where \(\tilde \delta _{s + 4} \) stands for the fourth Greek letter element and t(s, n, m) = 2(p ? 1)[(s + 1) + (s + 2)p + (s + 3)p² + (s + 4)p³ + pⁿ + p^m].