Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1
|
|
- Daniel Baker
- 6 years ago
- Views:
Transcription
1 Waiting Line Models: Queuing Theory Basics Cuantitativos M. En C. Eduardo Bustos Farias 1
2 Agenda Queuing system structure Performance measures Components of queuing systems Arrival process Service process M/M/1 Queue M/M/s (M/M/k) Queue Economic analysis of waiting lines Waiting line models extensions Summary Cuantitativos M. En C. Eduardo Bustos Farias 2
3 When you are in queue? In the bank, restaurant, supermarket In front of restroom during the break of football game How much is your patience? Waiting costs your patience and your temper and it also costs the business. Time = For the business, they have to find the optimal service level that keeps customers happy and makes them profitable. Cuantitativos M. En C. Eduardo Bustos Farias 3
4 INTRODUCTION Queuing models are everywhere. For example, airplanes queue up in holding patterns, waiting for a runway so they can land. Then, they line up again to take off. People line up for tickets, to buy groceries, etc. Jobs line up for machines, orders line up to be filled, and so on. A. K. Erlang (a Danish engineer) is credited with founding queuing theory by studying telephone switchboards in Copenhagen for the Danish Telephone Company. Many of the queuing results used today were developed by Erlang. Cuantitativos M. En C. Eduardo Bustos Farias 4
5 A queuing model is one in which you have a sequence of times (such as people) arriving at a facility for service, as shown below: Arrivals Service Facility Consider St. Luke s s Hospital in Philadelphia and the following three queuing models. Model 1: St. Luke s s Hematology Lab St. Luke s treats a large number of patients on an outpatient basis (i.e., not admitted to the hospital). Outpatients plus those admitted to the 600-bed hospital produce a large flow of new patients each day. Cuantitativos M. En C. Eduardo Bustos Farias 5
6 Most new patients must visit the hematology laboratory as part of the diagnostic process. Each such patient has to be seen by a technician. After seeing a doctor, the patient arrives at the laboratory and checks in with a clerk. Patients are assigned on a first-come, first-served served basis to test rooms as they become available. The technician assigned to that room performs the tests ordered by the doctor. When the testing is complete, the patient goes on to the next step in the process and the technician sees a new patient. We must decide how many technicians to hire. Cuantitativos M. En C. Eduardo Bustos Farias 6
7 Model 2: Buying WATS Lines As part of its remodeling process, St. Luke s s is designing a new communications system which will include WATS lines. WATS (Wide Area Telephone Service) is an acronym for a special flat-rate, long distance service offered by some phone companies. When all the phone lines allocated to WATS are in use, the person dialing out will get a busy signal, indicating that the call can t t be completed. We must decide how many WATS lines the hospital should buy so that a minimum of busy signals will be encountered. Cuantitativos M. En C. Eduardo Bustos Farias 7
8 Model 3: Hiring Repairpeople St. Luke s s hires repairpeople to maintain 20 individual pieces of electronic equipment. The equipment includes measuring devices such as electrocardiogram machines small dedicated computers CAT scanner other equipment If a piece of equipment fails and all the repairpeople are occupied, it must wait to be repaired. We must decide how many repairpeople to hire and balance their cost against the cost of having broken equipment. Cuantitativos M. En C. Eduardo Bustos Farias 8
9 All three of these models fit the general description of a queuing model as described below: PROBLEM ARRIVALS SERVICE FACILITY 1 Patients Technicians 2 Telephone Calls Switchboard 3 Broken Equipment Repairpeople These models will be resolved by using a combination of analytic and simulation models. To begin, let s s start with the basic queuing model. Cuantitativos M. En C. Eduardo Bustos Farias 9
10 Queuing Systems customers Single Channel Waiting Line System arrival... channel (server) departure waiting line (queue) system server 1 Multi-Channel Waiting Line System arrival... server 2. departure server k system Cuantitativos M. En C. Eduardo Bustos Farias 10
11 Waiting Line Examples Situation Arrivals Servers Service Process Bank Customers Teller Deposit etc. Doctor s Patient Doctor Treatment office Traffic Cars Light Controlled intersection passage Assembly line Parts Workers Assembly Tool crib Workers Clerks Check out/in tools Cuantitativos M. En C. Eduardo Bustos Farias 11
12 THE BASIC MODEL Consider the Xerox machine located in the fourth- floor secretarial service suite. Assume that users arrive at the machine and form a single line. Each arrival in turn uses the machine to perform a specific task which varies from obtaining a copy of a 1-page letter to producing 100 copies of a 25-page report. This system is called a single-server server (or single- channel) ) queue. Cuantitativos M. En C. Eduardo Bustos Farias 12
13 Questions about this or any other queuing system center on four quantities: 1. The number of people in the system (those being served and waiting in line). 2. The number of people in the queue (waiting for service). 3. The waiting time in the system (the interval between when an individual enters the system and when he or she leaves the system). 4. The waiting time in the queue (the time between entering the system and the beginning of service). Cuantitativos M. En C. Eduardo Bustos Farias 13
14 ASSUMPTIONS OF THE BASIC MODEL 1. Arrival Process. Each arrival will be called a job. job. The interarrival time (the time between arrivals) is not known. Therefore, the exponential probability distribution (or negative exponential distribution) ) will be used to describe the interarrival times for the basic model. The exponential distribution is completely specified by one parameter, λ,, the mean arrival rate (i.e., how many jobs arrive on the average during a specified time period). Cuantitativos M. En C. Eduardo Bustos Farias 14
15 Mean interarrival time is the average time between two arrivals. Thus, for the exponential distribution Avg. time between jobs = mean interarrival time = 1 λ Thus, if λ = mean interarrival time = = = 20 λ Service Process. In the basic model, the time that it takes to complete a job (the service time) ) is also treated with the exponential distribution. The parameter for this exponential distribution is called µ (the mean service rate in jobs per minute). Cuantitativos M. En C. Eduardo Bustos Farias 15
16 µt is the number of jobs that would be served (on the average) during a period of T minutes if the machine were busy during that time. The mean or average, service time (the average time to complete a job) is Avg. service time = 1 µ Thus, if µ = mean service time = = = 10 µ Queue Size. There is no limit on the number of jobs that can wait in the queue (an infinite queue length). Cuantitativos M. En C. Eduardo Bustos Farias 16
17 4. Queue Discipline. Jobs are served on a first- come, first-serve serve basis (i.e., in the same order as they arrive at the queue). 5. Time Horizon. The system operates as described continuously over an infinite horizon. 6. Source Population. There is an infinite population available to arrive. Cuantitativos M. En C. Eduardo Bustos Farias 17
18 QUEUE DISCIPLINE In addition to the arrival distribution, service distribution and number of servers, the queue discipline must also be specified to define a queuing system. So far, we have always assumed that arrivals were served on a first-come, first-serve serve basis (often called FIFO, for first-in, in, first-out out ). However, this may not always be the case. For example, in an elevator, the last person in is often the first out (LIFO). Adding the possibility of selecting a good queue discipline makes the queuing models more complicated. These Cuantitativos models are referred M. En C. Eduardo to as Bustoscheduling Farias models. 18
19 Various Type of Queues Single Channel/Single Phase Multi-channel/Single Phase Single Channel/Multi-phase Queuing Network Cuantitativos M. En C. Eduardo Bustos Farias 19
20 Queuing System Structure Population Source - Finite - Infinite Exit 1. Return to service population 2. Do not return to service population arrival Server departure Arrival characteristic 1. Size of units - Single - Batch 2. Arrival rate - Constant - Probabilistic 3. Degree of patience - Patient - Impatient Features of lines 1. Length - Infinite capacity - Limited capacity 2. Number - Single - Multiple 3. Queue discipline -FIFO - Priorities Service facility 1. Structure 2. Service rate - Constant - Probabilistic - random services - State-dependent service time Cuantitativos M. En C. Eduardo Bustos Farias 20
21 Deciding on the Optimum Level of Service Cost Total expected cost Minimum total cost Cost of providing service Low level of service Optimal service level Negative Cost of waiting time to company High level of service Cuantitativos M. En C. Eduardo Bustos Farias 21
22 Performance Measures P 0 = Probability that there are no customers in the system P n = Probability that there are n customers in the system L S = Average number of customers in the system L Q = Average number of customers in the queue W S = Average time a customer spends in the system W Q = Average time a customer spends in the queue P w = Probability that an arriving customer must wait for service ρ = Utilization rate of each server (the percentage of time that each server is busy) Cuantitativos M. En C. Eduardo Bustos Farias 22
23 Arrival Process Very large population of potential customers behave independently in any time instant, at most one arrives arrive at intervals of average duration 1/λ Important X: # of customer arrivals within time interval of length t Pr(X=n) = ( λt ) n λt e n! λ = the mean arrival rate per time unit t = the length of the time interval e = (the base of the natural logarithm) n! = n(n 1)(n 2) (n 3) (3)(2)(1) X follows Poisson Distribution(λt) Mean = λt Variance = λt λ = arrival rate = # of arrivals per unit of time Important t should be expressed in the same time unit as λ Cuantitativos M. En C. Eduardo Bustos Farias 23
24 Examples of Poisson Distribution p(x) Poisson distribution with parameter 1/ x p(x) 0.4 Poisson distribution with parameter x p(x) 0.2 Poisson distribution with parameter Cuantitativos 0 1 M. 2En C. Eduardo 3 Bustos Farias 4 5 x 24
25 Service Process Assume service time is exponentially distributed(µ) P.D.F. f(t) = µe -µt Pr(Service t) = 1 e -µt Mean = 1/µ Variance = 1/µ 2 Important µ= service rate = # of customers served per unit time Properties of exponential distribution 1. Memoryless (The conditional probability is the same as the unconditional probability.) 2. Most customers require short services; few require long service 3. If arrival process follows Possion (λ), then inter-arrival time follows exponential(λ) Important Cuantitativos M. En C. Eduardo Bustos Farias 25
26 Examples of Exponential Distribution Cuantitativos M. En C. Eduardo Bustos Farias 26
27 Queuing Theory Notation A standard notation is used in queuing theory to denote the type of system we are dealing with. Typical examples are: M/M/1 M/G/1 D/G/n Servers E/G/ Servers Poisson Input/Poisson Server/1 Server Poisson Input/General Server/1 Server Deterministic Input/General Server/n Erlangian Input/General Server/Inf. The first letter indicates the input process, the second letter is the server process and the number is the number of servers. (M = Memoryless = Poisson) Cuantitativos M. En C. Eduardo Bustos Farias 27
28 Terminology λ = Arrival rate = 1/ Mean arrival interval µ = Service rate = 1/ Mean service time ρ = λ/ µ k = # of Servers Performance measures P 0 = Probability that there are no customers in the system P n = Probability that there are n customers in the system L S = Average number of customers in the system L Q = Average number of customers in the queue W S = Average time a customer spends in the system W Q = Average time a customer spends in the queue P w = Probability that an arriving customer must wait for service ρ = Utilization rate of each server (the percentage of time that each server is busy) Cuantitativos M. En C. Eduardo Bustos Farias 28
29 Single Server Case Poisson arrivals, exponential service rate, no priorities, no balking, steady state) λ λ λ λ ONLY IF µ µ µ µ Steady state exists! STATE ENTRY RATE LEAVING RATE 0 λp 0 µp 1 1 λp 0 + µp 2 (λ + µ)p 1 2 λp 1 + µp 3 (λ + µ)p 2 3 λp 2 + µp : : 4 : (λ + µ)p 3 : : : P n = (λ/µ) n P 0 = ρ n P 0 for n = 1,2,3,... λ< µ or λ/µ = ρ <1 1 = n = 0 n P = ρ 0 = 1 ρ n = 0 P n P 0 if ρ < 1 Cuantitativos M. En C. Eduardo Bustos Farias 29
30 Single Server Case P 0 = 1 ρ P n = ρ n (1 ρ) L S = E[N] where N = no. of customers in system (denote S) = = ρ /(1 ρ) L Q = E[N q ] where N q = no. of customers in queue (denote Q) = = 0 n n = 0 = ρ 2 /(1 ρ) W S = L S / λ W Q = L Q / λ np n ( n 1) P n Little s Law L S = λ W S L Q = λ W Q Cuantitativos M. En C. Eduardo Bustos Farias 30
31 Single Server Queue Performance (M/M/1) P 0 = 1 λ/µ P n = (λ/µ) n P 0 L Q = 2 λ µ = 2 ρ ( µ λ) 1 ρ L S W Q = L Q + λ/µ = L Q + ρ = ρ/(1 ρ) = L Q / λ W S = W Q + 1/µ P w = 1 P 0 = ρ Cuantitativos M. En C. Eduardo Bustos Farias 31
32 The Schips, Inc. Truck Dock Problem Schips, Inc. is a large department store chain that has six branch stores located throughout the city. The company s Western Hills store, which was built some years ago, has recently been experiencing some problems in its receiving and shipping department because of the substantial growth in the branch s sales volume. Unfortunately, the store s truck dock was designed to handle only one truck at a time, and the branch s increased business volume has led to a bottleneck in the truck dock area. At times, the branch manager has observed as many as five Schips trucks waiting to be loaded or unloaded. As a result, the manager would like to consider various alternatives for improving the operation of the truck dock and reducing the truck waiting times. Cuantitativos M. En C. Eduardo Bustos Farias 32
33 The Schips, Inc. Truck Dock Problem One alternative the manager is considering is to speed up the loading/unloading operation by installing a conveyor system at the truck dock. As another alternative, the manager is considering adding a second truck dock so that two trucks could be loaded and/or unloaded simultaneously. What should the manager do to improve the operation of the truck dock? While the alternatives being considered should reduce the truck waiting times, they may also increase the cost of operating the dock. Thus the manager will want to know how each alternative will affect both the waiting times and the cost of operating the dock before making a final decision Truck arrival information: truck arrivals occur at an average rate of three trucks per hour. Service information: the truck dock can service an average of four trucks per hour. Cuantitativos M. En C. Eduardo Bustos Farias 33
34 The Schips, Inc. Truck Dock Problem Options: 1. Using conveyor to speed up service rate 2. Add another dock server Assumptions: The waiting cost is linear Poisson Arrivals Exponential service time Cuantitativos M. En C. Eduardo Bustos Farias 34
35 Schips, Inc. - Current Situation Cuantitativos M. En C. Eduardo Bustos Farias 35
36 Schips, Inc. - Alternative I Alternative I: Speed up the loading/unloading operations by installing a conveyor system (costs of different conveyer system are not provided here, but you should consider it when you evaluate the total cost) Cuantitativos M. En C. Eduardo Bustos Farias 36
37 M/M/k Queue Multiple server, single queue (Poisson arrivals, I.I.D. exponential service rate, no priority, no balking, steady state) Server 1 Arrival λ Server 2 Departure kµ ONLY IF λ< kµ or λ / kµ = ρ <1 Steady state exists! Server k Cuantitativos M. En C. Eduardo Bustos Farias 37
38 M/M/k Queue Performance Measures Cuantitativos M. En C. Eduardo Bustos Farias 38
39 The Schips, Inc. Problem Alternative II: k = 2 (continued) Alternative I P 0 = L Q = L S = W Q = W S = P w = Cuantitativos M. En C. Eduardo Bustos Farias 39
40 Economic Analysis of Queuing System Cost of waiting vs. Cost of capacity COST TOTAL CAPACITY WAITING CAPACITY Cuantitativos M. En C. Eduardo Bustos Farias 40
41 The Schips, Inc. Problem (Cost analysis, FYI) c W = Hourly waiting cost for each customer c Server = Hourly cost for each server Total waiting cost/hour = c W L L S = Average number of customers in system Total server cost/hour = c Server k k = Number of servers Total cost per hour = c W L+ c Server k Total Hourly Cost Summary for The Schips Truck Dock Problem c W = $25/hour, c Server = $30/hour Incremental cost of using conveyor: $20/hour for every µ = 2 System µ Avg. # of Trucks in Total Cost/Hour c W L + c S k system (L) 1-server 4 3 (25)(3)+(30)(1)=$105 1-server 6 1 (25)(1) +(30+20)(1) = $75 +conveyor 1-server (25)(0.6) + (30+40)(1) = $85 +conveyor 1-server +conveyor (25)(0.43) + (30+60)(1) = $ server (25)(0.873) + (30)(2) = $81.83 Cuantitativos M. En C. Eduardo Bustos Farias 41
42 Discrete distribution Suppose the bank has only one server, the interarrival and service rate are both discrete Interarrival distribution Service time distribution distribution. This bank wants to simulate for 150 customers arrival. Value Prob Value Prob Cum. Prob Cum. Prob. 1 This bank wants to know the queuing length and waiting time of their current service. Cuantitativos M. En C. Eduardo Bustos Farias 42
43 Discrete distribution Single server queueing simulation (starting empty and idle) Server work Number in queue Customer IA_Time Arrival_Time Service_Time Queue_Time Start_Time Depart_Time Before entry After entry Before entry After entry Waiting Times in Queue 4.5 Queue Length Versus Time (Shown only at times just after arrivals) Customer Customer Arrival Times Cuantitativos M. En C. Eduardo Bustos Farias 43
44 Discrete distribution If the arrival rate keeps the same, but the service rate is faster Service time distribution Value Prob Cum. Prob Waiting Times in Queue-Faster Service Rate Customer Queue Length Versus Time- Faster Service (Shown only at times just after arrivals) Customer Arrival Times Cuantitativos M. En C. Eduardo Bustos Farias 44
45 Discrete distribution : L5-QSim2-3servers If the bank has more frequent arrival, they definitely need more servers. Now they have 3 servers. Interarrival distribution Service time distribution Value Prob Value Prob Cuantitativos M. En C. Eduardo Bustos Farias 45
46 Discrete distribution : L5-QSim2-3servers (con t) The waiting time and queuing length with 3 servers 4.5 Waiting Times in Queue-3 servers Queue Length Versus Time- 3 servers (Shown only at times just after arrivals) Customer Customer Arrival Times If you change to 2 servers, then. Waiting Times in Queue-2 servers Queue Length Versus Time- 2 servers (Shown only at times just after arrivals) Customer Customer Arrival Times Cuantitativos M. En C. Eduardo Bustos Farias 46
47 Waiting Line Models Extensions Notation for Classifying Waiting Line Models Code indicating arrival distribution Code indicating service time distribution Number of parallel servers others M = Designates a Poisson probability distribution for the arrivals or an exponential probability distribution for service time D = Designates that the arrivals or the service time is deterministic or constant G = Designates that the arrivals or the service time has a general probability distribution with a known mean and variance Cuantitativos M. En C. Eduardo Bustos Farias 47
48 Waiting Line Models Extensions Notation for Classifying Waiting Line Models Code indicating arrival distribution Code indicating service time distribution Number of parallel servers others M/M/1 M/M/k M/G/1 (M/D/1 is a special case, D for deterministic service time) G/M/1 And more. G/G/1 G/G/k Cuantitativos M. En C. Eduardo Bustos Farias 48
49 M/G/1 Queue Performance Measures M/G/1 System: Steady state results (λ<µ) P 0 = 1 ρ (ρ = λ/µ) L Q = 2 2 λ σ + ρ 2(1 ρ ) 2 L S W Q = L Q + λ/µ = L Q + ρ = L Q / λ W S = W Q + 1/µ P w = 1 P 0 = ρ µ = service rate 1/ µ = mean service time σ 2 = variance of service time distribution M/D/1 Queue: σ 2 = 0 2 ρ L Q = 2 (1 ρ ) Cuantitativos M. En C. Eduardo Bustos Farias 49
50 An Example: Secretary Hiring Suppose you must hire a secretary and you have to select one of two candidates. Secretary 1 is very consistent, typing any document in exactly 15 minutes. Secretary 2 is somewhat faster, with an average of 14 minutes per document, but with times varying according to the exponential distribution. The workload in the office is 3 documents per hour, with interarrival times varying according to the exponential distribution. Which secretary will give you shorter turnaround times on documents? Cuantitativos M. En C. Eduardo Bustos Farias 50
51 Secretary Hiring - Queuing Model Cuantitativos M. En C. Eduardo Bustos Farias 51
52 M/M/s with Finite Population The number of customers in the system is not permitted to exceed some specified number Example: Machine maintenance problem Cuantitativos M. En C. Eduardo Bustos Farias 52
53 M/M/s with Limited Waiting Room Arrivals are turned away when the number waiting in the queue reaches a maximum level Example: Walk-in Dr.s office with limited waiting space Cuantitativos M. En C. Eduardo Bustos Farias 53
54 Remember: λ & µ Are Rates λ = Mean number of arrivals per time period e.g., 3 units/hour µ = Mean number of people or items served per time period e.g., 4 units/hour 1/µ = 15 minutes/unit If average service time is 15 minutes, then µ is 4 customers/hour T/Maker Co. Cuantitativos M. En C. Eduardo Bustos Farias 54
55 Summary Queuing system design has an important impact on the service provided by an enterprise Steady state performance measures can provide useful information in assessing service and developing optimal queuing systems The general procedure of solving a queuing problem: Identify Queue Type Estimate Arrival & Service Processes Calculate Performance Measures Conduct Economic Analysis Many queuing systems do not have closed-form solutions. Simulation is a powerful tool of analyzing those systems. Cuantitativos M. En C. Eduardo Bustos Farias 55
Queuing 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 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 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 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 informationQueuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More informationQueuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.
Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationQueueing Theory (Part 4)
Queueing Theory (Part 4) Nonexponential Queueing Systems and Economic Analysis Queueing Theory-1 Queueing Models with Nonexponential Distributions M/G/1 Model Poisson input process, general service time
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationClassification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
More informationIOE 202: lectures 11 and 12 outline
IOE 202: lectures 11 and 12 outline Announcements Last time... Queueing models intro Performance characteristics of a queueing system Steady state analysis of an M/M/1 queueing system Other queueing systems,
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 informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
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 informationChapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.
Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.
More informationReview of Queuing Models
Review of Queuing Models Recitation, Apr. 1st Guillaume Roels 15.763J Manufacturing System and Supply Chain Design http://michael.toren.net/slides/ipqueue/slide001.html 2005 Guillaume Roels Outline Overview,
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
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 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 informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
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 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 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 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 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 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 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 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 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 informationQueuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if
1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example
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 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 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 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 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 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 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 informationInternational Journal of Pure and Applied Mathematics Volume 28 No ,
International Journal of Pure and Applied Mathematics Volume 28 No. 1 2006, 101-115 OPTIMAL PERFORMANCE ANALYSIS OF AN M/M/1/N QUEUE SYSTEM WITH BALKING, RENEGING AND SERVER VACATION Dequan Yue 1, Yan
More informationAll models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf
PART II (3) Continuous Time Markov Chains : Theory and Examples -Pure Birth Process with Constant Rates -Pure Death Process -More on Birth-and-Death Process -Statistical Equilibrium (4) Introduction to
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 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 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 informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationAnalysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations Yan Zhang 1 Dequan Yue 1 Wuyi Yue 2 1 College of Science, Yanshan University, Qinhuangdao 066004 PRChina 2 Department of Information
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationQueuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015
Queuing Theory Fatih Cavdur fatihcavdur@uludag.edu.tr April 27, 2015 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical model is the single-server
More informationName of the Student: Problems on Discrete & Continuous R.Vs
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Additional Problems MATERIAL CODE : JM08AM1004 REGULATION : R2013 UPDATED ON : March 2015 (Scan the above Q.R code for
More informationPROBABILITY & QUEUING THEORY Important Problems. a) Find K. b) Evaluate P ( X < > < <. 1 >, find the minimum value of C. 2 ( )
PROBABILITY & QUEUING THEORY Important Problems Unit I (Random Variables) Problems on Discrete & Continuous R.Vs ) A random variable X has the following probability function: X 0 2 3 4 5 6 7 P(X) 0 K 2K
More informationBasic Queueing Theory
After The Race The Boston Marathon is a local institution with over a century of history and tradition. The race is run on Patriot s Day, starting on the Hopkinton green and ending at the Prudential Center
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
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 informationName of the Student: Problems on Discrete & Continuous R.Vs
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : Problem Material MATERIAL CODE : JM08AM1008 (Scan the above Q.R code for the direct download of this material) Name of
More informationCourse Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design
Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and
More informationName of the Student:
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct
More informationλ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These
Queuing theory models systems with servers and clients (presumably waiting in queues). Notation: there are many standard symbols like λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These represent the actual
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 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 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 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 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 informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
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 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 informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
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 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 informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION 2013-201 MH702/MAS6/MTH37 Probabilistic Methods in OR December 2013 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains
More informationISyE 2030 Practice Test 2
1 NAME ISyE 2030 Practice Test 2 Summer 2005 This test is open notes, open books. You have exactly 75 minutes. 1. Short-Answer Questions (a) TRUE or FALSE? If arrivals occur according to a Poisson process
More informationEngineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)
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 informationQuiz Queue II. III. ( ) ( ) =1.3333
Quiz Queue UMJ, a mail-order company, receives calls to place orders at an average of 7.5 minutes intervals. UMJ hires one operator and can handle each call in about every 5 minutes on average. The inter-arrival
More information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More informationRichard C. Larson. March 5, Photo courtesy of Johnathan Boeke.
ESD.86 Markov Processes and their Application to Queueing Richard C. Larson March 5, 2007 Photo courtesy of Johnathan Boeke. http://www.flickr.com/photos/boeke/134030512/ Outline Spatial Poisson Processes,
More informationOne billion+ terminals in voice network alone
Traffic Engineering Traffic Engineering One billion+ terminals in voice networ alone Plus data, video, fax, finance, etc. Imagine all users want service simultaneously its not even nearly possible (despite
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 informationMONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL
Volume 117 No. 13 2017, 271-282 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN
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 informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationCE351 Transportation Systems: Planning and Design
CE351 Transportation Systems: Planning and Design TOPIC: Level of Service (LOS) at Traffic Signals 1 Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement
More informationI, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.
A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu
More informationWaiting Time Analysis of A Single Server Queue in an Out- Patient Clinic
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Lent Term 2010/11 R. J. Gibbens Problem sheet William Gates Building 15 JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationMultiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users? z The protocols we used to solve this multiaccess problem are
More informationQueueTraffic and queuing theory
QueueTraffic and queuing theory + Queues in everyday life You have certainly been in a queue somewhere. Where? How were they different? At ticket vending machines, cash desks, at the doctors, at printers,
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
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 informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
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 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 informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationCPSC 531 Systems Modeling and Simulation FINAL EXAM
CPSC 531 Systems Modeling and Simulation FINAL EXAM Department of Computer Science University of Calgary Professor: Carey Williamson December 21, 2017 This is a CLOSED BOOK exam. Textbooks, notes, laptops,
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationPerformance Modelling of Computer Systems
Performance Modelling of Computer Systems Mirco Tribastone Institut für Informatik Ludwig-Maximilians-Universität München Fundamentals of Queueing Theory Tribastone (IFI LMU) Performance Modelling of Computer
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 informationOperations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:
Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam 1 2 3 4 5 6 7 8 9 10 7 questions. 1. [5+5] Let X and Y be independent exponential random variables where X has
More information