Paul Mullowney and Alex James. Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand

Similar documents
The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation.

IDLE PERIODS FOR THE FINITE G/M/1 QUEUE AND THE DEFICIT AT RUIN FOR A CASH RISK MODEL WITH CONSTANT DIVIDEND BARRIER

Continuous Distributions

Asymptotic Variance Formulas, Gamma Functions, and Order Statistics

4. Distributions of Functions of Random Variables

Introduction to Queueing Theory

Queueing Theory and Simulation. Introduction

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

Probability and Statistics Concepts

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

The exponential distribution and the Poisson process

On the static assignment to parallel servers

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

Random Processes. DS GA 1002 Probability and Statistics for Data Science.

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

Continuous Distributions

A discrete-time priority queue with train arrivals

IEOR 6711, HMWK 5, Professor Sigman

M/G/1 and Priority Queueing

Introduction to Queueing Theory

Figure 10.1: Recording when the event E occurs

EFFICIENT COMPUTATION OF PROBABILITIES OF EVENTS DESCRIBED BY ORDER STATISTICS AND APPLICATION TO A PROBLEM OFQUEUES

Introduction to Queueing Theory

Delta Method. Example : Method of Moments for Exponential Distribution. f(x; λ) = λe λx I(x > 0)

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Queueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6

Lecture 3 Continuous Random Variable

Operations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads

Computer Networks More general queuing systems

ON THE LAW OF THE i TH WAITING TIME INABUSYPERIODOFG/M/c QUEUES

A source model for ISDN packet data traffic *

Chapter 2 Queueing Theory and Simulation

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk

Stat 5101 Notes: Algorithms

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

VARUN GUPTA. Takayuki Osogami (IBM Research-Tokyo) Carnegie Mellon Google Research University of Chicago Booth School of Business.

Performance Modelling of Computer Systems

Part I Stochastic variables and Markov chains

Lecturer: Olga Galinina

Stat410 Probability and Statistics II (F16)

Lecture 4a: Continuous-Time Markov Chain Models

Discrete Probability Refresher

MAS223 Statistical Inference and Modelling Exercises

SYMBOLS AND ABBREVIATIONS

Exponential Distribution and Poisson Process

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

A note on the GI/GI/ system with identical service and interarrival-time distributions

Stat 135, Fall 2006 A. Adhikari HOMEWORK 6 SOLUTIONS

Queues and Queueing Networks

1. Introduction. Consider a single cell in a mobile phone system. A \call setup" is a request for achannel by an idle customer presently in the cell t

Probability and Distributions

ECE 302 Division 2 Exam 2 Solutions, 11/4/2009.

Data analysis and stochastic modeling

Stability of the Defect Renewal Volterra Integral Equations

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Brief Review of Probability

Lecture Notes of Communication Network I y: part 5. Lijun Qian. Rutgers The State University of New Jersey. 94 Brett Road. Piscataway, NJ

EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 18

ST5215: Advanced Statistical Theory

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion

CDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations

Solution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.

Chapter 3: Unbiased Estimation Lecture 22: UMVUE and the method of using a sufficient and complete statistic

IEOR 4404: Homework 6

Lecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

STEADY-STATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: Part II

HITTING TIME IN AN ERLANG LOSS SYSTEM

Elementary queueing system

Fundamental Tools - Probability Theory II

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

Discrete-event simulations

Applied Probability and Stochastic Processes

Chapter 2 Random Processes

Convergence Rates for Renewal Sequences

IE 581 Introduction to Stochastic Simulation

GI/M/1 and GI/M/m queuing systems

Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University

On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers

THE INTERCHANGEABILITY OF./M/1 QUEUES IN SERIES. 1. Introduction

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974

Synchronized Queues with Deterministic Arrivals

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Monotonicity and Aging Properties of Random Sums

1 Review of di erential calculus

3. Poisson Processes (12/09/12, see Adult and Baby Ross)

7 Variance Reduction Techniques

Stat 5101 Lecture Slides: Deck 7 Asymptotics, also called Large Sample Theory. Charles J. Geyer School of Statistics University of Minnesota

1 Random Variable: Topics

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.

2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES

CH 2: Limits and Derivatives

2009), URL

Transcription:

REsONANCES IN COMPOUND PROCESSES Paul Mullowney and Alex James Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand Report Number: UCDMS2006/14 DECEMBER 2006

