Course Documents Authorized Duration: 120 minutes. Exercise 1. Monte Carlo Simulation and Confidence Interval (5 points)

Size: px
Start display at page:

Download "Course Documents Authorized Duration: 120 minutes. Exercise 1. Monte Carlo Simulation and Confidence Interval (5 points)"

Transcription

1 KINGDOM OF SAUDI ARABIA Ministry of Higher Education Al-Imam Muhammad Ibn Saud Islamic University Faculty of Computer Science and Information المملكة العربية السعودية وزارة التعليم العالي جامعة اإلمام محمد بن سعود اإلسالمية كلية علوم الحاسب والمعلومات اإلسم الثالثي:... المستوى الرقم الجامعي النتيجة: 40/ Final Exam Modeling and Simulation (CS-433) Course Documents Authorized Duration: 120 minutes Exercise 1. Monte Carlo Simulation and Confidence Interval (5 points) We have used a Monte Carlo simulation method to estimate the area of a circle, with radius equal to 1, using 800 random numbers for generating 400 points (X, Y). We have found that 308 random points are inside the circle. a. Compute the estimation of the circle area and the estimation of. (1 points) b. Compute the 90% confidence interval for this estimated value assuming that the standard deviation is equal to (1 points) c. Compute the 99% confidence interval for this estimated for the same standard deviation (1 points) Dr. Anis Koubâa 1/6

