Mathematical Problems in Engineering

Volume 2015 (2015), Article ID 291402, 6 pages

http://dx.doi.org/10.1155/2015/291402

## On Some Compound Random Variables Motivated by Bulk Queues

Maritime Faculty, University of Montenegro, Dobrota 36, 85330 Kotor, Montenegro

Received 3 June 2015; Revised 2 August 2015; Accepted 9 August 2015

Academic Editor: Hua Fan

Copyright © 2015 Romeo Meštrović. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We consider the distribution of the number of customers that arrive in an arbitrary bulk arrival queue system. Under certain conditions on the distributions of the time of arrival of an arriving group () and its size () with respect to the considered bulk queue, we derive a general expression for the probability mass function of the random variable which expresses the number of customers that arrive in this bulk queue during any considered period . Notice that can be considered as a well-known compound random variable. Using this expression, without the use of generating function, we establish the expressions for probability mass function for some compound distributions concerning certain pairs of discrete random variables which play an important role in application of batch arrival queues which have a wide range of applications in different forms of transportation. In particular, we consider the cases when and/or are some of the following distributions: Poisson, shifted-Poisson, geometrical, or uniform random variable.

#### 1. Introduction

As noticed by Feller [1], a substantial part of probability theory is connected with sums of independent random variables, and in many situations the number of terms in such sums is itself a random variable. In particular, in several situations the numbers of these sums are integer-valued random variables. In queueing theory, a discipline within the mathematical theory of probability, a bulk queue (sometimes called batch queue) is a general queueing model where customers arrive and/or are served in groups of random size. There is a large practical interest in investigating the behavior of general-arrival queueing systems (see, e.g., Dragović et al. [2], Gontijo et al. [3], Lee [4], Liu [5], Manfield and Tran-Gia [6], and Mezghiche and Tadj [7]). In Kendall notation [8] for single queueing nodes, the random variable denoting bulk arrivals or service is denoted by a superscript, for example, denotes an queue where the arrivals are in batches determined by the random variable and the services in bulk are determined by the random variable . Mathematically and also from practical point of view, the cases when the size of an arriving group is a random variable are more common and also more difficult to handle.

According to Kendall-Lee notation, an arbitrary bulk queueing system can be described as . In this notation the first component means that customers arrive in system in groups following a random variable depending on the time , and the group size (i.e., the number of customers that arrive in the system at the same time) is a discrete random variable. The system has servers whose service times are distributed in accordance to the random variable . The capacity of the queue is equal to , is the size of the population of customers to be served, and is the queueing discipline. In this paper we focus our attention on the study of the number of customers that arrive in an arbitrary previously described bulk queue under certain conditions on the distributions of random variables and . Notice that this number is closely related to the notion of compound discrete distribution (see, e.g., Charalambides [9, Section ], Feller [1, Chapter XII], Minkova [10], and Peköz and Ross [11]) given as follows.

Let , be a sequence of mutually independent and identically distributed positive random variables that are independent of the nonnegative integer-valued random variable . Then the random variable defined as a sumis called a* compound random variable* (or a* compound distribution*). In this respect, the distribution of is a* compounded random variable* (or a* compounded distribution*), while the random variable is called a* compounding random variable* (or a* compounding distribution*). If is a generating function of () and is a generating function of , then it is well known (see, e.g., Feller [1, Chapter XII, Theorem on page 287]) that the generating function of the random variable given by (1) is the compound function . This fact was used in [5, Chapter XII] for determining the probability function for some compound discrete random variables. The term compound random variable (distribution) is used by Feller [1] in his classic book on discrete probability and subsequently by several other authors. These random variables are also known as* generalized random variables* (*distributions*), a term used by Feller [12] and Gurland [13] and others. In these two papers instead of mixture and compound distributions the terms compound and generalized distributions, respectively, were used (for the notion of the mixture distribution see [9, Section ]).

For more information on the notion of* compound random variable* followed by several examples see Charalambides [9, Chapter 7]. Namely, in [9, Chapter 7], under the random occupancy model, with a random number of urns and the number of balls distributed into any specific urn obeying a discrete probability law, the compound discrete variables (distributions) of the total number of balls distributed into the urns are derived. Furthermore, several particular compound discrete distributions are examined in [9, Chapter 7]. Notice that in order to determine the probability function for many compound discrete random variables it was applied in [9, Sections ] a technique involving the binomial moment generating function of related compound distribution. Furthermore, Peköz and Ross [11] considered the cases when the compounded distribution is Poisson, binomial, negative binomial random, hypergeometric, logarithmic, or negative hypergeometric random variable. Namely, in [11] were established the recursive formulas for the probability mass function of compound random variables involving any of the mentioned random variable. Furthermore, the notion of compound distributions in more general setting and several related examples are established by Minkova in [10].

