# Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Queuing Theory Queuing Theory Queuing theory is the mathematics of waiting lines. It is extremely useful in predicting and evaluating system performance. Queuing theory has been used for operations research. Traditional queuing theory problems refer to customers visiting a store, analogous to requests arriving at a device. Long Term Averages Queuing theory provides long term average values. It does not predict when the next event will occur. Input data should be measured over an extended period of time. We assume arrival times and service times are random. Assumptions Independent arrivals Exponential distributions Customers do not leave or change queues. Large queues do not discourage customers. Many assumptions are not always true, but queuing theory gives good results anyway Queuing Model Q W Tw S Interesting Values Arrival rate () the average rate at which customers arrive. Service time (s) the average time required to service one customer. Number waiting (W) the average number of customers waiting. Number in the system (Q) the average total number of customers in the system. Tq

2 More Interesting Values Time in the system (Tq) the average time each customer is in the system, both waiting and being serviced. Time waiting (Tw) the average time each customer waits in the queue. Tq = Tw + s Arrival Rate The arrival rate,, is the average rate new customers arrive measured in arrivals per time period. Common units are access/second The inter-arrival time, a, is the average time between customer arrivals. It is measured in time per customer. A common unit would be seconds/access. a = 1 / Random Values We assume that most of the events we are interested in occur randomly. Time of a request to a device Time to service a request Time user makes a request Although events are random, we may know the average value of the times and their distribution. If you flip a coin, you will get heads 5% of the time. Exponential Distribution Many of the random values are exponentially distributed. Frequency of Occurrence = e -t There are many small values and a few large values. The inter-arrival time of customers is naturally exponentially distributed. Exponential Distribution Poisson Arrival Rate If customers are arriving at the exponentially distributed rate, then the probability that there will be k customers after time t is: P ( t) = k ( t) k! k t e

3 Math Notes! = 1! = 1 X = 1 Poisson Example A networked printer usually gets 15 print jobs every hour. The printer has to be turned off for 1 minutes for maintenance. What is the probability that nobody will want to use the printer during that time? X 1 = X Poisson Solution A networked printer usually gets 15 print jobs every hour. The printer has to be turned off for 1 minutes for maintenance. What is the probability that nobody will want to use the printer during that time? The arrival rate is 15/6 =.5 jobs/min. (.5*1) P (1) =!.5*1 e =.8 Expected Number of Arrivals If customers are arriving at the exponentially distributed rate, how many customers should you expect to arrive in time t? Expected = * t For the printer problem with an arrival rate =.5, in 1 minutes we should expect.5 jobs to arrive Queuing Models Queuing systems are usually described by three values separated by slashes Arrival distribution / service distribution / # of servers where: M = Markovian or exponentially distributed D = Deterministic or constant. G = General or binomial distribution Common Models The simplest queuing model is M/M/1 where both the arrival time and service time are exponentially distributed. The M/D/1 model has exponentially distributed arrival times but fixed service time. The M/M/n model has multiple servers.

4 Why is there Queuing? The arrivals come at random times. Sometimes arrivals are far apart. Sometimes many customers arrive at almost the same time. When more customers arrive in a short period of time than can be serviced, queues form. If the arrival rate was not random, queues would not be created. Utilization Utilization (represented by the Greek letter rho, ) is the fraction of time the server is busy. Utilization is always between zero and one 1 If a bank teller spends 6 hours out of an 8 hour day counting money, her utilization is 6/8 =.75 Calculating Utilization Utilization can be calculated from the arrival rate and the service time. = * s It is important that the units of both the arrival rate and the service time be identical. It may be necessary to convert these values to common units. Little s Formula The number in the system is equal to the arrival rate times the average time a customer spends in the system. Q = * Tq This is also true for just the queue. W = * Tw Tq M/M/1 Formulas s = Q = s Tw = W = 1 1 Application of Little s Formula Multiplying the formulas on the left by gives the formula on the right. s Tq = = = Q

