DOCSLIB.ORG

Imbedded Markov Chain Analysis of Single Server Bulk Queues

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Imbedded Markov Chain Analysis of Single Server Bulk Queues IMBEDDED MARKOV CHAIN ANALYSIS OF SINGLE SERVER BULK QUEUES U. NARAYAN BHAT (received 11 August 1963) Summary In this paper results from Fluctuation Theory are used to analyse the imbedded Markov chains of two single server bulk-queueing systems, (i) with Poisson arrivals and arbitrary service time distribution and (ii) with arbitrary inter-arrival time distribution and negative exponential service time. The discrete time transition probabilities and the equiUbrium behaviour of the queue lengths of the systems have been obtained along with distribu­ tions concerning the busy periods. From the general results several special cases have been derived. 0. Introduction The general bulk queue is described as follows: Groups of customers arrive at service points and get served in batches. The sizes of the arriving groups and those of the batches for service are random variables having independent distributions. The time intervals between successive group arrivals are independent and identically distributed random variables; so also are the service times of the different batches. We shall call the maximum size of a service group as the "capacity" for that service and assume that this capacity is independent of the queue length at that time. Following {x) l,l) Kendall [9] we use the notation GI \G \l to represent the general single server bulk queue, the exponents x and y denoting the sizes of the arriving groups and service capacity respectively. We shall suppress these exponents when they are equal to one. Further, we shall assume that the queue-discipline is "first come, first served" and that when the arrivals are in groups, the units will be ordered for the purpose of service. The object of this paper is to obtain the discrete time behaviour of (X) M the bulk queues (i) (Poisson arrivals and arbitrary service W M{V) \G \1 time) and (ii) GI \M \\ (arbitrary inter-arrival time distribution and negative exponential service time). This is done by analysing the Markov chains imbedded in them. Some aspects of these systems have been studied Downloaded from https://www.cambridge.org/core. IP address: 170.106.40.139, on 30 Sep 2021 at 11:07:55, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S1446788700023454 [2] Imbedded Markov chain analysis of single server bulk queues 245 by Miller [10]; and several special cases have been considered by Bailey [1], Taiswal [6], Takacs [13,14], Foster [4], Foster and Nyunt [5], Keilson [7] and Boudreau, Griffin and Kac [2]. In our discussion we make use of known results in Fluctuation Theory for the sums of independent and identical random variables, to obtain the behaviour of QN, the queue length at TN (arrival or departure epoch, whichever is convenient). For the study of WN the virtual waiting time at an instant of arrival T„, these results have already been used by Spitzer [12] and Kemperman [8]. The paper is divided into four sections. In section 1 certain basic results from Fluctuation Theory are described; section 2 deals with the system MW\GW\1 and section 3 with the system GIIX)\MIR)\L. Finally some special cases of these queues have been considered in the last section. 1. Basic results from fluctuation theory The following are the special cases of more general results derived by Spitzer [12], Feller [3] and Kemperman [8], for sums of independent and identical random variables (r.v.). Let {ZN} (» = 1, 2 • • •) be a sequence of mutually independent and identical r.v.'s assuming integral values and Sn == Z1+Z2+ • • • -\-ZN (« = 1, 2 • • •), S0 = 0 be the partial suras of {ZN}. Let (1 I) Pr{Z" = i] = *' {j = '} 1 ' ' ¿(0) = £'(0Z"), 0 < f (1) < co and (1.2) *<"> = Pr{SB = 7} («^1), *}« = *„ A<"' = 0 (/#0),*g» = l. We define two functions M~(6, Z) and M+(0, Z) as follows. (1.3) M-(6, Z) = exp I -1 - 2 E'K?]) (W) < l> l0l 2? 1) I 1 « -00 I B) (1.4) M+(D, 2)=exp(2-2^ 1 (WXL 1*1 £1) \ i » o ) such that they are related by the property (1.5) [l-^(0)]M+(0, Z) = M-(6, Z) (Kemperman [8] equations (13.4) —(13.8)). For the partial sums S„, we have the following results, (i) Let g„* = Pr^ > 0, S, > 0 • • • SN_X > 0, SB ^ 0}; then Downloaded from https://www.cambridge.org/core. IP address: 170.106.40.139, on 30 Sep 2021 at 11:07:55, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S1446788700023454 246 U. Narayan Bhat [3] (16) g^) = |^=l-exp{-|^|^j = 1-M-(1, z) exp { -1 ~ Pr{SB = 0}}. (ii) Let = Pr{S1> 0, Sa > 0, • • • SB_X > 0, Sn = /} (/ > 0); then n*(B, z) = | | **(?>"ö> = exp (5 - | 0*Ä<">) n=-o /-l t i w i ; (L7) = M+(0, z) exp j -|£ Pr{Sn = 0} j. (üi) Let g„ = Pr^ ^ 0, S2 2t 0 • • • S_t 2i 0, S„ < 0}, then (18) fW-5«^-i— = 1-M-(1, 2). (iv) Let n {i+St i+S ^ j) (i, j n = Pr 2j 0, z 0 • • • *+SB_, 2r 0, i+S„ = Sj 0); 00 CO CO w n then 7t(m, 0, z) =2 2 2 n(*. 7> «W n=0 «=0 ¿«-0 1 /00 »n oo co «n —1 \ (L9) - r^Äex p 2 - 2 ^»+2 - 2 °>-'*H n 1—«0 d M o 1 -oo J ~~ 1—w0M-(w-1, z)" [Spitzer [12]; also Feller [3] equations (9.8), (9.13) and (7.10). For (1.9) here, see Kemperman [8] equation (16.13).] Finally we shall define w S S„); n = max (0, lt S2 • • • then 00 oo / oo .» 0 oo yn 1 = M+(0, z)\M-(l, z)]-1. Downloaded from https://www.cambridge.org/core. IP address: 170.106.40.139, on 30 Sep 2021 at 11:07:55, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S1446788700023454 [4] Imbedded Markov chain analysis of single server bulk queues 247 When n -> oo, writing linv,.,^ w„ = , we have (a) if E(Zn) _ 0, »M = oo with probability one; (b) if E(Z„) < 0, tPo, < oo with probability one and is given by 1 (i.ii) £(0»°°) = exp (-2 — I(i-e*)^" ) (Spitzer [12]). (x) 2. The queue yM |a'"|l Description: The queueing system considered here has the following description. (i) The arrivals are in a Poisson process with parameter U in groups of size {CB} having the distribution Pr{CB = r} = cr (r = 0, 1, 2---); let (2.1) c(0) = £(0C«). |0| ^ 1, 0 < c'(l) < oo. The probability that / customers arrive in time interval (0, T) is given by (2.2) aAT) = ^e-XT^lcf) 1 where {cj* } is the ft-fold convolution of {ct} with itself. It should be noted that the compound Poisson process (2.2) has the property that the number of arrivals in non-overlapping time intervals are independent r.v.'s. (ii) The customers are served in batches of variable capacity. Let the successive departures take place at the instants tlt i2, • • •, and denote by vn the service time of the batch departing at tn. We assume that {vn} (« = 1, 2 • • •) is a sequence of identically distributed independent r.v.'s with a common distribution function H(x) = Pr{t>„ ^ a;}. Let (2.3) y>{o) = f e-™dH(x) Re(cr) ^ 0 J o and 0 < — ip'(0) < co. Let Xn be the number of customers arrived during a service period; then we have A c iH (2.4) Pr {Xn = ;} = «, = f° 2 *~ ' '*' ®' Jo H »! (2.5) X and K(d) = E(B ") = v(A-Ac(0)). Downloaded from https://www.cambridge.org/core. IP address: 170.106.40.139, on 30 Sep 2021 at 11:07:55, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S1446788700023454 248 U. Narayan Bhat [5] t (n (iii) If Y„ is the capacity for service ending at n+l = 1, 2, 3 • • •), we assume that the r.v.'s Yn are identically distributed and mutually independent and also independent of the Xn; let (2 61 Pr{Yn = /} = &, (/=0,1,2..-); K ' ' B(6) = E(0r'). |0| <i 1, 0 < .B'(l) < oo. The relative traffic intensity of the system is defined by (2.7) gg,),-V(0y(l) (0<o<oo). 1 P ; 1 ; P E(Yn) B'(l) ^ Further, we define Qn = Q(tn+0) where Q(t) is the queue length at time t (number of customers in the system, including those who are being served); {Qn} is a Markov chain imbedded in the process Q(t). Let tn and tn+m be such that Qn-1<Yn_1, QT^YT, {r = n, n+l, • • • n+m—1), Qn+m < Yn+m • During this period (tn, tn+m) full service capacity has been utilized and we shall call such a period "capacity busy period". If at some epoch tr, Qr < Yr, the server is said to be "slack"; then the following different possibilities are open to him at that time: (a) Y„ > Qn 0, he may wait until his maximum capacity Y„ is reached; (b) Y„ > Q„ > 0, he may take the available customers into service; (c) Qn = 0, he may either wait for the first customer to arrive or proceed for service with no customers. An example of the last service mechanism is an elevator or a transport service which is kept in operation even when there are no cus­ tomers to be served.
Load more