The rest of the paper is organized as follows. In Section 2, we focus our attention on the study of the number of customers, , that arrive during considered period at the system modelled by a general bulk queue. Without the use of generating function, we derive the expression (2) of Theorem 2 for probability mass function of the compound random variable . In view of the fact that may be considered as a compound random variable, in this setting is reformulated Theorem 2 by Theorem 4. Furthermore, in Section 2 are given some combinatorial notions (Definitions 5 and 6) and a related result (Lemma 7) which are used in the next section. Using Theorem 2 and Lemma 7, in Section 3, we derive the expressions concerning the following pairs : is a Poisson distribution and is a geometric distribution; is a Poisson distribution and is a shifted-Poisson distribution; is a geometric distribution and is also a geometric distribution; is a uniform distribution and is a shifted-Poisson distribution; and is a uniform distribution and is a geometric distribution. Concluding remarks are given in Section 4.

#### 2. The Main Result and Auxiliary Results

##### 2.1. The Main Result

Let us take into consideration a bulk queue described in Introduction. Namely, customers arrive in this queue in groups following a random variable depending on the time . Assume that, for any fixed , the probability mass function of is distributed as with , and its mean is . Furthermore, the group size (i.e., the number of customers that arrive in the system at the same time) is a discrete random variable whose distribution is given by with , where is a number of customers in a group, and its mean is . We also suppose that the random variables and are mutually independent for any fixed .

The notions and related notations, which will be used in the sequel, are given by the following definition.

*Definition 1. *The number of customers that arrive in the system modelled by a bulk queue during considered period is a discrete random variable whose distribution is given by , , and whose mean is .

The following result gives the expressions for the distributional values of independent of the values and (, ).

Theorem 2. *Under the notations of Definition 1, for any fixed , the following formula for the probability mass function of the random variable holds: **where the summation ranges over all -tuples of positive integers satisfying the condition . Furthermore, the following holds: *

*Proof. *Let be any fixed positive real number. Let () denote the event that exactly customers arrive in the system during a time . Furthermore, let () denote the event that exactly groups of customers arrive in the system during a time ; that is, Then the conditional probability is obviously equal to the sum of productswhere the summation ranges over all -tuples of positive integers satisfying the condition . Then using (4), (5), and the assumption that the random variables and are mutually independent, applying the formula for the total probability, we find that for each there holdswhich proves (2). Finally, (3) trivially holds in view of the fact that no customer arrives in the system if and only if no group arrives in the system.

*Remark 3. *Notice that in accordance to the notion of a compound random variable given by (1) and assuming that each term of a sequence , of mutually independent and identically distributed positive random variables coincides with the random variable from Definition 1 (with being the number of customers that arrive in the queue at the same time), then for any the random variable from Definition 1 may be written as a sum This means that may be considered as a compound random variable defined by (2) and (3). Furthermore, under these notations and notations of Theorem 2, there hold , for all , and for all . Accordingly, the conditional probability is equal to , and, therefore, Theorem 2 can be reformulated in the following form.

*Theorem 4. Let , be a sequence of mutually independent and identically distributed positive integer-valued random variables that are independent of the nonnegative integer-valued random variable . Assume that for any , with , and with , then the probability mass function of compound random variable is given by the following double sum: where the summation ranges over all -tuples of positive integers satisfying the condition . Furthermore, the following holds: *

*2.2. Auxiliary Results*

*2.2. Auxiliary Results*

*The formulae (2) and (3) (i.e., the formulae (9) and (10)) are suitable for deriving related expressions for the probability mass function of a random variable (i.e., of a compound random variable ) concerning several pairs of important discrete random variables . Related examples are presented in the next section. Moreover, for a simplification of some formulae concerning some pairs of random variables considered in our examples, it is necessary to use some results involving the notion of a composition in combinatorics.*

*Definition 5 (see, e.g., [14, Section 4.2, pp. 54-55]). *A* composition* of a positive integer is any -tuple of positive integers () such thatFurthermore, is said to be the* number of parts* or* length* of the above composition. A composition with parts is said to be a -*composition*.

*Definition 6 (see, e.g., [14, Section 4.2, pp. 54-55]). *A* composition* of a positive integer with parts is any -tuple of positive integers such that

*Lemma 7 (see, e.g., [14, Section 4.2, pp. 54-55]). For every positive integers and the number of -compositions of a positive integer with parts, , is equal to *

*3. Applications of Theorem 2*

