FLUID QUEUES DRIVEN BY A BIRTH AND DEATH PROCESS WITH ALTERNATING FLOW RATES
|
|
- Tracy Waters
- 6 years ago
- Views:
Transcription
1 FLUID QUEUES DRIVEN BY A BIRTH AND DEATH PROCESS WITH ALTERNATING FLOW RATES P R PARTHASARATHY K V VIJAYASHREE AND R B LENIN Received 18 January 00 and in revised form 15 July 00 Fluid queue driven by a birth and death process BDP with only one negative effective input rate has been considered in the literature As an alternative here we consider a fluid queue in which the input is characterized by a BDP with alternating positive and negative flow rates on a finite state space Also the BDP has two alternating arrival rates and two alternating service rates Explicit expression for the distribution function of the buffer occupancy is obtained The case where the state space is infinite is also discussed Graphs are presented to visualize the buffer content distribution 1 Introduction Recent measurements have revealed that in high-speed telecommunication networks like the ATM-based broadband ISDN traffic conditions exhibit long-range dependence and burstiness over a wide range of time scales Fluid models characterize such a traffic as a continuous stream with a parameterized flow rate Whitt [6] establishes heavy-traffic stochastic process limits for fluid queue models with multiple on-off sources A fluid model that is typically used to model such a traffic isamarkov Modulated Fluid Model wherein the current state of the underlying Markov process determines the flow rate Fluid models driven by finite state Markov processes that modulate the input rate in the fluid buffer have been analyzed by many authors Lenin and Parthasarathy [] provide closed-form expressions for the eigenvalues and eigenvectors for fluid queues driven by an M/M/1/N queue The case where the state space is infinite has been analyzed by van Doorn and Scheinhardt [5] for a birth and death process BDP In most studies dealing with Markov modulated fluid queues a single negative effective flow rate is assumed Here we consider a more general setting of a fluid queue driven by a BDP on a finite state space in which the flow rates are alternatively positive and negative Our aim is to obtain the stationary distribution function of the buffer occupancy for this fluid model which is modulated by a BDP with two alternating arrival rates and two alternating service rates This modulating Markov process can be visualized as a simple case of a two-state Markov Modulated Poisson Process which is characterized Copyright 004 Hindawi Publishing Corporation Mathematical Problems in Engineering 004: Mathematics Subject Classification: 60K5 60J80 68M0 URL:
2 470 Fluid queues [ ] by a Markov process with an infinitesimal generator Q λ1 λ = 1 λ λ and a diagonal matrix [ ] Λ λ1 0 = 0 λ of arrival probabilities where λ1 and λ denote the rates of arrival when the traffic is bursty and slow respectively The case where the state space of the BDP is infinite is also discussed Some interesting identities of tridiagonal determinants are used for the finite state space and continued fraction methodology is employed for the infinite state space Graphs are presented to visualize the buffer content distribution The model under consideration finds a wide range of application in modelling a communication switch as a fluid stochastic petri net in which two streams of traffic arrive Horton et al [1] One stream is bursty with a high flow rate when the server is busy and the other stream is slow with a low flow rate when the workload of the server is less We will designate the fluid commodity accumulating in the infinite capacity buffer as credit It may be helpful to think of credit as the energy which the server gathers during lean traffic period and consumes when the trafficisbursty Model description We consider an infinite capacity buffer which receives and releases fluid flows modulated by a BDP evolving in the background We denote the background birth-death process by :={Xt t 0} taking values in the state space wherext denotes the state of the process at time t Letλ n and µ n denote the mean arrival and service rates respectively when there are n units in the system The flow rates of the fluid into and out of an infinite capacity buffer are determined by the actual state of the background process Let r j denote the flow rate of the fluid when the background process is in state j The rate of change of content of the buffer Ctwhen Xt = j is given by dct dt r j if Ct > 0 = 0 ifct = 0 r j < 0 1 Clearly the two-dimensional process {XtCt t 0} constitutes a Markov process which possesses a unique stationary distribution under a suitable stability condition The stationary state probabilities p i i ofthebdpcanberepresentedas p i = π i j π j i where π i = λ 0 λ i1 / µ µ i i = 13andπ 0 = 1 are called the potential coefficients In order that a limit distribution for Ct exists as t the stationary net input rate should be negative that is π i r i < 0 3 i=0
3 P R Parthasarathy et al 471 Letting F j tu P Xt = j Ct u j tu 0 4 the Kolmogorov forward equations for the Markov process {XtCt} are given by F 0 tu t F j tu t =r 0 F 0 tu u =r j F j tu u λ 0 F 0 tu+ F 1 tu λ j + µ j Fj tu + λ j1 F j1 tu+µ j+1 F j+1 tu j \{0} tu 0 5 See van Doorn and Scheinhardt [5] When the process is in equilibrium F j tu/ t 0 and let lim t F j tu F j u 3 Finite state space This section deals with a fluid queue modulated by a finite BDP with state space = {01N} The system of equations governing the two-dimensional process {Xt Ct t 0} in equilibrium is r j df j u du r 0 df 0 u du =λ 0 F 0 u+ F 1 u = λ j1 F j1 u λ j + µ j Fj u+µ j+1 F j+1 u for j \{0} u 0 31 In matrix notation 31canbewrittenas dfu du = R1 Q T Fu u 0 3 where Fu = [F 0 uf 1 uf N u] T R = diagr 0 r N and λ 0 λ 0 + Q = µ N1 λ N1 + µ N1 λ N1 µ N µ N N+1 N+1 33
4 47 Fluid queues Hence λ 0 r 0 r 0 λ 0 λ1 + R 1 Q T = µ λ N r N1 λn1 + µ N1 r N1 λ N1 r N µ N r N1 µ N r N N+1 N+1 34 Mitra [3] has shown that R 1 Q T has exactly N + negative eigenvalues N 1 positive eigenvalues and one zero-eigenvalue where N + is the cardinality of the set + := { j : r j > 0 } 35 and N is that of := { j : r j < 0 } 36 Let ξ j j = 01N be the eigenvalues of the matrix R 1 Q T such that ξ j < 0 j = 01N + 1 ξ N + = 0 ξ j > 0 j = N + +1N 37 Since the content of the buffer increases when the net input rate of fluid flow into the buffer is positive it follows that F j u must satisfy the boundary condition F j 0 = 0 for j + 38 Also we have lim F ju = p j for j 39 u where the p j s are the stationary state probabilities of the background BDP The solution to the matrix equation 3is given by N +1 F j u = p j + η lj e ξlu j 310 l=0
5 P R Parthasarathy et al 473 where η lj = k l B j ξl c j0 c j0 = µ µ j r 0 r j1 311 The constants k l are obtained by solving N+1 B j ξl p j + k l = 0 for j + 31 c j0 l=0 The polynomials B j s are defined recursively as B 0 s = 1 B 1 s = s + λ 0 r 0 B j s = s + λ j1 + µ j1 B j1 s λ jµ j1 B j s j = 34N r j1 r j r j1 B N+1 s = s + µ N B N s λ N1µ N B N1 s r N r N1 r N 313 Also B N+1 s = detsi R 1 Q T andb j s is the determinant obtained by considering the first j rows and columns of B N+1 s More specifically we consider a fluid queue model with effective input rates j < 0andj+1 > 0forj = 01N 1/ Under this assumption the system of equations involved in the determination of the constant k l is given in matrix form as B 1 ξ0 B 1 ξ1 c 10 c 10 B 3 ξ0 B 3 ξ1 c 30 c 30 B 5 ξ0 B 5 ξ1 c 50 c 50 B 1 ξ[n/] c 10 B 3 ξ[n/] c 30 B 5 ξ[n/] c 50 [N/] k 0 k 1 k [N/] p 1 p 3 = p 5 [N/] 314 Hence the problem of determining the stationary distribution of the content in the fluid buffer is reduced to that of solving the above matrix equation via Cramer s rule We now give three examples to illustrate the above discussion
6 474 Fluid queues Example 31 N = 1 The steady state probabilities for this two-state Markov process are given by p 0 = /λ 0 + andp 1 = λ 0 /λ 0 + It follows from 3 that the condition r 0 + λ 0 < 0 ensures the stability of the Markov process {XtCt t 0} The matrix R 1 Q T takes the form λ 0 R 1 Q T r = 0 r 0 λ 0 µ with eigenvalues ξ 0 =λ 0 /r 0 + / andξ 1 = 0 The system has one negative root provided λ 0 /r 0 + / > 0 which follows from the stability condition Further η 00 = k 0 η 01 =k 0 r 0 / andfromp 1 + k 0 B 1 ξ 0 /c 10 = 0 we obtain k 0 = /r 0 p 1 Therefore the final solution is given by F 0 u = p 0 + r 0 p 1 e λ0/r0+µ1/r1u F 1 u = p 1 p 1 e λ0/r0+µ1/r1u 316 Observe that P Ct <u = F 0 u+f 1 u = 1 1 r 1 λ 0 e λ0/r0+µ1/r1u 317 r 0 λ 0 + Example 3 N = The steady state probabilities of the modulating Markov process are given by µ p 0 = λ 0 + λ 0 µ + µ λ 0 µ p 1 = λ 0 + λ 0 µ + µ λ p 0 = λ 0 + λ 0 µ + µ 318 It follows from 3 that the stability condition for the Markov process {XtCt t 0} is µ r 0 + λ 0 µ + λ 0 < 0 The matrix R 1 Q T takes the form λ 0 r 0 r 0 R 1 Q T = λ 0 + µ µ 319
7 P R Parthasarathy et al 475 with eigenvalues given by ξ 0 = 1 λ µ r 0 1 λ µ λ0 λ µ + λ 0µ r 0 r 0 r 0 ξ 1 = 0 ξ = 1 λ µ r λ µ λ0 λ µ + λ 0µ r 0 r 0 r 0 30 The constant k 0 is determined as k 0 =p 1 /r 0 B 1 ξ 0 where B s = B 0 s = 1 B 1 s = s + λ 0 r 0 s + λ 0 r 0 s + + λ 0 r 0 31 Therefore the stationary distribution of the buffer content is given by F 0 u = p 0 p 1 r 0 1 B 1 ξ0 e ξ0u F 1 u = p 1 p 1 e ξ0u r F u = p p 1 B ξ0 1 e ξ0u µ B 1 ξ0 3 Observe that P Ct <u = F 0 u+f 1 u+f u = 1 p r 1 B ξ0 e ξ0u r 0 B 1 ξ0 µ B 1 ξ0 33
8 476 Fluid queues In the above discussion we considered two examples in the general case The forthcoming example deals with the model in which the birth and death rates alternate between two constant values with even number of states The case with odd number of states does not lead to explicit expression for eigenvalues Example 33 alternating rates Consider a fluid queue driven by a single server queuing model with state space ={01n 1} whose birth and death rates are given by λ i = µ i = µ for i = 1n1 λ i+1 = λ µ i+1 = for i = 01n 34 with λ 0 = µ n1 = and the effective input rates are i = < 0andi+1 = > 0for i = 01n 1 If ρ = λ / µ < 1 the steady state probabilities are given by k λ1 λ p k = p 0 µ k = 13n1 p k+1 = λ k 1 λ1 λ p 0 µ k = 01n1 35 with p 0 = / + 1 ρ/1 ρ n From 3 it is observed that the condition + < 0 ensures the stability of the Markov process {XtCt t 0} For this specific model the matrix R 1 Q T takes the form R 1 Q T = λ + µ = λ + µ λ + µ λ + µ r n r n 36
9 P R Parthasarathy et al 477 Therefore si R 1 Q T s + s + λ + µ = s + + µ r1 1 s + λ + µ λ r = s λ s + + µ s + r n 1 s + λ + µ λ r 1 s + + n1 37 Using the Identities A A1 anda3 given in the appendix in succession with θ = s + / + / φ = s + λ / + µ / andω = θφ λ / µ / 1weobtain θφ µ r1 λ B n s = s r φ = s φ θφ µ r1 µ 1 ω µ 1 λ ω λ ω λ ω µ 1 λ µ 1 ω θφ λ n1 n
10 478 Fluid queues n1[ = sθ θφ µ r1 r=1 λ λ1 λ µ r1 cos rπ ] n 38 Substituting for θ and φweobtain B n s = s s + + µ 1 n1[ s + + µ 1 s + λ + µ µ r1 r=1 λ λ1 λ µ cos rπ n 39 We observe that B n siszerowhens is the eigenvalue of the tridiagonal matrix R 1 Q T Therefore the eigenvalues of R 1 Q T are given by λ1 ξ 0 = + µ 1 ξ j = 1 λ1 + µ + λ + ξ n = 0 ξ j = 1 λ1 + µ + λ + + λ1 + µ + λ + µ 1 4 λ 4 µ λ1 λ µ +8 cos 1/ jπ j = 1n1 n λ1 + µ + λ + µ 1 4 λ 4 µ λ1 λ µ +8 cos 1/ jπ j=n+1n+n1 n 330
11 P R Parthasarathy et al 479 We give below closed-form expressions for the terms B k sandb k+1 sfork = 0n 1 using the well-known identities of continuants given in the appendix Consider s + B k s = s + λ + µ s + λ + λ s + + µ k s + + µ = µ s + λ + µ s + λ + µ λ s + + µ s + λ + λ s + + µ λ s + + µ k s + λ + k1 331
12 480 Fluid queues UsingIdentitiesA anda4 ω 1 + λ µ λ µ ω 1 B k s = ω 1 λ µ ω 1 k ω 1 + λ µ λ µ ω 1 µ s + + µ ω 1 λ µ ω 1 + λ µ k 33 where ω 1 = s + + µ / s +λ + / / λ µ / Now expanding the first determinantand usingidentity A1 for the second we obtain B k s = ω 1 λ µ ω 1 ω 1 λ µ ω 1 k
13 + λ µ ω 1 λ µ ω 1 µ s + λ + ω 1 λ µ ω 1 λ µ P R Parthasarathy et al 481 ω 1 λ µ ω 1 r k1 λ µ ω 1 ω 1 k1 333 Therefore from Identity A3 the quantity B k s can be expressed in closed form as follows: λ1 λ µ k/ [ x B k s = r1 U k µ s + λ + λ1 λ µ r1 λ / ] x + U k1 k1/ U k1 x 334 where x = r1 s + + µ r s + λ + λ1 λ µ 335 λ1 λ µ and U k x is the Chebyshev polynomial of the second kind Similarly B k+1 s can also be expressed as B k+1 s = s + λ 1 + µ λ1 λ µ k/ x r1 U k µ λ1 λ µ k/ [ x λ1 / ] 1 x r1 U k + U k1 λ µ 336
14 48 Fluid queues Further µ1 µ k if j = k r c 1 j0 = µ1 µ k if j = k Having determined B j s and the roots of R 1 Q T explicitly the constants k l and hence the buffer occupancy distributions are obtained using 310and314 Remark 34 From the above discussion we observe that without loss of generality and can be taken as 1 and +1 respectively This is because the solution remains unaltered when µ andλ are replaced by µ andλ respectively 4 Infinite state space In the previous section we discussed the fluid queue model on a finite state space with alternating positive and negative flow rates Similar analysis on an infinite state space does not lead to explicit expression for the buffer content distribution Hence we analyze the fluid queue driven by an infinite state BDP with a single negative effective flow rate say r 0 < 0 We employ the continued fraction methodology to obtain the stationary distribution of the content of the buffer Let F j tu represent the probability that there are j units in the system and the content of the buffer does not exceed u at time tandlet F j ts denote the corresponding Laplace transform If lim t F j tu = F j u then the governing system of differential-difference equations is r 0 F 0u =λ 0 F 0 u+ F 1 u r j F ju = λ j1 F j1 u λ j + µ j Fj u+µ j+1 F j+1 u j = 1 41 Using the initial condition F 0 0 = athelaplacetransformof41yields F 0 s = a s + λ 0 µ 1 F 1 s r 0 r 0 F 0 s F j s F j1 s = λ j1 r j s + λ j + µ j r j µ j+1 r j j = 13 F j+1 s F j s 4
15 P R Parthasarathy et al 483 This leads to the continued fractions F j s F j1 s = F 0 s = a s + λ 0 r 0 λ j1 r j s + λ j + µ j r j λ 0 r 0 s + + λ j µ j+1 r j r j+1 s + λ j+1 + µ j+1 r j+1 µ s + λ + µ λ j+1 µ j+ r j+1 r j+ s + λ j+ + µ j+ r j+ 43 Define φ j s:= λ j1 r j s + λ j + µ j r j λ j µ j+1 r j r j+1 s + λ j+1 + µ j+1 r j+1 λ j+1 µ j+ r j+1 r j+ s + λ j+ + µ j+ r j+ 44 Then F 0 s = After certain algebra we obtain a s + λ 0 µ 1 φ 1 s r 0 r 0 F j s F j1 s = φ js 45 k µ1 φ1 s k F 0 s = a r k=0 0 s + λ k+1 0 r 0 j F j s = φ k s F 0 s j = 13 k=1 46 On inversion we get k µ1 u F 0 u = a k e λ0/r0u φ k 1 u r k=0 0 k! F j u = φ 1 u φ u φ j u F 0 u j = In the following argument we consider a specific nature of birth and death rates
16 484 Fluid queues λ λ µ µ Figure 41 State-transition diagram of the background Markov process Example 41 Consider a fluid queue driven by an M/M/1 queue with two alternating arrivalratesandtwoalternatingserviceratesasshownin Figure 41 We assume the net input rate of fluid to be r 0 < 0 j = > 0forj = 13 and j+1 = > 0forj = 01 The steady state probabilities are given by 35 with p 0 = µ λ /µ + From 3 the condition r < 0 ensures the stability of the process {XtCt t 0} For the model under consideration f s φ j s = gs if j is odd if j is even 48 where f s = s + λ + λ µ s + + µ s + λ + 49 = s + λ + λ µ s + + µ f s Or r s + λ + f s [ s + + µ r s + λ + λ µ + ] f s+λ1 r1 s + + µ = Using Rouches theorem considering the root that lies inside the unit circle we get f s = 1 [ r1 s + + µ r s + λ + + λ1 λ µ r s + λ + + [ s + + µ r s + λ + + λ µ ] r1 s + + µ r s + λ + 1/ ]
17 P R Parthasarathy et al 485 gs isobtainedfrom f s by interchanging and and λ and and µ The expression for f scan be written as where f s = r [ 1 s + a b ] r1 s + a b 4λ1 s + a c 41 s + a c a = 1 λ1 + µ + λ + b = a λ1 λ + µ + c = 1 λ1 + µ λ On inversion we get f u = λ1 e au { f u 1 n n=0 n k=0 n/n/ 1 n/ k +1 k! } f k 3 u 414 where 4λ1 f 3 u = f1 u f u f 1 u = coshbu + c b sinhbu 415 f u = coshbu c b sinhbu and h k uisthek-fold convolution of hu with itself Also from 45 F k+1 s F k s = f s F k s = gs 416 F k1 s which on solving yield F k+1 s = f s k+1 gs k F 0 s F k s = f s k gs k F 0 s 417
18 486 Fluid queues 10 0 = 0 = 01λ = 003µ = = 0 = 0λ = 003µ = 006 log 10 PC >u = 0 = 03λ = 006µ = 003 = 0 = 04λ = 003µ = 003 λ1 = 0 = 05λ = 003µ = 006 λ1 = 0 = 06λ = 006µ = Buffer content u Figure 51 Buffer content distribution on a finite state space with N = 1 =1 and = 1 On inversion F k+1 u = f k+1 u g k u F 0 u k = 01 F k u = f k u g k u F 0 u k = where F 0 uisobtainedfrom47as 5 Numerical illustrations F 0 u = a k=0 µ1 r 0 k u k e λ0/r0u k! f k u 419 In this section we provide numerical examples for the fluid queue driven by the finite and infinite queuing model discussed in the earlier sections In Figure 51 the buffer overflow probability corresponding to the varying values of the parameters λ andµ is plotted against buffer size for finite state space with N = 1 =1 and = 1 see Remark 34 The overflow probabilities are found to decrease rapidly with increase in The graphs are plotted for two sets of parameters by considering the three different cases wherein the ratio λ /µ is equal to one less than one and greater then one respectively Figure 5 depicts an analogous setting on an infinite state space with N truncated at 5 r 0 =1 and r i = 1fori 1 For constant values of and λ theoverflowprobabilities decrease rapidly with increase in The overflow probability is in the range of to and hence becomes a rare event
19 P R Parthasarathy et al log 10 PC >u = = 48λ = µ = 3 = = 48λ = µ = 6 λ1 = = 484λ = µ = 3 λ1 = = 486λ = µ = Buffer content u Figure 5 Buffer content distribution on an infinite state space with N truncated at 5 r 0 =1 and = 1 = Appendix Some identities of tridiagonal determinants Here we give some identities of tridiagonal determinants Muir [4] which are useful in determining the stationary buffer content distribution of the model under consideration Identity A1 A + a 0 a 0 b 1 A + a 1 + b 1 A + a n1 + b n1 b n a n1 g n a n1 n+1 A + b n g 1 b 1 a 1 g b = A a n g n1 b n1 n A1 where g j = A + a j1 + b j j = 1n
20 488 Fluid queues Identity A θ 1 d 1 1 φ d 1 θ d 3 1 φ d n 1 θ n n1 γ 1 d 1 d γ d 3 = 1 d 4 γ 3 d 5 φ d n4 γ n1 d n3 where γ j = d j + θ j φ + d j1 j = 1nwithd 0 = 0andd n1 = 0 Identity A3 A a b A a b A a b A n n = n j=1 Identity A4 θ 1 d 1 1 φ d 1 θ d 3 1 θ n d n1 1 φ n where γ j = d j + θ j φ + d j1 j = 1nwithd 0 = 0 References d n A jπ nun A abcos = ab ab n +1 d n γ n n γ n n A A3 γ 1 d 1 d γ d 3 d 4 γ 3 d 5 = A4 d n4 γ n1 d n3 [1] G Horton V G Kulkarni D M Nicol and K S Trivedi Fluid stochastic Petri nets: theory applications and solution techniques European J Oper Res no [] R B Lenin and P R Parthasarathy Fluid queues driven by an M/M/1/N queue MathProbl Eng6000 no [3] D Mitra Stochastic theory of a fluid model of producers and consumers coupled by a bufferadv Appl Probab no [4] T Muir A Treatise on the Theory of Determinants Dover Publications New York 1960 revised and enlarged by William H Metzler
21 P R Parthasarathy et al 489 [5] E A van Doorn and W R W Scheinhardt A fluid queue driven by an infinite-state birth-death process Proc 15th International Teletraffic Congress V Ramaswami and P E Wirth eds Elsevier Amsterdam 1997 pp [6] W Whitt Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues Springer Series in Operations Research Springer-Verlag New York 00 P R Parthasarathy: Department of Mathematics Indian Institute of Technology Madras Chennai India address: prp@iitmacin K V Vijayashree: Department of Mathematics Indian Institute of Technology Madras Chennai India address: ma99p01@violetiitmernetin R B Lenin: Department of Mathematics and Computer Science University of Antwerp Universiteitsplein Antwerpen Belgium address: lenin@uiauaacbe
22 Mathematical Problems in Engineering Special Issue on Modeling Experimental Nonlinear Dynamics and Chaotic Scenarios Call for Papers Thinking about nonlinearity in engineering areas up to the 70s was focused on intentionally built nonlinear parts in order to improve the operational characteristics of a device or system Keying saturation hysteretic phenomena and dead zones were added to existing devices increasing their behavior diversity and precision In this context an intrinsic nonlinearity was treated just as a linear approximation around equilibrium points Inspired on the rediscovering of the richness of nonlinear and chaotic phenomena engineers started using analytical tools from Qualitative Theory of Differential Equations allowing more precise analysis and synthesis in order to produce new vital products and services Bifurcation theory dynamical systems and chaos started to be part of the mandatory set of tools for design engineers This proposed special edition of the Mathematical Problems in Engineering aims to provide a picture of the importance of the bifurcation theory relating it with nonlinear and chaotic dynamics for natural and engineered systems Ideas of how this dynamics can be captured through precisely tailored real and numerical experiments and understanding by the combination of specific tools that associate dynamical system theory and geometric tools in a very clever sophisticated and at the same time simple and unique analytical environment are the subject of this issue allowing new methods to design high-precision devices and equipment Authors should follow the Mathematical Problems in Engineering manuscript format described at hindawicom/journals/mpe/ Prospective authors should submit an electronic copy of their complete manuscript through the journal Manuscript Tracking System at mtshindawicom/ according to the following timetable: Guest Editors José Roberto Castilho Piqueira Telecommunication and Control Engineering Department Polytechnic School The University of São Paulo São Paulo Brazil; piqueira@lacuspbr Elbert E Neher Macau Laboratório Associado de Matemática Aplicada e Computação LAC Instituto Nacional de Pesquisas Espaciais INPE São Josè dos Campos São Paulo Brazil ; elbert@lacinpebr Celso Grebogi Center for Applied Dynamics Research King s College University of Aberdeen Aberdeen AB4 3UE UK; grebogi@abdnacuk Manuscript Due Decembe 008 First Round of Reviews March Publication Date June Hindawi Publishing Corporation
COMPLETELY CONTRACTIVE MAPS BETWEEN C -ALGEBRAS
IJMMS 32:8 2002) 507 513 PII. S0161171202111331 http://mms.hindawi.com Hindawi Publishing Corp. COMPLETELY CONTRACTIVE MAPS BETWEEN C -ALGEBRAS W. T. SULAIMAN Received 15 November 2001 We give a simple
More informationA NOTE ON WELL-POSED NULL AND FIXED POINT PROBLEMS
A NOTE ON WELL-POSED NULL AND FIXED POINT PROBLEMS SIMEON REICH AND ALEXANDER J. ZASLAVSKI Received 16 October 2004 We establish generic well-posedness of certain null and fixed point problems for ordered
More informationON A ZONAL POLYNOMIAL INTEGRAL
ON A ZONAL POLYNOMIAL INTEGRAL A. K. GUPTA AND D. G. KABE Received September 00 and in revised form 9 July 003 A certain multiple integral occurring in the studies of Beherens-Fisher multivariate problem
More informationResearch Article On a Class of Integrals Involving a Bessel Function Times Gegenbauer Polynomials
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 27, Article ID 7375, 5 pages doi:1.1155/27/7375 Research Article On a Class of Integrals Involving a
More informationA NEW CHAOTIC ATTRACTOR FROM 2D DISCRETE MAPPING VIA BORDER-COLLISION PERIOD-DOUBLING SCENARIO
A NEW CHAOTIC ATTRACTOR FROM D DISCRETE MAPPING VIA BORDER-COLLISION PERIOD-DOUBLING SCENARIO ZERAOULIA ELHADJ Received 1 April 5 The following map is studied: (, ) (1 + a( )+,b). It is proved numericall
More informationN (Uke) (1.1) A DOUBLE CHAIN OF COUPLED CIRCUITS IN ANALOGY WITH MECHANICAL LATTICES. Uke
Internat. J. Math. & Math. Sci. VOL. 14 NO. 2 (1991) 403-406 403 A DOUBLE CHAIN OF COUPLED CIRCUITS IN ANALOGY WITH MECHANICAL LATTICES J.N. BOYD and P.N. RAYCHOWDHURY Department of Mathematical Sciences
More informationCOEFFICIENTS OF SINGULARITIES OF THE BIHARMONIC PROBLEM OF NEUMANN TYPE: CASE OF THE CRACK
IJMMS 23:5, 35 313 PII. S161171231278X http://ijmms.hindawi.com Hindawi Publishing Corp. COEFFICIENTS OF SINGULARITIES OF THE BIHARMONIC PROBLEM OF NEUMANN TYPE: CASE OF THE CRACK WIDED CHIKOUCHE and AISSA
More informationBLOWUP OF SOLUTIONS OF A NONLINEAR WAVE EQUATION
BLOWUP OF SOLUTIONS OF A NONLINEAR WAVE EQUATION ABBES BENAISSA AND SALIM A. MESSAOUDI Received 4 April 2001 and in revised form 20 October 2001 We establish a blowup result to an initial boundary value
More informationBOLTZMANN-GIBBS ENTROPY: AXIOMATIC CHARACTERIZATION AND APPLICATION
Internat. J. Math. & Math. Sci. Vol. 23, No. 4 2000 243 251 S0161171200000375 Hindawi Publishing Corp. BOLTZMANN-GIBBS ENTROPY: AXIOMATIC CHARACTERIZATION AND APPLICATION C. G. CHAKRABARTI and KAJAL DE
More informationMOTION OF TWO POINT VORTICES IN A STEADY, LINEAR, AND ELLIPTICAL FLOW
IJMMS 8:1 1) 571 58 PII. S16117117153 http://ijmms.hindawi.com Hindawi Publishing Corp. MOTION OF TWO POINT VORTICES IN A STEADY, LINEAR, AND ELLIPTICAL FLOW ROBERT M. GETHNER Received 19 March 1) Abstract.
More informationCtA, cc( ) ct,-l where S*() and C(-) denote the classes of starlike and convex 1-A
Internat. J. Math. & Math. Sci. VOL. 14 NO. 4 (1991) 741-746 741 ON RADII OF CONVEXITY AND STARLIKENESS OF SOME CLASSES OF ANALYTIC FUNCTIONS KHALIDA INAYAT NOOR Mathematics Department College of Science
More informationA CLASS OF INEQUALITIES RELATING DEGREES OF ADJACENT NODES TO THE AVERAGE DEGREE IN EDGE-WEIGHTED UNIFORM HYPERGRAPHS
A CLASS OF INEQUALITIES RELATING DEGREES OF ADJACENT NODES TO THE AVERAGE DEGREE IN EDGE-WEIGHTED UNIFORM HYPERGRAPHS P. D. JOHNSON JR. AND R. N. MOHAPATRA Received 26 August 2004 and in revised form 28
More informationCR-SUBMANIFOLDS OF A NEARLY TRANS-SASAKIAN MANIFOLD
IJMMS 31:3 2002) 167 175 PII. S0161171202109288 http://ijmms.hindawi.com Hindawi Publishing Corp. CR-SUBMANIFOLDS OF A NEARLY TRANS-SASAKIAN MANIFOLD FALLEH R. AL-SOLAMY Received 26 September 2001 This
More informationAUGUSTINE O. MUNAGI. Received 9 September 2004
k-complementing SUBSETS OF NONNEGATIVE INTEGERS AUGUSTINE O. MUNAGI Received 9 September 2004 Acollection{S 1,S 2,...} of nonempty sets is called a complementing system of subsets for a set X of nonnegative
More informationKKM THEOREM WITH APPLICATIONS TO LOWER AND UPPER BOUNDS EQUILIBRIUM PROBLEM IN G-CONVEX SPACES
IJMMS 2003:51, 3267 3276 PII. S0161171203211261 http://ijmms.hindawi.com Hindawi Publishing Corp. KKM THEOREM WITH APPLICATIONS TO LOWER AND UPPER BOUNDS EQUILIBRIUM PROBLEM IN G-CONVEX SPACES M. FAKHAR
More informationMultiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationp < N. It should be noted that only prime numbers are used to sieve, and that the multiples of ON THE K-th EXTENSION OF THE SIEVE OF ERATOSTHENES
Internat. J. Math. & Math. Sci. VOL. 18 NO. 3 (1995) 539-544 539 ON THE K-th EXTENSION OF THE SIEVE OF ERATOSTHENES ANTONIO R. QUESADA Department of Mathematical Sciences, The University of Akron, Akron,
More informationON ALMOST PRECONTINUOUS FUNCTIONS
Internat. J. Math. & Math. Sci. Vol. 24, No. 3 (2000) 193 201 S0161171200002441 Hindawi Publishing Corp. ON ALMOST PRECONTINUOUS FUNCTIONS SAEID JAFARI and TAKASHI NOIRI (Received 19 December 1997 and
More informationON GENERALIZED DERIVATIVES FOR C 1,1 VECTOR OPTIMIZATION PROBLEMS
ON GENERALIZED DERIVATIVES FOR C 1,1 VECTOR OPTIMIZATION PROBLEMS DAVIDE LA TORRE Received 19 September 2002 and in revised form 16 February 2003 We introduce generalized definitions of Peano and Riemann
More informationMulti Stage Queuing Model in Level Dependent Quasi Birth Death Process
International Journal of Statistics and Systems ISSN 973-2675 Volume 12, Number 2 (217, pp. 293-31 Research India Publications http://www.ripublication.com Multi Stage Queuing Model in Level Dependent
More informationAnalysis of birth-death fluid queues
Analysis of birth-death fluid queues E.A. van Doorn and W.R.W. Scheinhardt Faculty of Applied Mathematics University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands Abstract We present a survey
More informationTransient solution of a link with finite capacity supporting multiple streams
Performance Evaluation 43 (2001) 1 14 Transient solution of a link with finite capacity supporting multiple streams P.R. Parthasarathy, S. Dharmaraja Department of Mathematics, Indian Institute of Technology,
More informationDepartment of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing
Department of Applied Mathematics Faculty of EEMCS t University of Twente The Netherlands P.O. Box 27 75 AE Enschede The Netherlands Phone: +3-53-48934 Fax: +3-53-48934 Email: memo@math.utwente.nl www.math.utwente.nl/publications
More informationqueue KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology
Analysis of the Packet oss Process in an MMPP+M/M/1/K queue György Dán, Viktória Fodor KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology {gyuri,viktoria}@imit.kth.se
More informationAnalysis of fluid queues in saturation with additive decomposition
Analysis of fluid queues in saturation with additive decomposition Miklós Telek and Miklós Vécsei Budapest University of Technology and Economics Department of Telecommunications 1521 Budapest, Hungary
More informationCONTRA-CONTINUOUS FUNCTIONS AND STRONGLY S-CLOSED SPACES
Internat. J. Math. & Math. Sci. VOL. 19 NO. 2 (1996) 303-310 303 CONTRA-CONTINUOUS FUNCTIONS AND STRONGLY S-CLOSED SPACES J. DONTCHEV Department of Mathematics University of Helsinki 00014 Helsinki 10,
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationSensitivity Analysis for Discrete-Time Randomized Service Priority Queues
Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues George Kesidis 1, Takis Konstantopoulos 2, Michael Zazanis 3 1. Elec. & Comp. Eng. Dept, University of Waterloo, Waterloo, ON,
More informationTransient Solution of a Multi-Server Queue. with Catastrophes and Impatient Customers. when System is Down
Applied Mathematical Sciences, Vol. 8, 2014, no. 92, 4585-4592 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.45388 Transient Solution of a Multi-Server Queue with Catastrophes and Impatient
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationa=1/2(y+l), b=y-1, y!2, y(n and get a
Internat. J. Math. & Math. Sci. VOL. II NO. 4 (1988) 769-780 769 PYTHAGOREAN TRIANGLES OF EQUAL AREAS MALVINA BAICA Department of Mathematics and Computer Science The University of Wisconsin Whitewater,
More informationA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South
More informationx (t ax(t + bx([t]), (1.1)
Internat. J. Math. & Math. Sci. VOL. 15 NO. 2 (1992) 339-346 339 A PARABOLIC DIFFERENTIAL EQUATION WITH UNBOUNDED PIECEWISE CONSTANT DELAY JOSEPH WIENER Department of Mathematics The University of Texas-Pan
More informationQueueing 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 "
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 " Little s Law a(t): the process that counts the number of arrivals
More informationLINEAR PROGRAMMING WITH INEQUALITY CONSTRAINTS VIA
Internat. J. Math. & Math. Sci. VOL. 19 NO. (1996) 177-184 177 LINEAR PROGRAMMING WITH INEQUALITY CONSTRAINTS VIA ENTROPIC PERTURBATION H.-S. JACOB TSAO Institute of Transportation Studies University of
More informationTHE KREPS-YAN THEOREM FOR L
THE KREPS-YAN THEOREM FOR L D. B. ROKHLIN Received 1 January 2005 and in revised form 11 June 2005 We prove the following version of the Kreps-Yan theorem. For any norm-closed convex cone C L such that
More informationTMA4265 Stochastic processes ST2101 Stochastic simulation and modelling
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 7 English Contact during examination: Øyvind Bakke Telephone: 73 9 8 26, 99 4 673 TMA426 Stochastic processes
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationOverload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K
Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Attahiru Sule Alfa Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg, Manitoba
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationDISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition
DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition R. G. Gallager January 31, 2011 i ii Preface These notes are a draft of a major rewrite of a text [9] of the same name. The notes and the text are outgrowths
More informationSIMULATION STUDIES OF A FLUID QUEUING SYSTEM
SIMULATION STUDIES OF A FLUID QUEUING SYSTEM BY YUAN YAO THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Electrical and Computer Engineering in the Graduate
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More information(X0, Q(X0)) is the T0-identification space of (X,T) and (Xs0,Q(Xs0)) semi-t0-identification space of (X,T), and that if (X,T) is s-regular and
Irnat. J. M. Math. Si. Vol. 4 No. (1981)445-450 445 SEMI SEARATION AXIOMS AND HYERSACES CHARLES DORSETT Departent of Matheatics, Texas A&M University College Station, Texas (Received April 21, 1980 and
More informationON THE COEFFICIENTS OF VARIATION OF UPTIME AND DOWNTIME IN MANUFACTURING EQUIPMENT
ON THE COEFFICIENTS OF VARIATION OF UPTIME AND DOWNTIME IN MANUFACTURING EQUIPMENT JINGSHAN LI AND SEMYON M. MEERKOV Received 28 November 24 It was reported in the literature that the coefficients of variation
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationNOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES
NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES PENTTI HAUKKANEN AND ISMO KORKEE Receive 10 November 2004 Let S {,,...,x n } be a set of positive integers, an let f be an arithmetical function. The matrices
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationFinite queues at the limit of saturation
Finite queues at the limit of saturation Miklós Telek Budapest University of Technology and Economics Department of Telecommunications 1521 Budapest, Hungary Email: telek@webspnhitbmehu Miklós Vécsei Budapest
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationAnalysis of an M/G/1 queue with customer impatience and an adaptive arrival process
Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process O.J. Boxma 1, O. Kella 2, D. Perry 3, and B.J. Prabhu 1,4 1 EURANDOM and Department of Mathematics & Computer Science,
More informationExact transient solution of an M/M/1 driven fluid queue
International Journal of Computer Mathematics Vol. 00, No. 0, Month 2005, 1 13 Exact transient solution of an M/M/1 driven fluid queue B. SERICOLA, P.R. PARTHASARATHY * and K.V. VIJAYASHREE IRISA-INRIA,
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationElectronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing
Submitted to Management Science manuscript MS-251-27 Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing Rishi Talreja, Ward Whitt Department of
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationDeparture Processes of a Tandem Network
The 7th International Symposium on perations Research and Its Applications (ISRA 08) Lijiang, China, ctober 31 Novemver 3, 2008 Copyright 2008 RSC & APRC, pp. 98 103 Departure Processes of a Tandem Network
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationTwo Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server
Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server S. Jehoashan Kingsly 1, S. Padmasekaran and K. Jeganathan 3 1 Department of Mathematics, Adhiyamaan
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
More informationEconomy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University
Economy of Scale in Multiserver Service Systems: A Retrospective Ward Whitt IEOR Department Columbia University Ancient Relics A. K. Erlang (1924) On the rational determination of the number of circuits.
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationSOME RESULTS ON FIXED POINT THEOREMS FOR MULTIVALUED MAPPINGS IN COMPLETE METRIC SPACES
IJMMS 30:6 2002 319 325 PII. S0161171202110350 http://ijmms.hindawi.com Hindawi Publishing Corp. SOME RESULTS ON FIXED POINT THEOREMS FOR MULTIVALUED MAPPINGS IN COMPLETE METRIC SPACES JEONG SHEOK UME,
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationTHE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE. By Mogens Bladt National University of Mexico
The Annals of Applied Probability 1996, Vol. 6, No. 3, 766 777 THE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE By Mogens Bladt National University of Mexico In this paper we consider
More informationStability of the two queue system
Stability of the two queue system Iain M. MacPhee and Lisa J. Müller University of Durham Department of Mathematical Science Durham, DH1 3LE, UK (e-mail: i.m.macphee@durham.ac.uk, l.j.muller@durham.ac.uk)
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationStationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices
Stationary Probabilities of Marov Chains with Upper Hessenberg Transition Matrices Y. Quennel ZHAO Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba CANADA R3B 2E9 Susan
More informationLecture 6: Introduction to Partial Differential Equations
Introductory lecture notes on Partial Differential Equations - c Anthony Peirce. Not to be copied, used, or revised without explicit written permission from the copyright owner. 1 Lecture 6: Introduction
More informationThe shortest queue problem
The shortest queue problem Ivo Adan March 19, 2002 1/40 queue 1 join the shortest queue queue 2 Where: Poisson arrivals with rate Exponential service times with mean 1/ 2/40 queue 1 queue 2 randomly assign
More informationChapter 4 Markov Chains at Equilibrium
Chapter 4 Markov Chains at Equilibrium 41 Introduction In this chapter we will study the long-term behavior of Markov chains In other words, we would like to know the distribution vector sn) when n The
More informationA FAST MATRIX-ANALYTIC APPROXIMATION FOR THE TWO CLASS GI/G/1 NON-PREEMPTIVE PRIORITY QUEUE
A FAST MATRIX-ANAYTIC APPROXIMATION FOR TE TWO CASS GI/G/ NON-PREEMPTIVE PRIORITY QUEUE Gábor orváth Department of Telecommunication Budapest University of Technology and Economics. Budapest Pf. 9., ungary
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationEXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY
EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 011 MODULE 3 : Stochastic processes and time series Time allowed: Three Hours Candidates should answer FIVE questions. All questions carry
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationring structure Abstract Optical Grid networks allow many computing sites to share their resources by connecting
Markovian approximations for a grid computing network with a ring structure J. F. Pérez and B. Van Houdt Performance Analysis of Telecommunication Systems Research Group, Department of Mathematics and
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationA Simple Memoryless Proof of the Capacity of the Exponential Server Timing Channel
A Simple Memoryless Proof of the Capacity of the Exponential Server iming Channel odd P. Coleman ECE Department Coordinated Science Laboratory University of Illinois colemant@illinois.edu Abstract his
More informationSTABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL
First published in Journal of Applied Probability 43(1) c 2006 Applied Probability Trust STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL LASSE LESKELÄ, Helsinki
More informationStochastic cellular automata model for wildland fire spread dynamics
Journal of Physics: Conference Series Stochastic cellular automata model for wildland fire spread dynamics To cite this article: Rodolfo Maduro Almeida and Elbert E N Macau 2011 J. Phys.: Conf. Ser. 285
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationA Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with AQM
Appl. Math. Inf. Sci. 7, No. 3, 99-915 (213) 99 Applied Mathematics & Information Sciences An International Journal A Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with
More informationDerivation of Formulas by Queueing Theory
Appendices Spectrum Requirement Planning in Wireless Communications: Model and Methodology for IMT-Advanced E dite d by H. Takagi and B. H. Walke 2008 J ohn Wiley & Sons, L td. ISBN: 978-0-470-98647-9
More informationSIMILAR MARKOV CHAINS
SIMILAR MARKOV CHAINS by Phil Pollett The University of Queensland MAIN REFERENCES Convergence of Markov transition probabilities and their spectral properties 1. Vere-Jones, D. Geometric ergodicity in
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More information