2 d. Interpret ( (فس ر the previous result. (2 points) Exercise 2. Simulation and Point Estimators (8 points) A network engineer has made a simulation study on the network of the University. He wants to evaluate the average delay to transmit packets from the queue of a router. The engineer makes ONE simulation run that sends N = 100 packets according to a Poisson distribution λ 2 / and computes the delay of each packet. He finds that the average delay obtained from this simulation is 102. a. Does this is value 102 give a precise estimation of the average delay? Explain. (1 points) b. Can you have any confidence on this average delay? On which parameters does the observed average delay depend to have a confidence on it? (2 points) c. The engineer computes the standard deviation of the average delay from the output sample and finds that σ 4. Determine the margin of error for this point estimator obtained from this simulation. (1 points) d. What is the confidence level on the error that found in the previous question? (1 points) Dr. Anis Koubâa 2/6 January 2008

3 Using a computer program, the engineer makes 500 simulation runs and in each simulation he computes the average value where What will be the distribution of the average value? Give the expressions of the mean and the variance of. (3 points) e. What is the distribution of the inter-arrival time of packets? (1 points) Exercise 3. Experimental Analysis and Sample Size (10 points) We consider the following ping application on the website We have obtained the following output: ping -n 10 Pinging [ ] with 32 bytes of data: Reply from : bytes=32 time=263ms TTL=52 Reply from : bytes=32 time=286ms TTL=52 Reply from : bytes=32 time=308ms TTL=52 Reply from : bytes=32 time=229ms TTL=52 Reply from : bytes=32 time=252ms TTL=52 Reply from : bytes=32 time=276ms TTL=52 Reply from : bytes=32 time=299ms TTL=52 Reply from : bytes=32 time=220ms TTL=52 Reply from : bytes=32 time=243ms TTL=52 Reply from : bytes=32 time=265ms TTL=52 We would like to study the round trip time from a computer to the Yahoo! Website. Observe column time in the figure (in grey color). As you can see, time is a random number. 1. Compute the mean (average) round trip time? (1 point) 2. Compute the standard deviation? (1 point) 3. Compute the margin of error for 95% confidence interval? (1 point) 4. Compute the minimum sample size if we want that the estimate error be less than 5 ms. Use the value of the standard deviation that you have found in Question 2. (2 point) Dr. Anis Koubâa 3/6 January 2008

4 Now, we would like to compare the round trip time of Yahoo! Website with Google website. Thus, we send ping packets to the website and we get the following output. We find that the mean (average) round trip time to Google website is 260 ms and the standard deviation is ms obtained for n=30 observed packets. 5. If we assume that the average round trip time is normally distributed, give an estimatee of the difference of the mean delays between Yahoo! and Google websites with 90% confidence interval. (1 point) 6. Do you think that the confidence on the difference of mean delays is high? Explain the reasons. (2 points). 7. Is Yahoo! Website faster to respond than Google website or not? Explain. (2 points) Problem: Aircraft Simulation (17 Points) Consider the aircraft simulation problem as shown in the following figure. Figure 1. Aircraft Simulation Model We assume that aircrafts arrive according to Poisson process. Each aircraft that arrives must wait for the others that already came before. When it gets its turn for landing, it spends a landing time exponentially distributed. We denote by Ai the i th aircraft. Consider the following simulation events: Dr. Anis Koubâa 4/6 January 2008

5 Aircraft Arrival Time Landing Duration Parking Duration A A A This indicates that the first aircraft arrives at time t=1. It spend 5 time units to land (so, it will be landed a time t=6). It then spends 8 time units in the parking (so the departure will be on time t=6+8=14). The same interpretation holds for the other aircraft. 1. Complete the following simulation table. (5 points) Event Time Event Name InTheAir OnTheGround RunwayFree 0 Nothing 0 0 TRUE 1 A1 Arrived 1 0 FALSE 4 A2 Arrived 2. We define the delay and the waiting time before landing plus the landing duration. Delay = waiting time + landing duration. From the previous table, compute the delay of each aircraft. (3 point) Delay Aircraft A1 = Delay Aircraft A2 = Delay Aircraft A3 = Average Delay = Standard Variation = 3. In this simulation, we have used a random number generator RNG that generates a random number u uniformly distributed between 0 and 1. However, the inter-arrival time between two consecutive aircraft arrivals follows an exponential distribution with a mean µ= 30 minutes. Dr. Anis Koubâa 5/6 January 2008

6 Explain how can we generate a random number exponentially distributed with mean µ= 30 using the RNG (0,1)? (2 points) 4. We have generated 100 aircraft arrivals using this random number generator. The observed and theoretical frequencies of the number of arrivals in a time unit are presented in the following table. Note that the expected frequency corresponds to a Poisson distribution. Complete the following table (2 points). Number of Arrivals Observed Frequency Oi Expected Frequency Ei ² Total Total ² 5. Make the chi-square test to decide if the two distributions are equivalent or not, assuming that χ²(0.05, 6) = χ² critical = (2 points) 6. Look at the table and determine what the mean value of number of arrival per time unit is. (2 points) Dr. Anis Koubâa 6/6 January 2008

Course Documents Authorized Duration: 120 minutes. Questions are generally independent. You can respond to any question before the other.

Course Documents Authorized Duration: 120 minutes. Questions are generally independent. You can respond to any question before the other. KINGDOM OF SAUDI ARABIA Ministry of Higher Education Al-Imam Muhammad Ibn Saud Islamic University Faculty of Computer Science and Information المملكة العربية السعودية وزارة التعليم العالي جامعة اإلمام

More information

Only slides are your own summaries are authorized Summaries must contain only equations. No exercises or solutions are authorized.

Only slides are your own summaries are authorized Summaries must contain only equations. No exercises or solutions are authorized. KINGDOM OF SAUDI ARABIA Ministry of Higher Education Al-Imam Muhammad Ibn Saud Islamic University Faculty of Computer Science and Information المملكة العربية السعودية وزارة التعليم العالي جامعة اإلمام

More information

التعليمات: أجب عن جميع األسئلة

التعليمات: أجب عن جميع األسئلة Kingdom of Saudi Arabia Ministry of higher Education Al-Imam Mohammed Bin Saud Islamic University College: Science Department: Physics المملكة العربية السعودية وزارة التعليم العالي جامعة اإلمام محمد بن

More information

Simulation & Modeling Event-Oriented Simulations

Simulation & Modeling Event-Oriented Simulations Simulation & Modeling Event-Oriented Simulations Outline Simulation modeling characteristics Concept of Time A DES Simulation (Computation) DES System = model + simulation execution Data Structures Program

More information

CS 798: Homework Assignment 3 (Queueing Theory)

CS 798: Homework Assignment 3 (Queueing Theory) 1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of

More information

CS418 Operating Systems

CS418 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 information

Stochastic Processes

Stochastic Processes Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False

More information

Semester , Example Exam 1

Semester , Example Exam 1 Semester 1 2017, Example Exam 1 1 of 10 Instructions The exam consists of 4 questions, 1-4. Each question has four items, a-d. Within each question: Item (a) carries a weight of 8 marks. Item (b) carries

More information

Homework 1 - SOLUTION

Homework 1 - SOLUTION Homework - SOLUTION Problem M/M/ Queue ) Use the fact above to express π k, k > 0, as a function of π 0. π k = ( ) k λ π 0 µ 2) Using λ < µ and the fact that all π k s sum to, compute π 0 (as a function

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.

More information

Course 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 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 information

Practice Problems Section Problems

Practice Problems Section Problems Practice Problems Section 4-4-3 4-4 4-5 4-6 4-7 4-8 4-10 Supplemental Problems 4-1 to 4-9 4-13, 14, 15, 17, 19, 0 4-3, 34, 36, 38 4-47, 49, 5, 54, 55 4-59, 60, 63 4-66, 68, 69, 70, 74 4-79, 81, 84 4-85,

More information

Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February

Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February PID: Last Name, First Name: Section: Approximate time spent to complete this assignment: hour(s) Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February Readings: Chapters 16.6-16.7 and the

More information

Solutions to COMP9334 Week 8 Sample Problems

Solutions to COMP9334 Week 8 Sample Problems Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items

More information

STAT 516 Midterm Exam 2 Friday, March 7, 2008

STAT 516 Midterm Exam 2 Friday, March 7, 2008 STAT 516 Midterm Exam 2 Friday, March 7, 2008 Name Purdue student ID (10 digits) 1. The testing booklet contains 8 questions. 2. Permitted Texas Instruments calculators: BA-35 BA II Plus BA II Plus Professional

More information

CS115 Computer Simulation Project list

CS115 Computer Simulation Project list CS115 Computer Simulation Project list The final project for this class is worth 40% of your grade. Below are your choices. You only need to do one of them. Project MC: Monte Carlo vs. Deterministic Volume

More information

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 "

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 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 information

Reliable Data Transport: Sliding Windows

Reliable Data Transport: Sliding Windows Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time

More information

Introduction to Queueing Theory with Applications to Air Transportation Systems

Introduction 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 information

Solutions - Final Exam

Solutions - Final Exam Solutions - Final Exam Instructors: Dr. A. Grine and Dr. A. Ben Ghorbal Sections: 170, 171, 172, 173 Total Marks Exercise 1 7 Exercise 2 6 Exercise 3 6 Exercise 4 6 Exercise 5 6 Exercise 6 9 Total 40 Score

More information

Randomized Algorithms

Randomized Algorithms Randomized Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours

More information

EP2200 Course Project 2017 Project II - Mobile Computation Offloading

EP2200 Course Project 2017 Project II - Mobile Computation Offloading EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of

More information

2.2t t 3 =1.2t+0.035' t= D, = f ? t 3 dt f ' 2 dt

2.2t t 3 =1.2t+0.035' t= D, = f ? t 3 dt f ' 2 dt 5.5 Queuing Theory and Traffic Flow Analysis 159 EXAMPLE 5.8 After observing arrivals and departures at a highway toll booth over a 60-minute tim e period, an observer notes that the arrival and departure

More information

Introduction to Queuing Theory. Mathematical Modelling

Introduction 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 information

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate

More information

Page Max. Possible Points Total 100

Page Max. Possible Points Total 100 Math 3215 Exam 2 Summer 2014 Instructor: Sal Barone Name: GT username: 1. No books or notes are allowed. 2. You may use ONLY NON-GRAPHING and NON-PROGRAMABLE scientific calculators. All other electronic

More information

O June, 2010 MMT-008 : PROBABILITY AND STATISTICS

O June, 2010 MMT-008 : PROBABILITY AND STATISTICS No. of Printed Pages : 8 M.Sc. MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE (MACS) tr.) Term-End Examination O June, 2010 : PROBABILITY AND STATISTICS Time : 3 hours Maximum Marks : 100 Note : Question