5 Tq Utilization Solution Process 1. Determine what quantities you need to know.. Identify the server 3. Identify the queued items 4. Identify the queuing model 5. Determine the service time 6. Determine the arrival rate 7. Calculate 8. Calculate the desired values Example Consider a disk drive that can complete an average request in 1 ms. The time to complete a request is exponentially distributed. Over a period of 3 minutes, 117, requests were made to the disk. How long did it take to complete the average request? What is the average number of queued requests? Solution Determine what quantities you need to know. The average request time is Tq The number of queued jobs is W Identify the server The disk drive is the server Identify the queued items Disk requests Identify the queuing model M/M/1 Solution (cont.) Determine the service time S = 1 ms =.1 sec / request Determine the arrival rate = 117, request / (3 min * 6 sec/min) = 65 requests / sec Calculate = *s =.1 sec/request * 65 req/sec =.65 Solution (cont.) Time to complete the average request s.1 T Q = = = 8. 6ms.65 The average length of the queue.65 W = = =

6 Number in the System The value Q represents the average number of jobs in the system, both waiting and being served. There are not always Q jobs in the system. Sometimes there are more, sometimes less. Q is the average. Queue Size Probabilities The probability that there are exactly N jobs in the system is given by N Prob[ Q = N] = (1 ) Summing the probabilities for individual cases gives the probability of N or less customers in the system i prob[ Q N] = (1 ) N i= Large Queue Probabilities The probability that there are more than N customers in the system is the sum of the probabilities from N-1 to. Remembering that the sum of all probabilities is one, the probability that there are more than N customers in the system is: i prob[ Q > N] = (1 ) N i= Example Continued In the previous example, what is the probability that a request does not get queued? A job can get serviced immediately if there are only zero or one jobs in the system. 1 P[ Q = or1] = (1 ) * + (1 ) * = =.58 Accuracy and Significant Digits Just because my calculator displays a 1 digit number does not mean the answer is accurate to 1 digits. Your answer can only be as accurate as your input data. If your data has three significant digits, your answer cannot have more than three digits. Always use as much accuracy as possible in these calculations and round off only at the end. Constant Service Time In some systems the service time is always a constant. The M/D/1 model is used for constant service time. There is less randomness in the system. The wait time will be less.

7 M/D/1 Formulas M/D/1 Example ( ) Tq = s (1 ) s Tw = (1 ) Q = + (1 ) W = (1 ) An ATM network sends 53 byte packets over a 155 Mb/sec line. It always takes.74 ms to send a packet. Each second 145, packets are sent. How long does a packet wait to be sent? M/D/1 Solution Determine what quantities you need to know. The average time spent in the queue, Tw. Identify the server The transmission line. Identify the queued items Packets (not bits or bytes) Identify the queuing model M/D/1 M/D/1 Solution Determine the service time.74x1-6 seconds Determine the arrival rate 145, packets/second Calculate = 145, *.74x1-6 =.3973 Calculate the desired values 6 s.75*1 *.3973 Tw = = = 9.3*1 (1 ) (1.3973) 7 sec Multiple Servers Multiple Servers S S S Customers arrive and join a single queue. Whenever any of the servers is idle, it serves the first customer on the single queue. All of the servers must be identical. Any customer can be served by any server. When there are N servers, the model is M/M/N

8 Multiple Server Utilization The server utilization for an N server system is: = s / N This is the average utilization for all N servers. Intermediate Value K To make calculations easier, we first compute the value K. K i N 1 ( s) = i! = N i ( s) i= i! i K Calculation The first term (i = ) is always 1 Note that the value in the denominator is equal to the numerator plus the last term. Since the denominator is always larger than the numerator, the value K must always be less than 1. The value K is an intermediate that simplifies calculations. It has no intrinsic meaning. Multiple Servers Busy The probability that all servers are busy is K C = sk N This is the probability that a new customer will have to wait in the queue. M/M/N formulas Example Cs Tq = + s N( ) Cs Tw = N ( ) Q = C + s W = C Assume that you have a printer that can print an average file in two minutes. Every two and a half minutes a user sends another file to the printer. How long does it take before a user can get their output? note: = s / N