Recommended publications
  • Markovian Bulk-Arrival and Bulk-Service Queues with General State-Dependent Control
    Queueing Systems (2020) 95:331–378 https://doi.org/10.1007/s11134-020-09660-0 Markovian bulk-arrival and bulk-service queues with general state-dependent control Anyue Chen1,2 · Xiaohan Wu1 · Jing Zhang3 Received: 17 March 2019 / Revised: 25 May 2020 / Published online: 5 July 2020 © The Author(s) 2020 Abstract We study a modified Markovian bulk-arrival and bulk-service queue incorporating general state-dependent control. The stopped bulk-arrival and bulk-service queue is first investigated, and the relationship between this stopped queue and the full queueing model is examined and exploited. Using this relationship, the equilibrium behaviour for the full queueing process is studied and the probability generating function of the equilibrium distribution is obtained. Queue length behaviour is also examined, and the Laplace transform of the queue length distribution is presented. The important ques- tions regarding hitting times and busy period distributions are answered in detail, and the Laplace transforms of these distributions are presented. Further properties regard- ing the busy period distributions including expectation and conditional expectation of busy periods are also explored. Keywords Bulk-arrival and bulk-service queues · State-dependent control · Equilibrium distribution · Queue length distributions · Busy period distributions Mathematics Subject Classification Primary 60J27; Secondary 60J80 B Anyue Chen [email protected]; [email protected] Xiaohan Wu [email protected] Jing Zhang [email protected] 1 Department of Mathematics, The Southern University of Science and Technology, Shenzhen 518055, Guangdong, China 2 Department of Mathematical Sciences, The University of Liverpool, Liverpool L69 7ZL, UK 3 Institute for Data and Decision Analytics, The Chinese University of Hong Kong, Shenzhen 518172, Guangdong, China 123 332 Queueing Systems (2020) 95:331–378 1 Introduction Markovian queues occupy a significant niche in applied probability.
    [Show full text]
  • A Bibliography on Semi-Markov Processes BIBLIOGRAPHY 004
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector A bibliography on semi-Markov processes BIBLIOGRAPHY 004 Jozef L. Teugels (*) INTRODUCTION At the appearance of this bibliography we want to thank warmly all those who have helped compiling this edition by sending us titles of publications, preprints, reprints and other re- levant information. Especially Cheong C. Kong and Jos H.A. de Smit have contributed at an early stage. All publications by the same author have been arranged by the year of publication. This will be convenient if in the future we should decide to publish a supplement to this bibliography. The present version contains about 600 papers written by some 300 authors. We have indicated to the best of our kwowledge where a publication has been reviewed or summarized. We write ST for Statistical Theory and Method Abstracts, MR for Mathematical Reviews and Zbl for Zentralblatt fiir Mathematik und ihre Grenzgebiete. The first number refers to the volume and the second to the number of the page (for Zbl) or review/abstract (for ST and MR). Thus MR 27-1999 refers to review number" 1999 of volume 27 of Mathe- matical Reviews.. We follow MR in our abbreviations and transliterations for the names of journals. The reader's attention is drawn on translations made of journals published in Russian. The index volumes of MR should be consulted. New information can always be forwarded to the author. BIBLIOGRAPHY Akimov A.P. and Pogosjan I.A. Andronov A.M. and Gertsbakh I.G. On structural reservation systems with repair and cold reser- On properties of multidimensional functionals on semi-Mar- vation 1974 kov processes with finite state space.
    [Show full text]
  • Modeling an M/M/1 Queue with Unreliable Service and a Working Vacation
    Modeling an M/M/1 Queue with unreliable service and a working vacation by Joshua K. Patterson Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy The University of Texas at Arlington May, 2019 i Modeling an M/M/1 Queue with unreliable service and a working vacation by Joshua K. Patterson Department of Mathematics The University of Texas at Arlington Abstract We define the new term ’unreliable service’ where the service itself is unreliable (i.e. may fail). We discuss how this differs from the current literature, and give examples showing just how common this phenomena is in many real-world scenarios. We first consider the classic M/M/1 queue with unreliable service and find some striking similarities with the well studied M/M/1 derivation. Next, we consider the M/M/1 queue with unreliable service and a working vacation. In each of these cases, surprising explicit results are found including positive recurrence conditions, the stationary queue length distribution, and a decomposition of both the queue length and waiting time. We also purpose a number of ideas for future research based on this newly defined phenomenon. ii Acknowledgements I would like to thanks my advisor Professor Andrzej Korzeniowski for his expertise and vast knowledge of queue theory and stochastic processes, the history of these topics, and major contributors therein. In addition, I would like to extend my gratitude towards my committee members, Drs. Suvra Pal, Shan Sun-Mitchell, and Jonghyun Yun. I would also like to acknowledge my mother, Brenda; father, Ken; grandmother, Brenda; step-grandfather, James; aunt, Amy; uncle, Brad; brothers Michael, Aaron; and step-brother David for their ongoing love and support from the very beginning–and I mean the very beginning.
    [Show full text]
  • A Complete Bibliography of Publications in Statistics and Probability Letters: 1990–1999
    A Complete Bibliography of Publications in Statistics and Probability Letters: 1990{1999 Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 22 March 2018 Version 1.06 Title word cross-reference (N;d) [WC97]. (n; f; k) [CCH99]. 0 <r<1=2 [San91]. 1 [MH96]. 2 [EK96b, Ete99, SN96]. 2β [PP92b]. 2k [Kou96c]. 2m [Arc98a]. 3k [Kou96c]. 4 [Kab99]. 5 [Shi99]. a [PP92a]. A [Brz96, MH90]. α [AM94a, Alb97, CR92, Lie99, Mas96, Sam94, Sap99, Sha93, ZW97a, ZW97b]. L¯ [BS96a]. X¯ [KT93]. β [Hil99]. modn [DH97]. c [R¨us96]. C(α) [Wei92]. χ2 [Cha90d]. D [BH90, Brz96, Cha99c, CJ98, Kou96b, Kou96f, MZ97, Sch97c, Won95, MV95b]. D[0; 1] [BP93]. D+ [Fie90]. δ [Fal94, Kau95]. E [Brz95, Brz96, MZ97]. E(XjX + W )[Beh99].ER [Koz96]. [Bor96, Wu92]. F [Ext91, Run93, Sil96a, Zog94]. F α [Bal94]. G [Imh97, Won95, Kra98]. I0 [Fie90, RT93]. k [BP99b, BCQY97, BGP94, CSC93, Cha90b, CAGM98, HMG98, HT91, NNR97, PA90, PAT90, RC94, SB95a, SS95, Tso96, Vas90]. k(≥ 2) [MvdM97]. K × K × K [EZ99]. L [Abr93, BSW97, Brz96, Don98, Ger93, GR93a, PJ94, RW94, Sha91, Xia95]. 1 2 P p L [Lin95, Web92]. L (0; 1) [OS98]. L1 [AM94b, BW97, Dav93, EH99b, Hub97, KP94b, LM92, ST96]. L2 [LH98a]. L1 [CAGM98]. Lp [Ahm97, Che96, GKL96, Leb96, Wu90, Hei93]. Lq [Joh91]. Ls [FPMP97]. λ3 [HK91]. M [Arc94b, Arc98b, BlZ93, BKR92, Cro94, Fer98, Gen98, Jon94, LZ91, RZ92a, RC94, WW90b, Zha97a, Bo98, Che97b, GB96, Sco93, Wan99d, Wie96].
    [Show full text]
  • Continuous-Service M/M/1 Queuing Systems
    Article Continuous-Service M/M/1 Queuing Systems Song Chew Department of Mathematics and Statistics, Southern Illinois University Edwardsville, Edwardsville, IL 62026, USA; [email protected]; Tel.: +1-618-650-3016 Received: 29 March 2019; Accepted: 24 April 2019; Published: 28 April 2019 Abstract: In this paper, we look into a novel notion of the standard M/M/1 queueing system. In our study, we assume that there is a single server and that there are two types of customers: real and imaginary customers. Real customers are regular customers arriving into our queueing system in accordance with a Poisson process. There exist infinitely many imaginary customers residing in the system. Real customers have service priority over imaginary customers. Thus, the server always serves real (regular) customers one by one if there are real customers present in the system. After serving all real customers, the server immediately serves, one at a time, imaginary customers residing in the system. A newly arriving real customer presumably does not preempt the service of an imaginary customer and hence must wait in the queue for their service. The server immediately serves a waiting real customer upon service completion of the imaginary customer currently under service. All service times are identically, independently, and exponentially distributed. Since our systems are characterized by continuous service by the server, we dub our systems continuous-service M/M/1 queueing systems. We conduct the steady-state analysis and determine common performance measures of our systems. In addition, we carry out simulation experiments to verify our results. We compare our results to that of the standard M/M/1 queueing system, and draw interesting conclusions.
    [Show full text]
  • June 1985 LIDS-P-1481 the BULK SERVICE QUEUE with a GENERAL CONTROL STRATEGY
    June 1985 LIDS-P-1481 THE BULK SERVICE QUEUE WITH A GENERAL CONTROL STRATEGY: THEORETICAL ANALYSIS AND A NEW COMPUTATIONAL PROCEDURE Warren B. Powell* Pierre Humblet** EES-83-5 Revised May, 1985 *Department of Civil Engineering, Princeton University. Research supported by NSF under grant No. CEE-8203476. **Research was conducted at the Laboratory for Information and Decision Systems at the Massachusetts Institute of Technology with partial support provided by NSF under grant No. NSF-ECS-8310698. This paper has been accepted by Operations Research. Abstract A general framework is developed for analyzing a wide class of vehicle dispatching strategies for bulk arrival, bulk service queues. A simple derivation of the queue length transform for the imbedded Markov chain is provided and a new computational procedure is developed for finding the moments of the queue length distribution. Extensive computational tests are reported which demonstrate that the new procedure is significantly faster and more stable than the standard method referred to in the literature, which requires solving a set of simultaneous linear equations. Formulas for the mean and variance of the length of the queue are provided for the general case of compound Poisson arrivals, random batch capacities, general service times and a general control strategy. We consider the problem of analyzing bulk arrival, bulk service queues in steady state where customers arrive in groups at a point and wait for the next available vehicle. Under the simplest policy, termed here the bulk queue with no control, the vehicle, on arriving, will accept customers up to the capacity of the vehicle and then leave, independent of the number of customers waiting.
    [Show full text]
  • On the Distribution of the Number Stranded in Bulk-Arrival, Bulk-Service Queues of the M/G/1 Form
    On the distribution of the number stranded in bulk-arrival, bulk-service queues of the M/G/1 form Aykut Kahraman M & T Bank, Bu®alo, NY 14620 Abhijit Gosavi ¤ Missouri University of Science and Technology 219 Engineering Management, Rolla, MO 65401 Phone: (573)341-4624 Email: [email protected] Fax: (573)341-6567 February 3, 2011 Abstract Bulk-arrival queues with single servers that provide bulk service are widespread in the real world, e.g., elevators in buildings, people-movers in amusement parks, air-cargo delivery planes, and automated guided vehicles. Much of the literature on this topic focusses on the development of the theory for waiting time and number in such queues. We develop the theory for the number stranded, i.e., the number of customers left behind after each service, in queues of the M/G/1 form, where there is single server, the arrival process is Poisson, the service is of a bulk nature, and the service time is a random variable. For the homogenous Poisson case, in our model the service time can have any given distribution. For the non-homogenous Poisson arrivals, due to a technicality, we assume that the service time is a discrete random variable. Our analysis is ¤Corresponding author 1 not only useful for performance analysis of bulk queues but also in designing server capacity when the aim is to reduce the frequency of stranding. Past attempts in the literature to study this problem have been hindered by the use of Laplace transforms, which pose severe numerical di±culties. Our approach is based on using a discrete-time Markov chain, which bypasses the need for Laplace transforms and is numerically tractable.
    [Show full text]
  • A Complete Bibliography of the Journal of the Royal Statistical Society, Series B Family
    A Complete Bibliography of the Journal of the Royal Statistical Society, Series B family Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 17 May 2021 Version 1.18 Title word cross-reference 2161, 1397, 1459, 1572, 1521]. Rn [3424]. N [380, 381, 878, 3327]. N = 3 [246]. NEAR(2) [1845, 1770]. NLAR(2) [1845]. P K m × [2524, 3238, 3441, 884, 860, 3220, 3327]. 1=! [2140]. 2 [632, 275]. 2 [3321]. 2 3 − 0 n−m P pp [2193]. πPS [1179, 832, 929, 904]. [1084]. 2 [1208]. 2 × 2 − qn m [2206]. Rd [3052]. ρ [3412]. r × s [968]. [937, 676, 2024, 2637, 138]. 2 × 2 × 2 ··· [47]. p b [1323]. T [1237, 2813, 1070, 2704, 3155, 3 [3621]. 2 [3231]. n [826, 938]. [363, 644]. 1 k 1147, 3437, 2689, 1094]. T 2 [629]. τ [3412]. U [774]. [2606]. A [2088]. α [3282, 3003]. λ O n [2368, 2431, 376]. V [515]. ' [3520]. X2 AR(p) [3064]. b<v[1432]. b [1323]. c k 2 [885]. [969, 3520]. χ2 [307, 1147, 960, 230, 70, 13, 699]. D [2201, -Approximation [699]. -Associate 2362, 1565, 1226, 1496, 1065, 1193, 1157]. E [1459, 1696]. -Component [860]. [1446, 1447, 1552]. E(r ) [237]. E(s2) [2600]. s -Concurrence [1572]. -Contaminations [1944]. F [791, 1194, 1147, 1253, 1277].
    [Show full text]
  • Microfilms International
    IM w sity Microfilms International V lalj* 1.0 Itt _ to . y £ 22 £ b£ 2.0 1.1 UL 11.25 111 1.4 1.6 MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU OF STANDARDS STANDARD REFERENCE MATERIAL 1010a (ANSI and ISO TEST CHART No. 2) University Microfilms Inc. 300 N. Zeeb Road, Ann Arbor, MI 48106 INFORMATION TO USERS This reproduction was made from a copy of a manuscript sent to us for publication and microfilming. While the most advanced technology has been used to pho­ tograph and reproduce this manuscript, the quality of the reproduction is heavily dependent upon the quality of the material submitted. Pages in any manuscript may have indistinct print. In all cases the best available copy has been filmed. The following explanation of techniques is provided to help clarify notations which may appear on this reproduction. 1. Manuscripts may not always be complete. When it is not possible to obtain missing'pages, a note appears to indicate this. 2. When copyrighted materials are removed from the manuscript, a note ap­ pears to indicate this. 3. Oversize materials (maps, drawings, and charts) are photographed by sec­ tioning the original, beginning at the upper left hand comer and continu­ ing from left to right in equal sections with small overlaps. Each oversize page is also filmed as one exposure and is available, for an additional charge, as a standard 35mm slide or in black and white paper format.* 4. Most photographs reproduce acceptably on positive microfilm or micro­ fiche but lack clarity on xerographic copies made from the microfilm.
    [Show full text]
  • A Complete Bibliography of Publications in Probability in the Engineering and Informational Sciences
    A Complete Bibliography of Publications in Probability in the Engineering and Informational Sciences Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 29 March 2021 Version 1.10 Title word cross-reference (m; n): F [LZ00]. (r; s) [LZ00]. (s; S) [CF06]. (S − 1;S) [SD97]. 1 [vdH87]. 1n [LSSZ16]. 2 [CHL94, vdH87]. X [CCC05, Eco99, GV10, Dud97, ET87, Fra05, PR08]. X1 [CLC98]. X2 [CLC98]. Y [GV10]. K [Lu09]. m [LSSZ16]. Cp [Kha99]. Cpm [Kha99]. C [MBP07]. L [Bha99]. · [PMB96]. D [GSV16, LN92]. `1 [SSS04]. f [CL06]. G [BA18, Cag17, Fou16, FM17, GS92, Gel93, Mar16, MK17, Mat17, Mat19b, Wan21, DP21, GZDW21, Pek21]. G=M [SZ05]. i [Bar08]. 1 [CSP12, Eli08, PZ04, PMB96, VY08]. k [AR97, AAC14, BFR99, BPT90, BW14, CH88, CCH99, CHC00, CHJ95, DZH12, HH16, HH00, HY90, Hwa00, KM88, KX10, Kor03, LYF16, LZ00, LHY19, Men94b, SY15, Tam98, WAvHD09, Yao89]. l1 [SSS02, SSS08]. LS [WXWH18]. m [KM16, VT08]. N [Yec88, BFR99, CH88, CCH99, CHC00, 1 2 CHJ95, DL10, HH00, HY90, Jia19, KM88, KX10, Kor03, LYF16, MI10, SY15]. n: F [BPT90, CHL94, DZH12, Yao89]. P [DK13, HZ05, HZ06, XH09]. PAR(p) [MD06]. Q [CH15, EK09]. R [Men94b]. σ [Ang97, DR95a, Kha99]. t [ANFPLCSL05, Lin90b, Lin92a, Lin94a, SA88]. × [BvH93]. TP2 [DLP90]. U [BR95]. z [Tag00]. -ary [KM16]. -Distribution [ANFPLCSL05]. -limited [BW14, WAvHD09]. -network [DP21, DL10, MK17, Mat17, Mat19b].
    [Show full text]
  • Analysis of Batch Arrival Bulk Service Queue with Multiple Vacation Closedown Essential and Optional Repair
    Available at http://pvamu.edu/aam Applications and Applied Appl. Appl. Math. Mathematics: ISSN: 1932-9466 An International Journal (AAM) Vol. 13, Issue 2 (December 2018), pp. 578 - 598 Analysis of batch arrival bulk service queue with multiple vacation closedown essential and optional repair 1G. Ayyappan and 2T. Deepa Department of Mathematics Pondicherry Engineering College Pillaichavady, Puducherry - 605 014, India [email protected];[email protected] Received: September 20, 2017; Accepted: February20, 2018 Abstract The objective of this paper is to analyze an queueing model with multiple vacation, closedown, essential and optional repair. Whenever the queue size is less than , the server starts closedown and then goes to multiple vacation. This process continues until at least customer is waiting in the queue. Breakdown may occur with probability when the server is busy. After finishing a batch of service, if the server gets breakdown with a probability , the server will be sent for repair. After the completion of the first essential repair, the server is sent to the second optional repair with probability . After repair (first or second) or if there is no breakdown with probability , the server resumes closedown if less than ` ' customers are waiting. Otherwise, the server starts the service under the general bulk service rule. Using supplementary variable technique, the probability generating function of the queue size at an arbitrary time is obtained for the steady-state case. Also some performance measures and cost model are derived. Numerical illustrations are presented to visualize the effect of various system parameters. Keywords: Bulk queue; Multiple vacation; Closedown; Essential and optional repair Mathematics Subject Classification (2010): 60K25, 90B22, 68M20 1.
    [Show full text]
  • An Introduction to Queueing Theory Modeling and Analysis in Applications
    U. Narayan Bhat An Introduction to Queueing Theory Modeling and Analysis in Applications Birkhauser Boston • Basel • Berlin Contents Preface xi 1 Introduction 1 . 1.1 Basic System Elements 1 1.2 Problems in a Queueing System 2 1.3 A Historical Perspective 4 1.4 Modeling Exercises 11 2 System Element Models 13 2.1 Probability Distributions as Models 13 2.1.1 Deterministic Distribution (D) 14 2.1.2 Exponential distribution; Poisson process (M) 14 , 2.2 Identification of Models 18 2.2.1 Collection of Data 18 2.2.2 Tests for Stationarity 18 2.2.3 Tests for Independence 19 2.2.4 Distribution Selection 19 2.3 Review Exercises 20 3 , Basic Concepts in Stochastic Processes 23 3.1 Stochastic Process 23 3.2 Point, Regenerative, and Renewal Processes 23 3.3 Markov Process 24 4 Simple Markovian Queueing Systems 29 4.1 A General Birth-and-Death Queueing Model 29 4.2 The Queue M/M/l 34 - 4.2.1 Departure Process 40 4.3 The Queue M/M/s 43 4.4 The Finite Queue M/M/s/K 51 4.5 The Infinite-Server Queue M/M/oo 58 Contents 4.6 Finite-Source Queues 59 4.7 Other Models 62 4.7.1 The M/M/l/1 System 62 4.7.2 Markovian Queues with Balking 64 4.7.3 Markovian Queues with Reneging 66 4.7.4 Phase-Type Machine Repair 66 4.8 Remarks 68 4.9 Exercises 68 Imbedded Markov Chain Models 75 5.1 Imbedded Markov Chains 75 5.2 The Queue M/G/l 76 5.3 The Queue G/M/l 98 5.4 Exercises 112 Extended Markov Models 115 6.1 The Bulk Queue M(X)/M/\ 115 6.2 The Bulk Queue Af/AfW/1 118 6.3 The Queues M/Ek/\ and Ek/M/\ 120 6.4 The Bulk Queues M/GK/l and GK/M/\ 123 6.5 The Queues Ek/G/\ and
    [Show full text]