More information

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) 1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name

More information

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( )

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( ) 1. Set a. b. 2. Definitions a. Random Experiment: An experiment that can result in different outcomes, even though it is performed under the same conditions and in the same manner. b. Sample Space: This

More information

Link Models for Circuit Switching

Link 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 information

Answers to the problems from problem solving classes

Answers to the problems from problem solving classes Answers to the problems from problem solving classes Class, multiaccess communication 3. Solution : Let λ Q 5 customers per minute be the rate at which customers arrive to the queue for ordering, T Q 5

More information

Introduction to queuing theory

Introduction 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 information

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days? IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross

More information

IEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22.

IEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22. IEOR 46: Spring Solutions to Homework Assignment 7: Due on Tuesday, March. More of Chapter 5: Read the rest of Section 5.3, skipping Examples 5.7 (Coupon Collecting), 5. (Insurance claims)and Subsection

More information

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) AOR-01 ASSIGNMENT BOOKLET Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) It is compulsory to submit the assignment before filling in the exam form.

More information

PBW 654 Applied Statistics - I Urban Operations Research

PBW 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 information

CS325: Analysis of Algorithms, Fall Midterm

CS325: Analysis of Algorithms, Fall Midterm CS325: Analysis of Algorithms, Fall 2017 Midterm I don t know policy: you may write I don t know and nothing else to answer a question and receive 25 percent of the total points for that problem whereas