*3. Applications of Theorem 2**In this section we will apply Theorem 2 to different pairs of discrete random variables . We focus our attention on the random variables that are involved in several queueing systems which have numerous applications in transportation. In particular, this concerns the batch Poisson arrivals processes.*

*3.1. The Case When Is a Poisson Distribution and Is a Geometric Distribution*

*3.1. The Case When Is a Poisson Distribution and Is a Geometric Distribution**Suppose that is the Poisson distribution with the associated parameter ; that is, with the mean and the variance , and let be the geometric distribution with the parameter ; that is, whose mean is and variance is .*

*In order to find the values of a distribution concerning the pair given by Definition 1, the product of the second sum on the right-hand side of equality (2) of Theorem 2 with is equal to*

*Then, substituting equality (16) into (2), we get where the summation ranges over all -tuples of positive integers satisfying the condition . Observing that is in fact equal to the number of compositions of the integer with parts, which is by (13) of Lemma 7 equal to , (17) becomes Finally, substituting (14) into (18), we find thatFurthermore, inserting (14) with into (3), we have *

*Remark 8. *Notice that the distribution defined by (19) and (20) is in fact a compound Poisson distribution with respect to the geometric distribution (with the mean and the variance ), and it is sometimes called the* Polya-Aeppli distribution* (see [9, Subsection ]; also see [10]). Minkova [10, Remark ] noticed that the Polya-Aeppli distribution coincides with the inflated-parameter Poisson distribution (see Johnson et al. [15, Section ]). In [16, Section ] Haydn and Vaienti proved a very general theorem that can be used to establish the distribution in many other settings. Moreover, in [16], a result is proved on the approximation of the compound Poisson distribution. For more general compound Poisson distributions see Feller’s book [1, Chapter XII].

*3.2. The Case When Is a Poisson Distribution and Is a Shifted-Poisson Distribution*

*3.2. The Case When Is a Poisson Distribution and Is a Shifted-Poisson Distribution*

*Let be the Poisson distribution given by (14) with the mean and the variance .*

*Let be the shifted-Poisson distribution with the parameter ; that is, with the mean and the variance .*

*In order to find the values of related distribution given by Definition 1, the product which appears in the second sum on the right-hand side of equality (2) of Theorem 2 with is equal toObserve that by the multinomial formula, we have where the summation ranges over all -tuples of nonnegative integers satisfying the condition . The identity (23) immediately yieldswhence it follows that where the summation ranges over all -tuples of positive integers satisfying the condition .*

*Then, substituting equalities (25) and (22) into (2) of Theorem 2, we immediately obtain Finally, substituting (14) into (26), we getwhence it follows that Furthermore, inserting (14) with into (3), we have If , or equivalently, at the time , then equality (28) clearly becomeswhich by the identity can be written as Notice that the factor preceding the sum on the right-hand side of (31) is in fact the th probability of considered shifted-Poisson distribution given by (21). Recall that the distribution was discovered by Thomas [17], and hence it is often called Thomas distribution.*

*3.3. The Case When Both and Are Geometric Distributions*

*3.3. The Case When Both and Are Geometric Distributions*

*Let be the geometric distribution with the parameter defined by (15), and let be also the geometric distribution with the parameter depending on ; that is, Then substituting (32) into (18) and using the binomial formula, for each , we get *

*3.4. The Case When Is a Uniform Distribution and Is a Shifted-Poisson Distribution*

*3.4. The Case When Is a Uniform Distribution and Is a Shifted-Poisson Distribution*

*Let be the uniform distribution whose probability mass function is given bywhere is a positive integer depending on . Assume that is the shifted-Poisson distribution with the parameter defined by (21). Then substituting (34) into (26), we obtainFurthermore, inserting (34) with into (3), we have *

*3.5. The Case When Is a Uniform Distribution and Is a Geometric Distribution*

*3.5. The Case When Is a Uniform Distribution and Is a Geometric Distribution*

*Let be the uniform distribution whose probability mass function is given by (34), and let be the geometric distribution defined by (15). Then substituting (34) into (18), we obtainBy the well-known identity we haveThe above identity is, for example, equivalent to the fact that the mean of the binomial distribution with parameters and is equal to . Then using the identities , (38), and the binomial formula, we obtainSubstituting (39) into (37) under the condition that , we get*

*4. Conclusion*

*4. Conclusion*