9 Slow Printer Solution Determine what quantities you need to know. How long for job to exit the system, Tq Identify the server The printer Identify the queued items Print job Identify the queuing model M/M/1 Slow Printer Solution Determine the service time Print a file in minutes, s = min Determine the arrival rate new file every.5 minutes. = 1/.5 =.4 Calculate = * s =.4 * =.8 Calculate the desired values Tq = s / (1- ) = / (1 -.8) = 1 min Add a Second Printer To speed things up you can buy another printer that is exactly the same as the one you have. How long will it take for a user to get their files printed if you had two identical printers? K = N 1 i ( s) i= i! N i ( s) i= i! Calculate K 1 ( s) ( s) + =! 1! 1 ( s) ( s) ( s) + +! 1!! All values are the same, except the model is M/M/ and = * s / =.4 K = Calculate M/M/N Solution K C = sk N =.857 Cs Tq = + s =.57 min N(1 ) Note that with twice as many printers this example runs about 4X as fast. Faster Printer Another solution is to replace the existing printer with one that can print a file in an average of one minute. How long does it take for a user to get their output with the faster printer? M/M/1 queue with =.4 and s = 1. Tq = s / (1- ) = 1 / (1 -.4) = 1.67 min A single fast printer is better, particularly at low utilization. 6X better than slow printer.

10 Multiple Arrival Streams Exponentially distributed arrival streams can be merged. The total arrival rate is the sum of the individual arrival rates. a b a + b Dividing Customer Streams An exponentially distributed arrival stream can be divided. The sum of the separated arrival rates must equal to original arrival rate. / / Linking Multiple Queues The exit rate of a system is equal to the arrival rate. The output from one queuing system can feed into another. The time through the system is the sum of the time through each queuing component. Multiple Queue Example Consider a network with a computer connected to a router which is connected to a server. The computer can send a packet in 1 ms while the router can send it to the server in 7 ms. Programs on the computer generate 4 packets/second. The router receives a total of 1 packets/second. How long does it take for a packet to get to the server? 4 pkt/sec 1 pkt/sec Computer Router Server 1 ms 7 ms Multiple Queue Solution Determine what quantities you need to know Sum of Tq for both networks Identify the servers The computer transmitter and the router Identify the queued items Packets Identify the queuing model both M/M/1 queues Multiple Queue Solution Determine the service time 1ms for the computer, 7 ms for the router Determine the arrival rate 4 pkt/sec for computer, 1 pkt/sec for router Calculate computer= 4*.1 =.48 router=1*.7 =.7 Calculate the desired values Tqcomputer =.1/(1-.48) =.31 sec Tqrouter=.7/(1-.7) =.33 sec Total=46.4ms

11 Reusing a Server Consider a file server. Requests use the network to get to the server, then use the disk, then the network again to get back. The load on the network is doubled. Net Disk

### Basic Queuing Relationships

Queueing Theory Basic Queuing Relationships Resident items Waiting items Residence time Single server Utilisation System Utilisation Little s formulae are the most important equation in queuing theory

### Basic Multiplexing models. Computer Networks - Vassilis Tsaoussidis

Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,

### Simple Queuing Theory Tools You Can Use in Healthcare

Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful

### Queuing Theory II 2006 Samuel L. Baker

QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line

### LECTURE 16. Readings: Section 5.1. Lecture outline. Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process

LECTURE 16 Readings: Section 5.1 Lecture outline Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process Number of successes Distribution of interarrival times The

### Network Design Performance Evaluation, and Simulation #6

Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival

### Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi

Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) A goal of many waiting line problems is to help

### UNIT 2 QUEUING THEORY

UNIT 2 QUEUING THEORY LESSON 24 Learning Objective: Apply formulae to find solution that will predict the behaviour of the single server model II. Apply formulae to find solution that will predict the

### Minimax Strategies. Minimax Strategies. Zero Sum Games. Why Zero Sum Games? An Example. An Example

Everyone who has studied a game like poker knows the importance of mixing strategies With a bad hand, you often fold But you must bluff sometimes Lectures in Microeconomics-Charles W Upton Zero Sum Games

### Process simulation. Enn Õunapuu enn.ounapuu@ttu.ee

Process simulation Enn Õunapuu enn.ounapuu@ttu.ee Content Problem How? Example Simulation Definition Modeling and simulation functionality allows for preexecution what-if modeling and simulation. Postexecution