More information

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0. IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the

More information

Queueing Theory and Simulation. Introduction

Queueing 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 information

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR 2DI90 Probability & Statistics 2DI90 Chapter 4 of MR Recap - Random Variables ( 2.8 MR)! Example: X is the random variable corresponding to the temperature of the room at time t. x is the measured temperature

More information

CPSC 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 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 information

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element

More information

Non Markovian Queues (contd.)

Non 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

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

Networking = 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 information

Min Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min

Min Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science

More information

Discrete Event and Process Oriented Simulation (2)

Discrete Event and Process Oriented Simulation (2) B. Maddah ENMG 622 Simulation 11/04/08 Discrete Event and Process Oriented Simulation (2) Discrete event hand simulation of an (s, S) periodic review inventory system Consider a retailer who sells a commodity

More information

MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL

MONTE 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 information

Computer Systems Modelling

Computer 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 information

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics MMT-008 Assignment Booklet M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics (Valid from 1 st July, 013 to 31 st May, 014) It is compulsory to submit the assignment before

More information

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Queueing 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 information

1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False:

1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False: 1 st Midterm Exam Solution اس تعن ابهلل وكن عىل يقني بأ ن لك ما ورد يف هذه الورقة تعرفه جيدا وقد تدربت عليه مبا فيه الكفاية Student s Name Student s Number Question #1: Answer the following with True or

More information

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes? IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only

More information

Communications and Signal Processing Spring 2017 MSE Exam

Communications and Signal Processing Spring 2017 MSE Exam Communications and Signal Processing Spring 2017 MSE Exam Please obtain your Test ID from the following table. You must write your Test ID and name on each of the pages of this exam. A page with missing

More information

The Timing Capacity of Single-Server Queues with Multiple Flows

The Timing Capacity of Single-Server Queues with Multiple Flows The Timing Capacity of Single-Server Queues with Multiple Flows Xin Liu and R. Srikant Coordinated Science Laboratory University of Illinois at Urbana Champaign March 14, 2003 Timing Channel Information

More information

Queueing Networks G. Rubino INRIA / IRISA, Rennes, France

Queueing Networks G. Rubino INRIA / IRISA, Rennes, France Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result

More information

Wireless Internet Exercises

Wireless Internet Exercises Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC

More information

1. Let X be a random variable with probability density function. 1 x < f(x) = 0 otherwise

