urn DISTRIBUTED BY: National Technical Information Service U. S. DEPARTMENT OF COMMERCE Prepared for: Army Research Office October 1975 AD-A
|
|
- Ashley Cunningham
- 6 years ago
- Views:
Transcription
1 - MMHH^MiM^^MaMBMMMHH AD-A AN EXTENSION OF ERLANG'S LOSS FORMULA Ronald W. Wolff, et a1 California University Prepared for: Army Research Office October 1975 urn DISTRIBUTED BY: National Technical Information Service U. S. DEPARTMENT OF COMMERCE
2 _,, la I ORC OCTOBER 1075 AN EXTENSION OF ERLANG'S LOSS FORMULA a to o < by Ronold W. Wolff and Charlu W. WrigMson OPERATIONS RESEARCH CENTER NATIONAL TECHNICAL INFORMATION SERVICE US C'fpÄrtfnrnt "' Commcico Spnngf.old, \ X }2ISI I j J :ij UNIVERSITY OF CALIFORNIA BERKELEY
3 * ^^ t^ i^ tibb*mim* Ufg AN EXTENSION OF KKI.ANC'S LOSS FORMULA Operations Kest'.ircli Center Research Report No Ronald W. Wolff and Charles W. Wright son October 19/5 U. S. Armv Research Office - Durham I)AHC04-75-G-ül63 Department of Industrial Engineering and Operations Research and Operations Research Center University of California, Berkeley APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. I
4 UnclauHlfiud SECURITY Ct»ssirii:»TiON or THIS t'«gt rwhtn Du» r.nftn» 1 HCPOMT NUMBCM ORC «TiTuE tr<t Suhlllln REPORT DOCUMENTATION PAGE AN EXTENSION OF ERLANC'S LOSS FORMULA READ INSTRUCTIONS HEFORE COMPLETING FORM 2 GOVT ACCESSION NO 1 NCClVlENT'S CATAl 00 NUMBER i TVPE Of REPORT» PERIOD COVERCO Research Report «PER'ORMINC ORO REPORT DUMBER ^»u T -0R't. Ronald W. Wolff and Charles W. Wrightson CONTRACT OR GRAST NUMBER'*; DAHCO4-75-r,-0163 > PER'ORM'NG ORGANIZATION NAME AND ADDRESS Operations Research Center University of California Berkeley, California H COSTROLLINS OFFICE NAME AND ADDRESS U.S. Army Research Office-Durham Box CM, Duke Station Durham^ North Carolina PROGRAM ELEMENT PROJECT TASK AREA t «ORK UNIT NUMBERS P M 12 REPORT DATE October NUMBER OF PAGES ' MOSiTSRiNG AGENCv NAME A ADDRESSCIf dofcrwil from Controlling Olllc) IS SECURITY CL ASS lat thl* t»poi\ Unclassified It IS«. DECL ASSIFICATION DOW'l OR A Dl N 0 SCHEDULE I«DISTRIBUTION STATEMENT 'of 1M1 R»poHi Approved for public release; distribution unlimited. 17 DISTRIBUTION STATEMENT 'ol ih»»btittel tnltfd In Black 30, II dlllmrtnl from Rtpott) K SUPPLEMENTARY NOTES 'i KEY WORDS rcomlnu«on r«f«r** aid«ii n«c«««ary and Idtnllly by block numb«r; Erlang's Formulas State Probabilities for Individual Servers Emergency Units 20 ABSTRACT fconilnu» on r«v«r«««id«ii n«c«««ary «nd Idmllly by block numbor) (SEE ABSTRACT) DD I JAN COITION OF I NOV 65 IS OBSOLETE S/N 010J-OU-6801 ifil Unclassified SCCUNITY CLASSIFICATION OF THIS PAGE fwh»n Dmta tnffd) Ü ^ A^MMTM
5 ABSTRACT A two server loss system is considered with N classes of Poisson arrivals, where the service distribution function and server preferences are arrival class dependent. The stationary state probabjlities are derived and found to be independent of the form of the servire distributions. il m mmmmmmmmmamm
6 I «M^^MB^f MM W I AN EXTENSION OF ERLANG'S LOSS FuRMUU I. by Ronald W. Wolff and Charles W. Wrightson Introduction Emergency service systems have been modeled and analyzed as systems with multiple servers in parallel for which no queue is allowed [1,3]. The classical model for this type of system is the Erlang loss model which assumes Poisson arrivals and general independent service, where arrivals finding all servers busy dep rt without receiving service. For this model it is well-known that the limiting (stationary) state probabilities satisfy Erlang's formula independent of the form of the service distribution fanctlon [6]. Carter, Chalken and Ignall [1] considered the problem of designing response areas for two emergency service units with the dual objectives of minimizing The average response time to calls for service and equalizing the workload between the two units. Chalken and Ignall [2] derived the theoretical results for the particular queueing model used in [1] to determine the response arejs f >» the emergency units. Specifically, Chalken and Ignall assumei 1 an M/C'2 model with no queue allowed (a two-server Erlang loss system) vhere arrivals have preference for particular servers. There are two arrival classes, j c {1,2}, where the classes form independtnt Poisson streams at rates X and X-, respectively. Class j arrivals choose server j if the system is empty. Service times are independent and identically distri- buted (the same distribution for both classes of arrivals). Under those conditions they derived expru^ions for the stationary probabl 1 ities P.. and PQ., where
7 P.-. Prob (server 1 ib busy, server 2 is free), I' Prob (server 1 Is free, server 2 is busy), and P. 0 +f' «I' Probability that one server is free. This paper generalizes their Jesuits as follows: (1) an arbitrary number of arrival classes is considered; (2) each arrival class is allowed to have its own service distribution function; and (3) server preferences, which still depend on the arrival class, are expressed probabilistically. In addition, the method of proof is simpler. In reference to the original problem of designing response areas for emergency service units, it is reasonable to expect that calls for emergency service from different sections of an urban area will have different dis- tributions for the length of time required to service the calls. Thus, this generalization of the above model would be expected to extend the applica- bility of the basic approach and to improve the accuracy of results. Basic Model and Notation The basic model is that of the M/G/2 queue with no queue allowed. That is, there are two servers, identically distributed exponential interarrival times, and identically distributed service times, where these random variables are mutually independent. Enumerate arrival classes 1,2,..., N where for class j arrivals we define: X = the arrival rate of all j^bs, i.e., the reciprocal of the mean interarrival time, where 0 < >, <», q = the probability an arrival belongs to class j (assumed independent of the interarrival times and the classification N of other jobs), q = 1, j=l * M^^Maa^MaiBMaaiaaiaMaMaHI MMMMHMaMMI
8 . - in M i i [ ^ii X - \q, the rate of j-arrlvals, G. the service distribution of a j-arrival, J S - the service time of a J-arrlval, P(S < t) «C (t), "j "j E(s ], G N " I ^\ G \» t^e 8ervice distribution, J-l 3 ' S - the service time, i.e., a random variable with distribution G. N p - I P.- X E(S), j-l J a the probability that a j-arrlval chooses server ] if the system is empty upon arrival, 1-a the probability that a j-arrlval chooses server 2 if the system Is empty upon arrival, (l,j) state of system, 1-0 means server 1 is free, 1=1 means server 1 is busy, j"0 means server 2 is free, j«l means server 2 is busy, P (t) = Prob (system is in state (i,j) at time t), P stationary probability of system being in state (i,j) * Um P^t). J t-k» if exactly one server is available upon arrival, the arrival is served by that server regardless of the arrival class. Arrivals finding both servers busy depart immediately and are not served. Main Results The main results In this paper are described in the following Theorem For the model described in the previous section.
9 mmmmimmt ÜO 1/( '/2), (1) 'oo l ji,, )". +.2 /2 /(l +.), 'oolj, a-vj-- 2^/"-». 11 P 12 J 00 ' ^ ' independent of the form of the service distributions. To prove the theorem, observe that if arrival preferences and the distinction between servers are ignored, the system can be viewed as an Erlang loss system with two servers, Poisson arrivals at rate i, and identically distributed service times with distribution function C. For this system it is well-known that the stationary probabilities for the number of busy servers satisfy Erlang's formula [6]: P P, = Um P 0 (t) t lim P (t) = 1 /(I + r +. 2 /2), =./(I + c + r /2), lim P 2 (t) t-«0 c 2 2(1 + c +. 2 /2), where P.(t) = Prob (j servers busy at time t), j = 0,1,2. Thus, ''(in = ^n ' ''n = ^2 ' an^ t:^e P ro ' 3 l e,n ^s reduced to finding P.«and P 01. where P^ f P^ = P 1. For the above system with different classes of arrivals and server preferences, one quantity of interest is the proportion of time each server is busy. This quantity is dependent upon the arrival rates, service distributions and server preferences of the arrival classes. Clearly, ii M>^ ^MM i a tmmmmmmmm^jmm
10 -.. ^-^ ^M^ ^ p p + p si UO *11 P P + p 82 K 01 r ll where P. the proportion of time server j is busy, J * 1,2. 8J The approach used in this paper to derive P. 0 and P 0. is based o.i two veil-known facts in queueing theory. First, the proportion of time that a server is busy serving a giveu stream of arrivals is equal to the product of the arrival rate and the expected service time for that arrival stream. This can be viewed as a corollary of L \V [4). Second, the stationary probabilities have a time average interpretation: P the proportion of time the system is in state (i,j) in steady-state. and. In steady-state, the system behavior found by Polsson arrivals is identical with the time average behavior, i.e., the proportion of Poisson arrivals that find the system in state (i,j) is equal to the proportion of time the system spends in state (i,j) [5,6,7]. Similar approaches have been employed to derive other quantities of interest in various types of queues with Poisson arrivals [5,7], The proportion of time server 1 is busy can be divided into the propor- tion of time server 1 is busy serving each of the different classes of arrivals [^). For class j, the proportion of time server 1 is busy equals the product of: (1) the rate of class j arrivals served by server 1, >. say, and (2) the expected class j service time. Thvir, J»i P s i J-l J' 1
11 where \.. is simply \ served by server 1. Therefore, times the proportion of J-arrlvals that are N P s i" A V P OI + YOO )E(S J : " pp 01 + P 00 J, a j c j j"l J J N We also know that p 8 i " p io + p ii ' p i - P 0] + P ll ' Solving for P.., we obtain 'l + P ll " P 00 I P ' p N j' 1 "j^j Substitucioü of the values for P 0 ( p 00) t P,. and P,(P.) from (1) yields P.. in the theorem. From Pin s ^i " P ni we 0^ta^n Pin This concludes the proof. Consideration of Various Extensions For a two server loss system with Poisson arrivals, arrival classes with different server preferences, and service time distributions which depend only on the arrival class (arrival-dependent service times), we obtained simple results which are independent of the form of the arrival class service distributions. Can Erlang's formula be extended further? I..I..H I -1<^^^MM^^^^,M,,,MMr^,MMa,MMMtM atmmmbajm MM^,MM,M^ii,MMig,jMWMMiMMMM^ MMMMJg
12 Certain obvious extensions were investigated: (a) three or more servers, (b) server-dependent service times, and (c) preference-dependent service times, e.g., in the two server pure preference (non-probabilistic) case, the service time distribution depends on whether the arrival is served at the server of first choice. For (a), Erlang's formula will still hold for the distribution of the number of busy servers. Thus, the same approach is feasible; however, there are insufficient equations to solve for all of the state probabilities. In addition, it wa verified that the state probabilities depend on the form of the arrival class strvice distributions. For three servers, numeric?.! silutions for the state probabilities under exponential service were found to be different from those under hyperexponential service. Erlang's formula for the distribution of the number of busy servers does not hold for cases (b) and (c). Also, it was verified that ;.he state probabilities are distribution dependent (again, by comparison of exponential and hyperexponential service distributions). In conclusion, none of the extensions considered in this section are valid, i.e., results do depend on the form of service distributions. This is unfortunate because of numerous applications for these models and other variations on loss systems. Exact results will almost certainly be hard to obtain and will dei end on service distributions in complicated ways. However, in some cases, partial results do hold and are easily obtained.,^m, m^mmammmmmmmammmmmm^mltmam,^^^^^^^^^^mtmmmaa^t^^^^^mm <
13 e.g., for case (a). Furthermore, (limited) numerical experience indicates that dependence on the form of service distributions is small. If this is true, numerical results under exponential service may be good approximations. Of course, it would be desirable to be able to quantify this last assertion..
14 - - ' REFERENCES [1] Carter, ('.. M., Chaiken, J. M. and Ignall, E. (1972) Response areas for two emerrency units. Operat. Res. 20, [2] Chaiken, J. M. and Ignall, E. (1972) An extension of Erlang's formulas which distinguishes individual servers. J. Appl. Prob. 9, [3] Chaiken,.1. M. and Larson, R. C. (1972) Methods for allocating urban emergency units: a survey. Management Sei. 19, P-1.10-I, [4] Little, J. D. C. (1961) A proof of the queuing formula: L = >W. Operat. Res. 9, [5] Stidhara, S. (1972) Regenerative processes in the theory of queues, with applications to the alternating-priority queue. Adv. Appl. Prob. 4, [6] Takäcs, L. (1969) On Erlang's formula. Ann. Math. Statist. 40, [7] Wolff, R. W. (1970) Work-conserving priorities. J. Appl. Prob. 7, ^ ^-^.
.IEEEEEEIIEII. fflllffo. I ll, 7 AO-AO CALIFORNIA UN IV BERKELEY OPERATIONS RESEARCH CENTER FIG 12/1
7 AO-AO95 140 CALIFORNIA UN IV BERKELEY OPERATIONS RESEARCH CENTER FIG 12/1.IEEEEEEIIEII AVAILABILITY OF SERIES SYSTEMS WITH COMPONENTS SUBJECT TO VARIO--ETC(U) JUN 80 Z S KHALIL AFOSR-77-3179 UNCLASSIFIED
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
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 informationMi] AD-A ON THE DEFLECTION OF PROJECTILES DUE TO ROTATION OF THE EARTH. G. Preston Burns
; '" ' - - " ''T^^^imi^mrrf^'yf^^vfr^'.«*... AD-A010 816 ON THE DEFLECTION OF PROJECTILES DUE TO ROTATION OF THE EARTH G. Preston Burns Naval Surface Weapons Center Dahlgren Laboratory, Virginia June 1975
More informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
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 informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
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 informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
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 informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More informationOperations Research, Vol. 30, No. 2. (Mar. - Apr., 1982), pp
Ronald W. Wolff Operations Research, Vol. 30, No. 2. (Mar. - Apr., 1982), pp. 223-231. Stable URL: http://links.jstor.org/sici?sici=0030-364x%28198203%2f04%2930%3a2%3c223%3apasta%3e2.0.co%3b2-o Operations
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
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 informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
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 informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
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 informationA STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING. J. Carroll* Md Robert Smith. University of North Carolina at Chapel Hill.
A STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING THE LARGEST OF THREE NORMAL t4eans Ra~nond by J. Carroll* Md Robert Smith University of North Carolina at Chapel Hill -e Abstract We study the problem of
More informationA MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979
A MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS BY LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979 PREPARED UNDER GRANT DAAG29-77-G-0031 FOR THE U.S. ARMY RESEARCH OFFICE Reproduction
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour Bin Hu Saif Benjaafar Department of Operations and Management Science, Ross School of Business, University of Michigan at Ann Arbor,
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
More informationA0A TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI
AA113 878 TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI APR 82 S FANG. 8 CHEN..J M WHITE N14-75-C-922 UNCLASSIFIED NL OFFICE OF
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationChapter 5: Special Types of Queuing Models
Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.
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 informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationRELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST
J. Appl. Prob. 45, 568 574 (28) Printed in England Applied Probability Trust 28 RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST EROL A. PEKÖZ, Boston University SHELDON
More informationLECTURE #6 BIRTH-DEATH PROCESS
LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death
More informationTHE COVARIANCE MATRIX OF NORMAL ORDER STATISTICS. BY C. S. DAVIS and M. A. STEPHENS TECHNICAL REPORT NO. 14 FEBRUARY 21, 1978
THE COVARIANCE MATRIX OF NORMAL ORDER STATISTICS BY C. S. DAVIS and M. A. STEPHENS TECHNICAL REPORT NO. 14 FEBRUARY 21, 1978 PREPARED UNDER GRANT DAAG29-77-G-0031 FOR THE U.S. ARMY RESEARCH OFFICE Reproduction
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 informationTHIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji
THIELE CENTRE for applied mathematics in natural science The M/M/1 queue with inventory, lost sale and general lead times Mohammad Saffari, Søren Asmussen and Rasoul Haji Research Report No. 11 September
More informationIntroduction to Queuing Theory. Mathematical Modelling
Queuing Theory, COMPSCI 742 S2C, 2014 p. 1/23 Introduction to Queuing Theory and Mathematical Modelling Computer Science 742 S2C, 2014 Nevil Brownlee, with acknowledgements to Peter Fenwick, Ulrich Speidel
More informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationHITTING TIME IN AN ERLANG LOSS SYSTEM
Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationSTABILITY OF MULTICLASS QUEUEING NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING
Applied Probability Trust (7 May 2015) STABILITY OF MULTICLASS QUEUEING NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING RAMTIN PEDARSANI and JEAN WALRAND, University of California,
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationKnü. ADOAOll 835 ON PACKING SQUARES WITH EQUAL SQUARES. P. Erdos, et al. Stanford University. Prepared for:
ADOAOll 835 ON PACKING SQUARES WITH EQUAL SQUARES P. Erdos, et al Stanford University Prepared for: National Science Foundation Office of Naval Research March 1975 DISTRIBUTED BY: Knü National Technical
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationIW IIIIL2 5-_6. -, ~IIIl IIII'nll MICROCOPY RESOLUTION TEST CHART NAI IONAL BUIREAU O( STANDARDS 1963 A
-R177 486 EXTREME VALUES OF QUEUES POINT PROCESSES AND STOCHASTIC I/i WETUORKSCU) GEORGIA INST OF TECH ATLANTA SCHOOL OF INDUSTRIAL AND SYSTEMS ENGINEERING R F SERFOZO 7UNCLASSIFIED 39 NOV 86 IEEE'.'.
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
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 informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationState-dependent and Energy-aware Control of Server Farm
State-dependent and Energy-aware Control of Server Farm Esa Hyytiä, Rhonda Righter and Samuli Aalto Aalto University, Finland UC Berkeley, USA First European Conference on Queueing Theory ECQT 2014 First
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
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 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 informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
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 informationDISTRIBUTED BY: mh. National Technical Information Service U. S. DEPARTMENT OF COMMERCE 5285 Port Royal Road. Springfield Va.
" ^ AD-766 096 STATISTICAL ESTIMATION OF THE COEFFI CIENT OF PAIRWISE COMPATIBILITY FOR MENU ITEMS Joseph L. Balintfy, et al Massachusetts University Pre pare d for: Office of Naval Research August 1973
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationMassachusetts Institute of Technology
.203J/6.28J/3.665J/5.073J/6.76J/ESD.26J Quiz Solutions (a)(i) Without loss of generality we can pin down X at any fixed point. X 2 is still uniformly distributed over the square. Assuming that the police
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationλ 2 1 = 2 = 2 2 2P 1 =4P 2 P 0 + P 1 + P 2 =1 P 0 =, P 1 =, P 2 = ρ 1 = P 1 + P 2 =, ρ 2 = P 1 + P 2 =
Urban Operations Research Compiled by James S. Kang Fall 001 Quiz Solutions 1//001 Problem 1 (Larson, 001) 1 (a) One is tempted to say yes by setting ρ = Nµ = =.But = is not the rate at which customers
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 informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationYORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)
YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print)
More informationLIMITS AND APPROXIMATIONS FOR THE M/G/1 LIFO WAITING-TIME DISTRIBUTION
LIMITS AND APPROXIMATIONS FOR THE M/G/1 LIFO WAITING-TIME DISTRIBUTION by Joseph Abate 1 and Ward Whitt 2 April 15, 1996 Revision: January 2, 1997 Operations Research Letters 20 (1997) 199 206 1 900 Hammond
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
More informationBulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1
Advanced Markovian queues Bulk input queue M [X] /M/ Bulk service queue M/M [Y] / Erlangian queue M/E k / Bulk input queue M [X] /M/ Batch arrival, Poisson process, arrival rate λ number of customers in
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 informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationSystem with a Server Subject to Breakdowns
Applied Mathematical Sciences Vol. 7 213 no. 11 539 55 On Two Modifications of E 2 /E 2 /1/m Queueing System with a Server Subject to Breakdowns Michal Dorda VSB - Technical University of Ostrava Faculty
More informationON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
Journal of the Operations Research Society of Japan Vol. 29, No. 3, September 1986 1986 The Operations Research Society of Japan ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE J. George Shanthikumar University
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
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 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 informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationSYMBOLS AND ABBREVIATIONS
APPENDIX A SYMBOLS AND ABBREVIATIONS This appendix contains definitions of common symbols and abbreviations used frequently and consistently throughout the text. Symbols that are used only occasionally
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationIrreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1
Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More informationZero-Inventory Conditions For a Two-Part-Type Make-to-Stock Production System
Zero-Inventory Conditions For a Two-Part-Type Make-to-Stock Production System MichaelH.Veatch Francis de Véricourt October 9, 2002 Abstract We consider the dynamic scheduling of a two-part-type make-tostock
More informationTHE INTERCHANGEABILITY OF./M/1 QUEUES IN SERIES. 1. Introduction
THE INTERCHANGEABILITY OF./M/1 QUEUES IN SERIES J. Appl. Prob. 16, 690-695 (1979) Printed in Israel? Applied Probability Trust 1979 RICHARD R. WEBER,* University of Cambridge Abstract A series of queues
More informationOPTIMAL CONTROL OF A FLEXIBLE SERVER
Adv. Appl. Prob. 36, 139 170 (2004) Printed in Northern Ireland Applied Probability Trust 2004 OPTIMAL CONTROL OF A FLEXIBLE SERVER HYUN-SOO AHN, University of California, Berkeley IZAK DUENYAS, University
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 informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationNetworks of Queues Models with Several. Classes of Customers and Exponential. Service Times
Applied Mathematical Sciences, Vol. 9, 2015, no. 76, 3789-3796 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.53287 Networks of Queues Models with Several Classes of Customers and Exponential
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 informationUN MADISON MATHEMSTICS RESEARCH CENTER A P SUMS UNCLASSIFIE FER4 MONSRR2648 DAAG29-0C04 RDr C91 04
7 AD-A141 509 A NOTE ON EQUALT IN ANDERSON'S THEOREM(UA WISCONSIN 1/1 UN MADISON MATHEMSTICS RESEARCH CENTER A P SUMS UNCLASSIFIE FER4 MONSRR2648 DAAG29-0C04 RDr C91 04 ANA FS 7 1 3 III8 1.2. IlI.25iiI.
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More information