### Outline. Simulation examples will be given in queuing, inventory, reliability and network analysis.

Simulation Examples Today I ll present several examples of simulations that can be performed by devising a simulation table either manually or with a spreadsheet. This will provide insight into the methodology

### QUEUING THEORY. 1. Introduction

QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze

### 4 The M/M/1 queue. 4.1 Time-dependent behaviour

4 The M/M/1 queue In this chapter we will analyze the model with exponential interarrival times with mean 1/λ, exponential service times with mean 1/µ and a single server. Customers are served in order

### CSE331: Introduction to Networks and Security Homework 1 Fall 2006 Due: 29 Sept. 2006

CSE331: Introduction to Networks and Security Homework 1 Fall 006 Due: 9 Sept. 006 What to turn in: Submit hardcopy answers to the questions below. Please include your name, e-mail address, and the number

### Simulation. Advantages of Simulation. The Process of Simulation. To simulate is to try to duplicate the characteristics of a real system

Simulation To simulate is to try to duplicate the characteristics of a real system We will study mathematical simulation models of real systems to help make business decisions Simulation is one of the

### A Summary of Error Propagation

A Summary of Error Propagation Suppose you measure some quantities a, b, c,... with uncertainties δa, δb, δc,.... Now you want to calculate some other quantity Q which depends on a and b and so forth.

### Waiting Times Chapter 7

Waiting Times Chapter 7 1 Learning Objectives Interarrival and Service Times and their variability Obtaining the average time spent in the queue Pooling of server capacities Priority rules Where are the

### Math 016. Materials With Exercises

Math 06 Materials With Exercises June 00, nd version TABLE OF CONTENTS Lesson Natural numbers; Operations on natural numbers: Multiplication by powers of 0; Opposite operations; Commutative Property of

### Q UEUING ANALYSIS. William Stallings

Q UEUING ANALYSIS William Stallings WHY QUEUING ANALYSIS?...2 QUEUING MODELS...3 The Single-Server Queue...3 Queue Parameters...4 The Multiserver Queue...5 Basic Queuing Relationships...5 Assumptions...5

### count up and down in tenths count up and down in hundredths

Number: Fractions (including Decimals and Percentages COUNTING IN FRACTIONAL STEPS Pupils should count in fractions up to 10, starting from any number and using the1/2 and 2/4 equivalence on the number

### 6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory

6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory Massachusetts Institute of Technology Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS

### HFCC Math Lab Intermediate Algebra - 17 DIVIDING RADICALS AND RATIONALIZING THE DENOMINATOR

HFCC Math Lab Intermediate Algebra - 17 DIVIDING RADICALS AND RATIONALIZING THE DENOMINATOR Dividing Radicals: To divide radical expression we use Step 1: Simplify each radical Step 2: Apply the Quotient

### Multiplying Fractions

. Multiplying Fractions. OBJECTIVES 1. Multiply two fractions. Multiply two mixed numbers. Simplify before multiplying fractions 4. Estimate products by rounding Multiplication is the easiest of the four

### PURSUITS IN MATHEMATICS often produce elementary functions as solutions that need to be

Fast Approximation of the Tangent, Hyperbolic Tangent, Exponential and Logarithmic Functions 2007 Ron Doerfler http://www.myreckonings.com June 27, 2007 Abstract There are some of us who enjoy using our

### Improper Fractions and Mixed Numbers

This assignment includes practice problems covering a variety of mathematical concepts. Do NOT use a calculator in this assignment. The assignment will be collected on the first full day of class. All

### Queuing Formulas. 1 Notation 2. 2 Basic Queueing Formulas 2

Queuing Formulas Contents 1 Notation 2 2 Basic Queueing Formulas 2 3 Single-Server Queues 3 3.1 Formulas...................................... 3 3.2 Some additional useful facts...........................

### Transport Layer Protocols

Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements

### Assignment #2 for Computer Networks

Assignment # for Computer Networks Savvas C. Nikiforou Department of Computer Science and Engineering University of South Florida Tampa, FL 6 Abstract The purpose of this assignment is to compare the queueing

### CS 147: Computer Systems Performance Analysis

CS 147: Computer Systems Performance Analysis Introduction to Queueing Theory CS 147: Computer Systems Performance Analysis Introduction to Queueing Theory 1 / 27 Overview Introduction and Terminology

### Don t Slow Me Down with that Calculator Cliff Petrak (Teacher Emeritus) Brother Rice H.S. Chicago cpetrak1@hotmail.com

Don t Slow Me Down with that Calculator Cliff Petrak (Teacher Emeritus) Brother Rice H.S. Chicago cpetrak1@hotmail.com In any computation, we have four ideal objectives to meet: 1) Arriving at the correct