1. Let X be a random variable with probability density function. 1 x < f(x) = 0 otherwise Name M36K Final. Let X be a random variable with probability density function { /x x < f(x = 0 otherwise Compute the following. You can leave your answers in integral form. (a ( points Find F X (t = P

More information

Statistics 150: Spring 2007

Statistics 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 information

Whitby Community College Your account expires on: 8 Nov, 2013

Whitby Community College Your account expires on: 8 Nov, 2013 http://www.mathsnetalevel.com/examprint.php?q68,337,55,343,758,834,460,5... Page of 7 04/03/03 To print higher-resolution math symbols, click the Hi-Res Fonts for Printing button on the jsmath control

More information

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

5/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 information

Midterm Exam 1 Solution

Midterm Exam 1 Solution EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2015 Kannan Ramchandran September 22, 2015 Midterm Exam 1 Solution Last name First name SID Name of student on your left:

More information

Performance Evaluation of Queuing Systems

Performance 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 information

Discrete Event Systems Exam

Discrete Event Systems Exam Computer Engineering and Networks Laboratory TEC, NSG, DISCO HS 2016 Prof. L. Thiele, Prof. L. Vanbever, Prof. R. Wattenhofer Discrete Event Systems Exam Friday, 3 rd February 2017, 14:00 16:00. Do not

More information

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control Saurabh Jain Joint work with Dr. Dmitri Loguinov June 21, 2007 1 Agenda Introduction Analysis of RCP QI-RCP PIQI-RCP Comparison Wrap

More information

STAT/MA 416 Midterm Exam 2 Thursday, October 18, Circle the section you are enrolled in:

STAT/MA 416 Midterm Exam 2 Thursday, October 18, Circle the section you are enrolled in: STAT/MA 46 Midterm Exam 2 Thursday, October 8, 27 Name Purdue student ID ( digits) Circle the section you are enrolled in: STAT/MA 46-- STAT/MA 46-2- 9: AM :5 AM 3: PM 4:5 PM REC 4 UNIV 23. The testing

More information

Review of Queuing Models

Review 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 information

CDA6530: Performance Models of Computers and Networks. Chapter 8: Discrete Event Simulation (DES)

CDA6530: Performance Models of Computers and Networks. Chapter 8: Discrete Event Simulation (DES) CDA6530: Performance Models of Computers and Networks Chapter 8: Discrete Event Simulation (DES) Simulation Studies Models with analytical formulas Calculate the numerical solutions Differential equations

More information

COMP9334: Capacity Planning of Computer Systems and Networks

COMP9334: Capacity Planning of Computer Systems and Networks COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance

More information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

NANYANG 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 information

1 Basic continuous random variable problems

1 Basic continuous random variable problems Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and

More information

THE 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. 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 information

Job Scheduling and Multiple Access. Emre Telatar, EPFL Sibi Raj (EPFL), David Tse (UC Berkeley)

Job Scheduling and Multiple Access. Emre Telatar, EPFL Sibi Raj (EPFL), David Tse (UC Berkeley) Job Scheduling and Multiple Access Emre Telatar, EPFL Sibi Raj (EPFL), David Tse (UC Berkeley) 1 Multiple Access Setting Characteristics of Multiple Access: Bursty Arrivals Uncoordinated Transmitters Interference

More information

Verification and Validation. CS1538: Introduction to Simulations

Verification and Validation. CS1538: Introduction to Simulations Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation

More information

2905 Queueing Theory and Simulation PART IV: SIMULATION

2905 Queueing Theory and Simulation PART IV: SIMULATION 2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random

More information

Introduction to Queueing Theory

Introduction 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 information

ISyE 2030 Practice Test 2

ISyE 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 information

AP Calculus Summer Packet

AP Calculus Summer Packet AP Calculus Summer Packet Going into AP Calculus, there are certain skills that have been taught to you over the previous tears that we assume you have. If you do not have these skills, you will find that

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017.

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017. EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017 Midterm Exam 2 Last name First name SID Name of student on your left: Name of

More information

Chapter 5. Elementary Performance Analysis

Chapter 5. Elementary Performance Analysis Chapter 5 Elementary Performance Analysis 1 5.0 2 5.1 Ref: Mischa Schwartz Telecommunication Networks Addison-Wesley publishing company 1988 3 4 p t T m T P(k)= 5 6 5.2 : arrived rate : service rate 7

More information

Queueing 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. ! 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 information

IE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.

IE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes. Three pages of hand-written notes, front and back. Closed book. 120 minutes. 1. SIMLIB. True or false. (2 points each. If you wish, write an explanation of your thinking.) (a) T F The time of the next

More information

Midterm Exam 2 (Solutions)

Midterm Exam 2 (Solutions) EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran March, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name of

More information

1. If X has density. cx 3 e x ), 0 x < 0, otherwise. Find the value of c that makes f a probability density. f(x) =

1. If X has density. cx 3 e x ), 0 x < 0, otherwise. Find the value of c that makes f a probability density. f(x) = 1. If X has density f(x) = { cx 3 e x ), 0 x < 0, otherwise. Find the value of c that makes f a probability density. 2. Let X have density f(x) = { xe x, 0 < x < 0, otherwise. (a) Find P (X > 2). (b) Find

More information

Probability Methods in Civil Engineering Prof. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur

Probability Methods in Civil Engineering Prof. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur Probability Methods in Civil Engineering Prof. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur Lecture No. # 12 Probability Distribution of Continuous RVs (Contd.)

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018.

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018. EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018 Midterm 1 Last Name First Name SID You have 10 minutes to read the exam and

More information

Measurements made for web data, media (IP Radio and TV, BBC Iplayer: Port 80 TCP) and VoIP (Skype: Port UDP) traffic.

Measurements made for web data, media (IP Radio and TV, BBC Iplayer: Port 80 TCP) and VoIP (Skype: Port UDP) traffic. Real time statistical measurements of IPT(Inter-Packet time) of network traffic were done by designing and coding of efficient measurement tools based on the Libpcap package. Traditional Approach of measuring

More information

λ λ λ In-class problems

λ λ λ 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 information

COMP9334 Capacity Planning for Computer Systems and Networks

COMP9334 Capacity Planning for Computer Systems and Networks COMP9334 Capacity Planning for Computer Systems and Networks Week 2: Operational Analysis and Workload Characterisation COMP9334 1 Last lecture Modelling of computer systems using Queueing Networks Open

More information

MATH Introduction to MATLAB

MATH Introduction to MATLAB KINGDOM OF SAUDI ARABIA - AL-IMAM MUHAMMAD BIN SAUD ISLAMIC UNIVERSITY - FACULTY OF SCIENCES - - May 9, 2011 Semester 2, 1431-1432 (2010-20111) MATH 251 - Introduction to MATLAB Exercise sheet 6 Dr. Samy

More information

Link Models for Packet Switching

Link 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 information

Stochastic Simulation Variance reduction methods Bo Friis Nielsen

Stochastic Simulation Variance reduction methods Bo Friis Nielsen Stochastic Simulation Variance reduction methods Bo Friis Nielsen Applied Mathematics and Computer Science Technical University of Denmark 2800 Kgs. Lyngby Denmark Email: bfni@dtu.dk Variance reduction

More information

Unit 4 Advanced Functions Review Day

Unit 4 Advanced Functions Review Day Unit 4 Advanced Functions Review Day Warm-up! Find the domain and range of the following functions. Then, tell how they are changed from their parent graph. (Hint: Remember that the order of transformations

More information

Impact of Cross Traffic Burstiness on the Packet-scale Paradigm An Extended Analysis

Impact of Cross Traffic Burstiness on the Packet-scale Paradigm An Extended Analysis Impact of ross Traffic Burstiness on the Packet-scale Paradigm An Extended Analysis Rebecca Lovewell and Jasleen Kaur Technical Report # TR11-007 Department of omputer Science University of North arolina

More information

Math May 13, Final Exam

Math May 13, Final Exam Math 447 - May 13, 2013 - Final Exam Name: Read these instructions carefully: The points assigned are not meant to be a guide to the difficulty of the problems. If the question is multiple choice, there

More information

Simulation. Where real stuff starts

Simulation. Where real stuff starts 1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?

More information

ISyE 3044 Fall 2015 Test #1 Solutions

ISyE 3044 Fall 2015 Test #1 Solutions 1 NAME ISyE 3044 Fall 2015 Test #1 Solutions You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point for writing your

More information

ISyE 6644 Fall 2016 Test #1 Solutions

ISyE 6644 Fall 2016 Test #1 Solutions 1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2

More information

Analysis of Call Center Data

Analysis of Call Center Data University of Pennsylvania ScholarlyCommons Wharton Research Scholars Wharton School 4-1-2004 Analysis of Call Center Data Yu Chu Cheng University of Pennsylvania Follow this and additional works at: http://repository.upenn.edu/wharton_research_scholars

More information

IE 581 Introduction to Stochastic Simulation

IE 581 Introduction to Stochastic Simulation 1. List criteria for choosing the majorizing density r (x) when creating an acceptance/rejection random-variate generator for a specified density function f (x). 2. Suppose the rate function of a nonhomogeneous

More information

Analysis of random-access MAC schemes

Analysis of random-access MAC schemes Analysis of random-access MA schemes M. Veeraraghavan and Tao i ast updated: Sept. 203. Slotted Aloha [4] First-order analysis: if we assume there are infinite number of nodes, the number of new arrivals

More information