*Motivated by the notion of bulk queue, in this paper we focus our attention on the distribution of the number of customers that arrive in an arbitrary bulk arrival queue system with some conditions on the distributions of the time of arriving group () and its size (). For such a bulk queue model, we derive a general expression for the probability mass function of the random variable which expresses the number of customers that arrive in this bulk queue during any considered period of time . Using this expression and some auxiliary combinatorial results, without the use of generating function, we derive the related expressions concerning some pairs of discrete random variables which have a wide range of applications in transportation, computer networks, telecommunications, and so forth. We believe that this expression can be used for the same purposes with respect to some other pairs of discrete random variables. Since there are no expressions in closed form for the basic performance measures related to many investigated types of bulk queues, our future research could be directed to estimating some of these performance measures. In particular, we hope that the obtained results in this paper should be applied for finding efficient simulation techniques to estimate significant performance characteristics of some bulk arrival queueing systems.*

*Conflict of Interests*

*Conflict of Interests*

*The author declares that there is no conflict of interests regarding the publication of this paper.*

*References*

*References*

- W. Feller,
*An Introduction to Probability Theory and Its Applications*, vol. 1, John Wiley & Sons, New York, NY, USA, 3rd edition, 1968. - B. Dragović, N.-K. Park, N. Đ. Zrnić, and R. Meštrović, “Mathematical models of multiserver queuing system for dynamic performance evaluation in port,”
*Mathematical Problems in Engineering*, vol. 20112, Article ID 710834, 19 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet - G. M. Gontijo, G. S. Atuncar, F. R. B. Cruz, and L. Kerbache, “Performance evaluation and dimensioning of ${GI}^{\text{X}}\text{/M/c/N}$ systems through kernel estimation,”
*Mathematical Problems in Engineering*, vol. 2011, Article ID 348262, 20 pages, 2011. View at Publisher · View at Google Scholar · View at Scopus - Y. Lee, “Discrete-Time bulk queueing system with variable service capacity depending on previous service time,”
*Mathematical Problems in Engineering*, vol. 2015, Article ID 482179, 6 pages, 2015. View at Publisher · View at Google Scholar - R. Liu, “Probabilistic decomposition method on the server indices of an ${M}^{\xi}/G/1$ vacation queue,”
*Journal of Applied Mathematics*, vol. 2014, Article ID 241636, 9 pages, 2014. View at Publisher · View at Google Scholar - D. R. Manfield and P. Tran-Gia, “Analysis of a finite storage system with batch input arising out of message packetization,”
*IEEE Transactions on Communications*, vol. 30, no. 3, pp. 456–463, 1982. View at Publisher · View at Google Scholar · View at Scopus - A. Mezghiche and L. Tadj, “Note on a binomial schedule for an ${\text{M}}^{\text{X}}$/G/1 queueing system with an unreliable server,”
*ISRN Probability and Statistics*, vol. 2013, Article ID 508045, 6 pages, 2013. View at Publisher · View at Google Scholar - D. G. Kendall, “Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain,”
*The Annals of Mathematical Statistics*, vol. 24, no. 3, pp. 338–354, 1953. View at Publisher · View at Google Scholar - C. A. Charalambides,
*Combinatorial Methods in Discrete Distributions*, John Wiley & Sons, Hoboken, NJ, USA, 2005. View at Publisher · View at Google Scholar · View at MathSciNet - L. D. Minkova, “The Pólya-Aeppli process and ruin problems,”
*Journal of Applied Mathematics and Stochastic Analysis*, vol. 2004, no. 3, pp. 221–234, 2004. View at Publisher · View at Google Scholar · View at Scopus - E. Peköz and S. M. Ross, “Compound random variables,”
*Probability in the Engineering and Informational Sciences*, vol. 18, no. 4, pp. 473–484, 2004. View at Google Scholar · View at Scopus - W. Feller, “On a general class of ‘contagious’ distributions,”
*The Annals of Mathematical Statistics*, vol. 14, no. 4, pp. 389–400, 1943. View at Publisher · View at Google Scholar - J. Gurland, “A generalized class of contagious distributions,”
*Biometrics*, vol. 14, no. 2, pp. 229–249, 1957. View at Publisher · View at Google Scholar - G. E. Andrews,
*The Theory of Partitions, Encyclopedia of Mathematics and Its Applications*, Addison-Wesley, Reading, Mass, USA, 1976. - N. L. Johnson, S. Kotz, and A. W. Kemp,
*Univariate Discrete Distributions*, Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics, John Wiley & Sons, New York, NY, USA, 3rd edition, 2005. View at MathSciNet - N. Haydn and S. Vaienti, “The compound Poisson distribution and return times in dynamical systems,”
*Probability Theory and Related Fields*, vol. 144, no. 3-4, pp. 517–542, 2009. View at Publisher · View at Google Scholar · View at Scopus - M. Thomas, “A generalization of Poisson's binomial limit for use in ecology,”
*Biometrika*, vol. 36, no. 1-2, pp. 18–25, 1949. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus

*
*