### AQA Statistics 1. Probability. Section 2: Tree diagrams

Notes and Examples AQA Statistics Probability Section 2: Tree diagrams These notes include sub-sections on; Reminder of the addition and multiplication rules Probability tree diagrams Problems involving

### Grade 7/8 Math Circles October 7/8, Exponents and Roots - SOLUTIONS

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 7/8, 2014 Exponents and Roots - SOLUTIONS This file has all the missing

### Solution Guide Chapter 14 Mixing Fractions, Decimals, and Percents Together

Solution Guide Chapter 4 Mixing Fractions, Decimals, and Percents Together Doing the Math from p. 80 2. 0.72 9 =? 0.08 To change it to decimal, we can tip it over and divide: 9 0.72 To make 0.72 into a

### When multiplying whole numbers we are counting a repeated set of items. Exercise 1: How many pizza boxes are there?

When multiplying whole numbers we are counting a repeated set of items. Exercise 1: How many pizza boxes are there? 1 2 3 1 2 3 4 There are 3 rows and 4 columns of boxes. Thus, we have 3 x 4 = 12 pizza

### Financial Mathematics

Financial Mathematics For the next few weeks we will study the mathematics of finance. Apart from basic arithmetic, financial mathematics is probably the most practical math you will learn. practical in

### CSE3214 Computer Network Protocols and Applications. Chapter 1 Examples and Homework Problems

CSE3214 Computer Network Protocols and Applications Chapter 1 Examples and Homework Problems Example 1 (review question 18) (1) How long does it take a packet of length 1000 bytes to propagate over a link

### Performance Analysis of Computer Systems

Performance Analysis of Computer Systems Introduction to Queuing Theory Holger Brunst (holger.brunst@tu-dresden.de) Matthias S. Mueller (matthias.mueller@tu-dresden.de) Summary of Previous Lecture Simulation

### Lectures 5 & / Introduction to Queueing Theory

Lectures 5 & 6 6.263/16.37 Introduction to Queueing Theory MIT, LIDS Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS PS PS Packet Network PS PS

### Slides 5: General Principles of Discrete-Event System Simulation

Slides 5: General Principles of Discrete-Event System Simulation Purpose Develops a common framework for the modeling of complex systems. Covers the basic blocks for all discrete-event simulation models.

### 1. Repetition probability theory and transforms

1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is

Subnetting is a process of dividing large network into the smaller networks based on layer 3 IP address. Every computer on network has an IP address that represent its location on network. Two version

### Cost-Volume-Profit Analysis

Cost-Volume-Profit Analysis Cost-volume-profit (CVP) analysis is used to determine how changes in costs and volume affect a company's operating income and net income. In performing this analysis, there

### ISyE 2030 Test 2 Solutions

1 NAME ISyE 2030 Test 2 Solutions Fall 2004 This test is open notes, open books. Do precisely 5 of the following problems your choice. You have exactly 55 minutes. 1. Suppose that we are simulating the

### 1.4 Rounding. It doesn t matter if use the same cards again because you ll probably ask for a different degree of rounding.

1.4 Rounding Rounding to the nearest integer, or nearest 10, 100, etc. and decimal places (another way of saying nearest tenth, nearest hundredth, etc.) need to be clear before venturing into significant

### Section 1.5 Exponents, Square Roots, and the Order of Operations

Section 1.5 Exponents, Square Roots, and the Order of Operations Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Identify perfect squares.