Resonances in Compound Processes Paul Mullowney*and Alex Jamest Department of Mathematics and Statistics, University of Canterbury Private Bag 4800, Christchurch, New Zealand Fax: 00 64 3 364 2587, Phone: 00 64 3 364 2987 ext 8877 Abstract The first-exit time of a compound process with strictly positive jumps reaching a horizontal barrier is considered. The first-exit time distribution for the specific case of Poisson arrivals and gamma distributed jump sizes is derived. If the jump size distribution converges weakly to a Dirac delta function as the variance tends to zero, the process tends to a compound process with constant jump size. In the case when the barrier is an exact multiple of the constant jump size a small peculiarity arises; the firstexit time distribution with general jumps does not tend to the first-exit time distribution with constant jumps. The first-exit time distribution for M/G/1 queues with gamma distributed service times is shown to have the same peculiarity. Keywords: first-exit time, compound G/G processes, resonance, M/G/1 queue, Corresponding author: p.mullowney@math.canterbury.ac.nz t a.james@math.canterbury.ac.nz 1

1 Introduction Consider a compound process, G/G. The interarrival times, {T;};Ez+, are independent, identically distributed (iid) random variables from a general distribution, F, with density f(t) = F'(t) and expectation E(T) = t The jump sizes, { X;} iez+, are strictly positive, iid, random variables from a general distribution G, with density g(x), expectation E(X) =µ,and variance Var(X) = 0' 2 The first-exit time of the compound process hitting a horizontal barrier at Xexit. is Texit = inf{t > 0: X1 + Xn;:,: Xexid, (1) Perry et al. (1999) and Stadje and Zacks (2003, 2005) considered the first-exit time problems of M/G and G/M processes with more general boundaries and exponential jump size distributions. Here the first-exit time distribution for Poisson arrivals and a gamma distributed jump size is derived, i.e. M/f. This allows the limiting case of 0' 2 -----> 0 while µ, remains fixed and positive to be studied, i.e. the jump size density converges weakly (or in distribution) to the Dirac delta function d g(x)--> 8(x - µ,). In this limit the compound process becomes M/D because all jumps have the same size. It is shown that, in this case, a resonant phenomenon when x;;, E z+ is seen. This yields a discontinuity in the expected first-exit time. That is, the expected first-exit time for the M/r case does not tend to that for the M/D case E(Texit)r -f E(Texit)D as 0' 2 -----> 0. Here, the subscripts "D" and "I'" refer to fixed (or deterministic) and gamma jump distributions respectively, the "G" subscript is also used to denote a general jump distribution. It is argued that this phenomena is generic to any G/G 2

process where the jump size distribution tends to a delta function. This problem arose in the context of environmental variance in individual growth models (Mullowney and James, 2005). In 2, the first-exit time pdf is derived for the G/G case. In 3, the specific distribution for the M/r case with gamma distributed jumps is presented and examples of the resonance phenomena are shown. 4 shows the same phenomena occurring in the first-exit time distribution for an M/r /1 queue with gamma distributed service times. Finally, the results are discussed and it is argued that they can be extended to general distributions which converge weakly to the Dirac delta function in 5. 2 First-Exit Time Distribution Define the exit condition as the number of jumps required to terminate the compound process: n = inf{i E z+ : X1 + X; 2': Xexit}. (2) Let <Pc(n) (n = 1,, oo) be the discrete distribution for the number of jumps required to satisfy the exit condition (2). Formally, <Pc(n) is written as <Pc(n) = Pr {Xn + + X1 2': XexitlXn-1 + + X1 < Xexit} I:7= 1 X; has density function given by then-fold convolution of the jump density, g(nl(y). Since Xn and I::-/ X; are independent, the joint density function is separable and <Pc(n) is reduced to a single integral: <Pc(n) = t~ xit g(n-ll(y) ( rxj g(x)dx) dy lo lxexit.-y = lxexlt g(n-l)(y) (1- G (Xexit -y)) dy, (3) 3

The pdf of the first-exit times (1) for general arrivals and jump distributions is 00 Oc(t) = I: if>c(n)f(nl(t), (4) n=l where f(n)(t) is then-fold convolution of the arrival density, f(t). The expected first-exit time is E(Texit)c = f'xo toa(t)dt = f if>c(n) r= tf<nl(t)dt lo n=o lo = ~ nif>c(n) 1= tf(t)dt = f; nif>c(n)e(t) 1 = 3:E(if>c). (5) In the G/D case where all jumps are of sizeµ, the number of jumps needed to reach the exit condition is always I x';it l, i.e. the smallest integer greater than or equal to x~;". Then, IP D ( I x;; 1 ' l) = 1, the first-exit time density is (6) and its expectation is ( ) 1 rxexitl E Texit D = :>; µ, (7) 3 Compound Poisson process with Gamma distributed jumps For the case of an exponential arrivals distribution and a gamma jump size distribution it is possible to calculate the first-exit time distribution analytically. Here f (t) = >.e->-t 4

where H(x) is the Heaviside function. The mean and variance of the jump sizes are µ = a(3 and 0' 2 = a(3 2 with a > 1. In the limit that a --> oo and (3 --> 0 such that µ remains constant, 0' 2 --> 0. In this situation, the gamma distribution is asymptotic to the normal distribution, N(µ,CJ 2 ) (Balkema et al., 1999). Since the normal distribution converges weakly to the Dirac delta function (Strauss, 1992), the gamma distribution converges weakly to the Dirac delta function as required. For small variance, g(x, a, /3) resembles a tall, narrow spike centered aboutµ; i.e. an approximation to o(x - µ). Then-fold convolutions of J and g are j(n) (t) g(n) (x, a, (3) >,ntn-le-;\t r(n) g(x, na, (3). (8) (9) Therefore, the probability of satisfying the exit condition with the nth jump is calculated from (3) to give ( 2ID<il ( ) X, ) re,,, y n-1 a-le-y ( X. ) <I>r(n) = r (n - l)a, a ; t -lo r((n - l)a) r a, a ;,t -y dy. Here, r (:r:) and r (, x) are the complete and lower incomplete gamma functions respectively (Abramovich and Stegun, 1968). In the case where a is an integer, 'Pr(n) is (n-i)c,-1 ( ) (( ) Xexit) ( Xexit) -a~ ~ 'Pr n =I' n-1 a,aµ -r a,a-µ- +e µ ~ K= ( Ci µ ) na-1-i I'(na - i) For non-integer a there is no closed form expression but, as r (, x) is a continuous function, this is of no consequence. Substituting n-1 xi r(n, x) = 1 - e-x I:~ i=o i. n E z+ into <I>r(n) gives () r(( 1) Xexit) r( Xexit) 'Pr n = n - a, a- 11 - - na, aµ (10) 5

(a) xex/µ is nonlnteger (b) X,,/µ is integer 11.15 11.1 ""\; t, 11.05 w 11-10.95 0.1 0.2 0.3 0.4 0.5 a 10.8 10.6 ------ ""\; 10.4 f-. W 10.2 10 9.8 0 0.1 0.2 0.3 0.4 0.5 Figure 1: E(Texit)r (black) and E(TexidD (grey) versus CJ, A = 1. In (a) Xexit/ µ = 10.5 and the gamma case tends to the constant jumps case as expected. In (b) Xexit/ µ = 10 and the gamma case does not tend to the constant jumps case. The first-exit time density and expectation are 00 Dr(t) = ~ r (n - l)o:, o:-µ- - r no:, o:-µ- f(n) ( ( Xexit) ( Xexit)) Antn-le-At 1 00 E(Texit )r = 'X ~ n r (n - l)o:, o:-µ- - r no:, o:µ. ( ( Xexit) ( Xexit)) Figure 1 shows the expected first-exit times of both the gamma and constant size jump distributions for 2 cases. In (a), Xexit/ µ = 10.5; as CJ --> 0 the expected first-exit time for the M/G case tends to the expected first-exit time for the M/D case (horizontal line). In (b), Xexit/µ = 10 and the expectations do not converge as CJ --> 0. Figure 2 shows the absolute relative difference of the first-exit times 6.E (Texit) = I E(Texit)r - E(Texit)D I E(Texit)D (11) 6

0.12 cr=.05 0.1 cr=.025 ---cr=.01 0.08 ') I:. 0.06 w <l 0.04! 0.02 1,,1 I! [ t if I[ /.'\: it./, 04 6 7x /.. µ I. 10 11 Figure 2: b.e(texit) versus Xexitl µ for O' =.05,.025,.01. against Xexitl µ for different values of u. As O'--> 0, b.e (Texit) tends to zero for every value of Xexitl µ except the integers. The magnitude of the difference at the integer values decreases as Xexitl µ increases. 4 Queues This phenomena is not limited to compound processes. It can also be seen in the first-exit time of an M/r /1 queueing process when the service distribution converges weakly to 8(x-µ). For queues { X;} iez+ are the service times, E(X) = µ is the mean service time and p = >.µ is the traffic density of the queue. The distribution function for (1) represents the total time it takes the server to process for Xexit arrivals, including the time when the server is inactive. The first exit time distribution and expectation are 00 <I>(')>. i n(t) = H(t - X ) ~ _i-(t - X )i-le-,\(t-xoxlt) exit. (12) L.., r( i) exit 1=1 1 E(Texit) = Xexit + 'XE( <I>) (13) H(t - Xexit) is the Heaviside function which ensures that it always takes at least Xexit time to exit. For this case the discrete distribution, <I>(i), gives 7

the probability of reaching Xexil. during the i 1 h busy period rather than the i 1 h jump. Let Or and!.lo be the first-exit time distributions corresponding to gamma and deterministic service distributions respectively. Define the discrete distributions <I>r and <I> D in the same manner (see Mullowney and James (2005) for a full derivation). Then, the error in the expected first-exit time is:.6.e (Texit) = IE( <I>r) - E( <I> D) I. >-Xexit + E(<I>o) (14) The requirement for the resonance phenomena remains x~u E z+. Fig. 3 shows.6.e (Texit) versus X~;, for a=.05,.025,.01. The traffic densities are (a) p =.1 and (b) p =.5 respectively. As p, 0, the interarrival time is much greater than the mean service time. Then, the queue is almost always empty and the M/f /1 queue should behave like an M/f compound Poisson process. Moreover, it can be shown that <l>r limits onto (10) and <l>o limits onto r X~xitl asp, 0. Then, the only difference between the relative errors of the compound process and the queue will be the extra term in the denominator of (14). In the light traffic limit (µ fixed, A, 0), this term is small and the size of error should be comparable to the M/f process. This can be seen by comparing the size of the spikes in Fig. 3a and Fig. 2. As p increases, the resonance is still present however it is less substantial as noted by the y-axis scale (Fig. 3b). 5 Discussion A simple explanation for this phenomenon is found by considering a jump size distribution with mean 1 and an exit barrier at n E z+ and any arrivals distribution. When the jumps are of constant size 1, the process will exit after n jumps with probability 1. Moreover, there is no "excess" in the compound process when the barrier is crossed. In fact, one could say that the barrier is reached rather than crossed. When the jumps are gamma distributed with very 8

(a) (b) p=0.1 p=0.5 0.08 O.Q7 0.06 0 ]i 0.05 f- ui 0.04 <l 0.03 0.02 l 0:.05 ---o=.025 ~-o=.01 1 I ~ i l I I[ It r 11: I t 0.01,,I,1; 11'!I: 0 J 1. ;1,, i. II 5 7x ex/µ 8 10 0 0.04 O.Q35 0.03 ]i 0.025!:::, w 0.02 <l 0.015 ~ 0.01!! l II 0.005 ii i. I 1 fl ',[ if 1' I 1x / s "µ 0=.05 o=.025 -o=.01 I ii It 10 Figure 3: t.e(texit) versus Xexit/ µ for,\ = 1 and O' =.05,.025,.01. (a) traffic density of queue is p =.1, (b) traffic density of queue is p =.5 small variance, the probability of having a jump of exactly integer size is O for any 0' 2 > 0. The i 1 h jump will be of size 1 + t; where t; E N(O, 0' 2 ) for 0' 2 small. The sum of n jumps will be n n+ LE;. i=l Whenever ~~=l E; < 0, n + 1 jumps are required to exit the compound process and the excess will be large. When ~~=l E; > 0, n jumps are required to exit and the excess will be small. For 0' 2 small but nonzero, either of these outcomes will occur with roughly equal probability since the E; are normally distributed about 0. Thus, the process will not limit to the G/D case. When n is non-integer, a process with constant jumps will always exit after In l jumps and there will be some excess. That is, the barrier is crossed rather than reached. When 0' 2 is small, lnj LnJ + LE; i=l 9

will almost never cross the boundary and [nl fnl + I>i i=l almost always will. Hence the process will limit to the G/D case. By this argument, the discontinuities should be observed for any jump distribution that satisfies g(x)..:!., 8(x - µ) regardless of the arrivals distribution. Numerical explorations show that the phenomena can be seen with both normally distributed jump sizes and Pareto arrivals processes. It is not surprising that the phenomenon is most significant in the light traffic limit of the queue. In this limit, almost all busy periods contain at most one arrival. This process should behave identically to the M/G compound process with the exception that service times are accounted for in the queue. This gives rise to the additional term in the expected first-exit time error in (14). The resonance will also occur in higher traffic densities but its effect will be less substantial. Often, the barrier will be almost reached in the middle of a busy period. Then, the server will cross the barrier well before the next arrival. When the barrier is almost reached at the end of a busy period, another arrival will be necessary. It is these events which give rise to the discontinuity in the expected first-exit time. As traffic density increases, the average lengths of busy periods increase and this effect will be less common. References Abramovich, M. and Stegun, I. A. (1968). Handbook of Mathematical Functions. Dover Publications. Balkema, A., Kllippelberg, C., and Resnick, S. (1999). Limit laws for exponential families. Bernoulli, 5(6):951-968. 10

Mullowney, P. and James, A. (2005). The role of variance in capped rate stochastic growth models with external mortality. Submitted to Journal of Theoretical Biology. Perry, C., Stadje, W., and Zacks, S. (1999). Contributions to the theory fo first-exit times of some compound processes in queueing theory. Queueing Systems, 33:369-379. Stadje, W. and Zacks, S. {2003). Upper first-exit times of compound poisson processes revisited. Probability in the Engineering and Informational Sciences, 17:459-465. Stadje, W. and Zacks, S. (2005). On the upper first-exit times of compound g/m processes. Probability in the Engineering and Informational Sciences, 19:397-403. Strauss, W. A. (1992). Partial Differential Equations. John Wiley & Sons, Inc. 11