Computational analysis of single-server bulk-service queues, M/G^Y/ 1

Abstract

Algorithms are proposed for the numerical inversion of the analytical solutions obtained through classical transform methods. We compute steady-state probabilities and moments of the number of customers in the system (or in the queue) at three different epochs—postdeparture, random, and prearrival—for models of the type M/GY/1, where the capacity of the single server is a random variable. This implies first finding roots of the characteristic equation, which is detailed in an appendix for a general service time distribution. Numerical results, given a service time distribution, are illustrated through graphs and tables for cases covered in this study: deterministic, Erlang, hyperexponential, and uniform distributions. In all cases, the proposed method is computationally efficient and accurate, even for high values of the queueing parameters. The procedure is adaptable to other models in queueing theory (especially bulk queues), to problems in inventory control, transportation, flexible manufacturing process, etc. Exact results that can be obtained from the algorithms presented here will be found useful to test inequalities, bounds, or approximations.

Cross-Layer Based Opportunistic MAC Protocols for QoS Provisionings Over Cognitive Radio Wireless Networks

“…(34), we can obtain (n − 1) roots, denoted by z 1 , z 2 , · · · , z n−1 , respectively, which are located inside the unit circle, and one root which is located on the unit circle [21]. Therefore, P + j can be determined by Eq.…”

Arrival and departure state distributions in the general bulk‐service queue

“…The system has been analyzed (see, e.g., [10]). See also reference [3], where the numerical aspects of the solution are given a comprehensive treatment. Reference [15] gives the relation between arrival and departure epochs, through the same approach as below.…”

On ‘OR Enactment: The Theatrical Metaphor’

“…Multiplying the right-hand side of (30) by ehin, writing z = re; 8 and taking logarithms, we can rewrite (30) as the two equations (30a) and (30b) where Re ( w} and Im ( w} denote the real and imaginary parts of w, respectively. Analytically, the values of rj and ()j,j = 1,2, .. .…”

“…Define n 1 (8) as the fractional part of n8 • In order to determine if n 1 (8) is increasing or decreasing between the roots, n 1 (8) is evaluated at two arbitrary test points ()P = c and ()q = 2c, where cis a given tolerance. Depending on whether n 1 (8) is increasing (decreasing), the algorithm now repeats if n 1 (8 13 ) ~ n 1 (8") (n 1 (8 13 ) < n 1 (8")) with()"= () 13 , and ()b = 8 13 …”