### Maths for Nurses: Fractions and Decimals

Maths for Nurses: Fractions and Decimals This booklet will provide an overview of the basic numeracy skills for Nursing students. If you have any problems in answering the questions within the booklet

### Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

Section 7 Algebraic Manipulations and Solving Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving Before launching into the mathematics, let s take a moment to talk about the words

### Fundamentals of Probability

Fundamentals of Probability Introduction Probability is the likelihood that an event will occur under a set of given conditions. The probability of an event occurring has a value between 0 and 1. An impossible

### Queuing Theory I 2006 Samuel L. Baker

QUEUING THEORY I 1 Queuing Theory I 2006 Samuel L. Baker Assignment 7 is on page 8. Assignment 7A is on page 13. Queuing theory is the analysis of waiting lines, or "queues". The goal of this unit of the

### Maths Workshop for Parents 2. Fractions and Algebra

Maths Workshop for Parents 2 Fractions and Algebra What is a fraction? A fraction is a part of a whole. There are two numbers to every fraction: 2 7 Numerator Denominator 2 7 This is a proper (or common)

### Rational Expressions - Complex Fractions

7. Rational Epressions - Comple Fractions Objective: Simplify comple fractions by multiplying each term by the least common denominator. Comple fractions have fractions in either the numerator, or denominator,

### Numerator Denominator

Fractions A fraction is any part of a group, number or whole. Fractions are always written as Numerator Denominator A unitary fraction is one where the numerator is always 1 e.g 1 1 1 1 1...etc... 2 3

### 1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one

### Round decimals to the nearest whole number

Round decimals to the nearest whole number Learning Objective Simplifying Fractions Simplified Fractions To simplify a fraction, we find an equivalent fraction which uses the smallest numbers possible.

This assignment will help you to prepare for Algebra 1 by reviewing some of the things you learned in Middle School. If you cannot remember how to complete a specific problem, there is an example at the

### Click on the links below to jump directly to the relevant section

Click on the links below to jump directly to the relevant section Basic review Writing fractions in simplest form Comparing fractions Converting between Improper fractions and whole/mixed numbers Operations

### DECIMAL REVIEW. 2. Change to a fraction Notice that =.791 The zero in front of the decimal place is not needed.

DECIMAL REVIEW A. INTRODUCTION TO THE DECIMAL SYSTEM The Decimal System is another way of expressing a part of a whole number. A decimal is simply a fraction with a denominator of 10, 100, 1 000 or 10

### Exponential Approximation of Multi-Skill Call Centers Architecture

Exponential Approximation of Multi-Skill Call Centers Architecture Ger Koole and Jérôme Talim Vrije Universiteit - Division of Mathematics and Computer Science De Boelelaan 1081 a - 1081 HV Amsterdam -

### Solving Rational Equations

Lesson M Lesson : Student Outcomes Students solve rational equations, monitoring for the creation of extraneous solutions. Lesson Notes In the preceding lessons, students learned to add, subtract, multiply,

### Repton Manor Primary School. Maths Targets

Repton Manor Primary School Maths Targets Which target is for my child? Every child at Repton Manor Primary School will have a Maths Target, which they will keep in their Maths Book. The teachers work

### A Policy-Based Admission Control Scheme for Voice over IP Networks

Journal of Computer Science 5 (11): 817-821, 2009 ISSN 1549-3636 2009 Science Publications A Policy-Based Admission Control Scheme for Voice over IP Networks Sami Alwakeel and Agung Prasetijo Department

### Cancelling a Fraction: Rules

Cancelling a Fraction: Rules The process of canceling involves taking fractions with larger numbers on top and bottom and re-writing those fractions with smaller numbers ensuring the value of the fraction

### Chapter 6 Congestion Control and Resource Allocation

Chapter 6 Congestion Control and Resource Allocation 6.3 TCP Congestion Control Additive Increase/Multiplicative Decrease (AIMD) o Basic idea: repeatedly increase transmission rate until congestion occurs;

### Grade 6 Math Circles. Exponents

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles November 4/5, 2014 Exponents Quick Warm-up Evaluate the following: 1. 4 + 4 + 4 +

### Data Networks, Summer 2007 Homework #1

Data Networks, Summer 007 Homework #1 Assigned May 16, 007 Due May 1, 007 in class Name: Email: Student ID: Problem 1 3 4 Total Points 1 In this homework, for simplicity, K means 10 3, M means 10 6, and

### TYPES OF NUMBERS. Example 2. Example 1. Problems. Answers

TYPES OF NUMBERS When two or more integers are multiplied together, each number is a factor of the product. Nonnegative integers that have exactly two factors, namely, one and itself, are called prime

### Session 7 Fractions and Decimals

Key Terms in This Session Session 7 Fractions and Decimals Previously Introduced prime number rational numbers New in This Session period repeating decimal terminating decimal Introduction In this session,

### Decimal and Fraction Review Sheet

Decimal and Fraction Review Sheet Decimals -Addition To add 2 decimals, such as 3.25946 and 3.514253 we write them one over the other with the decimal point lined up like this 3.25946 +3.514253 If one

### Chapter 2. Simulation Examples 2.1. Prof. Dr. Mesut Güneş Ch. 2 Simulation Examples

Chapter 2 Simulation Examples 2.1 Contents Simulation using Tables Simulation of Queueing Systems Examples A Grocery Call Center Inventory System Appendix: Random Digits 1.2 Simulation using Tables 1.3

### Surviving DDoS. SANOG X 5 September 2007. ed.lewis@neustar.biz. 5 Sep '07, SANOG X ed.lewis@neustar.biz 1

Surviving DDoS SANOG X 5 September 2007 ed.lewis@neustar.biz 5 Sep '07, SANOG X ed.lewis@neustar.biz 1 Theme How does a provider of information and services overcome Denial of Service situations? An important

### Lecture 2. Displacement. Speed. Average velocity. Instantaneous velocity. Gravity and acceleration. Cutnell+Johnson: chapter 2

Lecture 2 Displacement Speed Average velocity Instantaneous velocity Gravity and acceleration Cutnell+Johnson: chapter 2 Most physics classes start by studying the laws describing how things move around.

### Analysis of a Production/Inventory System with Multiple Retailers

Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University

### Congestion Control. Abusayeed Saifullah. CS 5600 Computer Networks

Congestion Control Abusayeed Saifullah CS 5600 Computer Networks 1 Network Conges-on Conges-on: When one part of the subnet (e.g. one or more routers in an area) is overloaded. The network and transport

### Algebra 1A and 1B Summer Packet

Algebra 1A and 1B Summer Packet Name: Calculators are not allowed on the summer math packet. This packet is due the first week of school and will be counted as a grade. You will also be tested over the

### IEEE 802 LANs. LAN: Local Area Network What is a local area network?

IEEE 802 LANs LAN: Local Area Network What is a local area network? A LAN is a network that resides in a geographically restricted area LANs usually span a building or a campus 1 Characteristics of LANs

### Section R.2. Fractions

Section R.2 Fractions Learning objectives Fraction properties of 0 and 1 Writing equivalent fractions Writing fractions in simplest form Multiplying and dividing fractions Adding and subtracting fractions

### DATE PERIOD. Estimate the product of a decimal and a whole number by rounding the Estimation

A Multiplying Decimals by Whole Numbers (pages 135 138) When you multiply a decimal by a whole number, you can estimate to find where to put the decimal point in the product. You can also place the decimal

### MATH Fundamental Mathematics II.

MATH 10032 Fundamental Mathematics II http://www.math.kent.edu/ebooks/10032/fun-math-2.pdf Department of Mathematical Sciences Kent State University December 29, 2008 2 Contents 1 Fundamental Mathematics

### Bits, Bytes, and Codes

Bits, Bytes, and Codes Telecommunications 1 Peter Mathys Black and White Image Suppose we want to draw a B&W image on a computer screen. We first subdivide the screen into small rectangles or squares called

### SIMPLIFYING ALGEBRAIC FRACTIONS

Tallahassee Community College 5 SIMPLIFYING ALGEBRAIC FRACTIONS In arithmetic, you learned that a fraction is in simplest form if the Greatest Common Factor (GCF) of the numerator and the denominator is

### Revision Notes Adult Numeracy Level 2

Revision Notes Adult Numeracy Level 2 Place Value The use of place value from earlier levels applies but is extended to all sizes of numbers. The values of columns are: Millions Hundred thousands Ten thousands

### Year 6 Maths Objectives

Year 6 Maths Objectives Place Value COUNTING COMPARING NUMBERS IDENTIFYING, REPRESENTING & ESTIMATING NUMBERS READING & WRITING NUMBERS UNDERSTANDING PLACE VALUE ROUNDING PROBLEM SOLVING use negative numbers

8. Simplification of Radical Expressions 8. OBJECTIVES 1. Simplify a radical expression by using the product property. Simplify a radical expression by using the quotient property NOTE A precise set of

### Load Balancing and Switch Scheduling

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

### Maths Module 2. Working with Fractions. This module covers fraction concepts such as:

Maths Module Working with Fractions This module covers fraction concepts such as: identifying different types of fractions converting fractions addition and subtraction of fractions multiplication and

### Introduction to the Practice Exams

Introduction to the Practice Eams The math placement eam determines what math course you will start with at North Hennepin Community College. The placement eam starts with a 1 question elementary algebra

### MATH 140 Lab 4: Probability and the Standard Normal Distribution

MATH 140 Lab 4: Probability and the Standard Normal Distribution Problem 1. Flipping a Coin Problem In this problem, we want to simualte the process of flipping a fair coin 1000 times. Note that the outcomes

### Accuplacer Elementary Algebra Study Guide for Screen Readers

Accuplacer Elementary Algebra Study Guide for Screen Readers The following sample questions are similar to the format and content of questions on the Accuplacer Elementary Algebra test. Reviewing these

### EQUATIONS. Main Overarching Questions: 1. What is a variable and what does it represent?

EQUATIONS Introduction to Variables, Algebraic Expressions, and Equations (2 days) Overview of Objectives, students should be able to: Main Overarching Questions: 1. Evaluate algebraic expressions given

### Calculation of Exponential Numbers

Calculation of Exponential Numbers Written by: Communication Skills Corporation Edited by: The Science Learning Center Staff Calculation of Exponential Numbers is a written learning module which includes

### ANGLE CALCULATIONS. plus 76 hundredths of 1

Learning Assistance Center Southern Maine Community College ANGLE CALCULATIONS An angle is formed by rotating a given ray about its endpoint to some terminal position. The original ray is the initial side

### Objectives. By the time the student is finished with this section of the workbook, he/she should be able

QUADRATIC FUNCTIONS Completing the Square..95 The Quadratic Formula....99 The Discriminant... 0 Equations in Quadratic Form.. 04 The Standard Form of a Parabola...06 Working with the Standard Form of a

### 100 which when written as a decimal is 0.06.

Solve the following problem. Session 28 Decimal Multiplication and Division Find the electric bill for 370 kwh s of electricity from Red River Region Co-op, which charges 0.094 dollars per kilowatt-hour

### Summer Assignment for incoming Fairhope Middle School 7 th grade Advanced Math Students

Summer Assignment for incoming Fairhope Middle School 7 th grade Advanced Math Students Studies show that most students lose about two months of math abilities over the summer when they do not engage in

### Worked examples Random Processes

Worked examples Random Processes Example 1 Consider patients coming to a doctor s office at random points in time. Let X n denote the time (in hrs) that the n th patient has to wait before being admitted

### Level Descriptors Maths Level 1-5

Level Descriptors Maths Level 1-5 What is APP? Student Attainment Level Descriptors APP means Assessing Pupil Progress. What are the APP sheets? We assess the children in Reading, Writing, Speaking & Listening,

### Comparing relative frequency and probability

Comparing relative frequency and probability The mathematics of probability is concerned with things that happen at random, or unpredictably. A common example is a (fair) raffle in which each ticket has

### + Section 6.2 and 6.3

Section 6.2 and 6.3 Learning Objectives After this section, you should be able to DEFINE and APPLY basic rules of probability CONSTRUCT Venn diagrams and DETERMINE probabilities DETERMINE probabilities