page 1 This question-paper you hand in, together with your solutions. ================================================================
|
|
- Marshall Gibbs
- 6 years ago
- Views:
Transcription
1 age EXAMINATION Jan 9 Time :5-7:5 QUEUEING THEORY EP9, HF ( 6H78), Lecturer: Armin Halilovic Instructions:. You ARE allowed to use a calculator.. You are NOT allowed to use your own tables of mathematical formulas on the exam.. Use of any communication device when taing this examination is strictly rohibited. 4. Write your name and ID-number on each age. 5: Write the question number on each age. 6: Start a new question on a new age. Grading: For each correct solution, four oints will be awarded. Credit will be given or resentation and methods of solutions. A maximum of oints (8+ bonus oints) can be earned. Points can also be deducted for unsubstantiated answers. At least 6 oints are required to ass the exam. Grading scale: The total number of ossible oints is. 8 - oints are required for an A grade; 5-7 oints are required for a B grade; -4 oints are required for a C grade; 9 - oints are required for a D grade; 6-8 oints are required for an E grade; 4-5 oints result in a Fx ; - oints result in a F grade. This question-aer you hand in, together with your solutions. Question ) (4 oints) We model a queueing system as a birth-and-death rocess with two states E and E with arrival rate λ and service rate μ 7 (see Fig ). Let ( t ) be the robability that the system is at state Fig E and let ( t ) be the robability that the system is λ at state E. We assume that (). 4 Determine the differential equation for ( t ). E E Use the Lalace transform to solve the equation and find ( t ). ( If you solve the equation using some other method instead of Lalace then you get max μ oints for this question) age
2 age Question ) (4 oints) A system can be modeled as a three state Marov chain. The system has states E, E and E with transition rates defined in the rate transition diagram (Fig a) i) ( oin Find the rate transition Q- matrix. Fig a E E 4 E ii) ( oints) Find the stationary robability vector. iii) ( oin Determine the system, with differential equation and linear equation, for the time-deendent (transien robabilities, and ( t ). (You do not need to solve the diff eq. system iii.) Question. a) ( oints) Derive the following formulas for an M/M/queueing system: a), a) N, b) ( oints). A communication channel has the caacity of K bits/second. Data acets arrive at the channel according to a Poisson rocess with rate λ6 acets er minute. The acets have an exonentially distributed length with a mean of v 4 bits. We assume that the channel can be modeled as an M/M/ system with queueing disciline FCFS (First- Come- First- Served). b. Determine the minimum value of K which ensure that the average total time T, sent in the system by a customer, is less than or equal to T.5 seconds. b. For that K find the robability that the time sent in the system by a customer is less than or equal to.6 seconds and greater than. seconds. Question 4. A telehone system can be modeled as an M/M/4/ wait system with the arrival rate of 5 calls er minute and the service time of x minute. a) Draw the rate transition diagram b) Find the offered, effective and bloced traffic. c) find the blocing robability, that is the robability for an arriving call to be bloced. Question 5. We consider an M/M/// system ( servers waiting laces, customers) with arrival rate from one customer β arrivals er minute and service time x 6 seconds. a) ( oints) Find,,..., 5 b) ( oin Find the robability that an arriving customer find 5 customers in the system. age
3 age Question 6. Find x, E ( ~ x ), μ, and then use the Pollacze - Khinchin formula, to find W for an M/G/ system where λ /5 acets er ms, and π cost t f othervise is the density function of the random variable ~ x (time unit ms). Hel for question 7: π / ( ~ x E x) tf dt, E x ) ( ~ π / t f dt Pollacze - Khinchin formula λ E( ~ x ) W. ( ) Question 7. We consider a queueing net with three M/M/ queues as shown in Fig. 8. Three servers S, S and S wor with service rates μ 4 rograms /min, μ 5 rograms/min, resective μ 5 rograms /min. New rograms (customers) arrive at a servers S and S according to Poisson rocesses of rate λ Α, and λ Β rograms er minute. After getting service the rograms continue according to Fig 8. Find the average number of the rograms in the queueing net (NN+N+N). Fig 8. λ Β λ Α Q μ 75% Q S μ 5% 5% Q S % 5% out μ 8% out Good luc! age
4 age 4 Solutions: Question ) (4 oints) Question ) (4 oints) We model a queueing system as a birth-and-death rocess with two states E and E with arrival rate λ and service rate μ 7 (see Fig ). Let be the robability that the system is at state Fig E and let ( t ) be the robability that the system is λ at state E. We assume that (). 4 Determine the differential equation for. E E Use the Lalace transform to solve the equation and find. ( If you solve the equation using some other method instead of Lalace then you get max μ oints for this question) Solution: a) Q 7 7 System: + 7 ( + ( Substitution + ( gives the following differential equation + 7 ( eq) with the initial value: (). 4. Using the Lalace transform we get: 7 sp () P + s 7 sp.4 P + s 7 sp + P.4 + s.4 7 P + s + s( s + ) From the formula table we get t t t e + e.4e + 7 t 4 t e + e t e 7 t Answer: ( e age 4
5 age 5 Question ) (4 oints) A system can be modeled as a three state Marov chain. The system has states E, E and E with transition rates defined in the rate transition diagram (Fig a) i) ( oin Find the rate transition Q- matrix. Fig a E E 4 E ii) ( oints) Find the stationary robability vector. iii) ( oin Determine the system, with differential equation and linear equation, for the time-deendent (transien robabilities, and (. (You do not need to solve the diff eq. system iii.) Solution: i) Q r Let (,, ) denote the stationary robability vector. r From Q r we get the following system Solving this system we get,, Answer ii) The stationary robability vector is (,, ) Answer iii) r r From Q we get the following system ( + ( ( ( + + age 5
6 age 6 Question. a) ( oints) Derive the following formulas for an M/M/queueing system: a), a) N, b) ( oints). A communication channel has the caacity of K bits/second. Data acets arrive at the channel according to a Poisson rocess with rate λ6 acets er minute. The acets have an exonentially distributed length with a mean of v 4 bits. We assume that the channel can be modeled as an M/M/ system with queueing disciline FCFS (First- Come- First- Served). b. Determine the minimum value of K which ensure that the average total time T, sent in the system by a customer, is less than or equal to T.5 seconds. b. For that K find the robability that the time sent in the system by a customer is less than or equal to.6 seconds and greater than. seconds. Solution: a) From the rate transition diagram we have. a) The average number of the customers in the system can be calculated using the formula for the exectation of a discrete random variable: N (*) If we differentiate with resect to the formula for the sum of a geometric series we obtain (**) ( ) We substitute (**) in (*) and get N ( ) which roves the formula. ( ) age 6
7 age 7 Solution b) First λ6 acets er minute acets er second. Using T we get the following equation μ λ μ λ μ μ Now, K v μ Answer b) K 48 bits er sec. b)since, for M/M/, P( a < ~ s b) e ( μ λ ) a F F ( μ λ ) t ~ s P s e, we have ( ~ ( μ λ ) b ( μ λ ) a ~ s ( b) F~ s ( a) ( e ) ( e ) ( μ λ ) b e ~.6 P (. < s.6) e e. Thus: Answer b) e.6 e..476 Question 4. A telehone system can be modeled as an M/M/4/ wait system with the arrival rate of 5 calls er minute and the service time of x minute. a) Draw the rate transition diagram b) Find the offered, effective and bloced traffic. c) find the blocing robability, that is the robability for an arriving call to be bloced. Answer 4. a) age 7
8 age 8 b) The offered traffic 5. The effective traffic.59 The bloced traffic.4677 P blocing robability.954 b Question 5. We consider an M/M/// system ( servers waiting laces, customers) with arrival rate from one customer β arrivals er minute and service time x 6 seconds. a) ( oints) Find,,..., 5 b) ( oin Find the robability that an arriving customer find 5 customers in the system. a) b) r λ λ.7 mean Question 6. Find x, E ( ~ x ), μ, and then use the Pollacze - Khinchin formula, to find W for an M/G/ system where λ /5 acets er ms, and age 8
9 age 9 π cost t f othervise is the density function of the random variable ~ x (time unit ms). Hel for question 7: π / ( ~ x E x) tf dt, E x ) ( ~ Pollacze - Khinchin formula Solution: λ, 5 π / π / x E( ~ x) tf dt t costdt E ( ~ x π / ) t f dt t π / μ x π π λx Hence λ E( ~ x ) W. 576 ( ) π / t f dt λ E( ~ x ) W. ( ) costdt π / π π [ t sin t + cost] π / π [ t sin t + t cost sin t].4674 Question 7. We consider a queueing net with three M/M/ queues as shown in Fig. 8. Three servers S, S and S wor with service rates μ 4 rograms /min, μ 5 rograms/min, resective μ 5 rograms /min. New rograms (customers) arrive at a servers S and S according to Poisson rocesses of rate λ Α, and λ Β rograms er minute. After getting service the rograms continue according to Fig 8. Find the average number of the rograms in the queueing net (NN+N+N). Fig 8. 4 age 9
10 age λ Β λ Α Q μ 75% Q S μ 5% 5% Q S % 5% out μ 8% out Lyca till! Solution: The effective (ne arrival rates into these two queues are λ +.5λ +.λ λ +.75λ λ.5λ From the system we get: λ 5 λ 5, λ 5 Since μ 4, μ 5 and μ 5 we have λ λ, μ μ λ and μ N, N, N 5 N N + N + N.5 age
CHAPTER-5 PERFORMANCE ANALYSIS OF AN M/M/1/K QUEUE WITH PREEMPTIVE PRIORITY
CHAPTER-5 PERFORMANCE ANALYSIS OF AN M/M//K QUEUE WITH PREEMPTIVE PRIORITY 5. INTRODUCTION In last chater we discussed the case of non-reemtive riority. Now we tae the case of reemtive riority. Preemtive
More informationEP2200 Queueing theory and teletraffic systems
P00 Queueing theory and teletraffic ytem Lecture 9 M/G/ ytem Vitoria Fodor KTH S/LCN The M/G/ queue Arrival proce memoryle (Poion( Service time general, identical, independent, f(x Single erver M/ r /
More informationAnalysis of M/M/n/K Queue with Multiple Priorities
Analysis of M/M/n/K Queue with Multile Priorities Coyright, Sanjay K. Bose For a P-riority system, class P of highest riority Indeendent, Poisson arrival rocesses for each class with i as average arrival
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 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 informationSolutions 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 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 informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationUNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.
UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next
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 informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More 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 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 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 information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationIE 336 Seat # Name (one point) < KEY > Closed book. Two pages of hand-written notes, front and back. No calculator. 60 minutes.
Closed book. Two pages of hand-written notes, front and back. No calculator. 6 minutes. Cover page and four pages of exam. Four questions. To receive full credit, show enough work to indicate your logic.
More informationChapter 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 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 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 informationMTH 3102 Complex Variables Practice Exam 1 Feb. 10, 2017
Name (Last name, First name): MTH 310 Comlex Variables Practice Exam 1 Feb. 10, 017 Exam Instructions: You have 1 hour & 10 minutes to comlete the exam. There are a total of 7 roblems. You must show your
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationCalculus of Several Variables (TEN A), (TEN 1)
Famil name: First name: I number: KTH Campus Haninge EXAMINATION Jan 6 Time: 8.5-.5 Calculus o Several Variables TEN A TEN Course: Transorm Methods and Calculus o Several Variables 6H79 Ten Ten A Lecturer
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 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 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 informationHomework Set #3 Rates definitions, Channel Coding, Source-Channel coding
Homework Set # Rates definitions, Channel Coding, Source-Channel coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits
More informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationOperations Management
Universidade Nova de Lisboa Faculdade de Economia Oerations Management Winter Semester 010/011 Second Round Exam January 6, 011, 5.30.m Duration: h30 RULES 1. Do not searate any sheet. Write your name
More informationLIVE: FINAL EXAM PREPARATION PAPER 1 30 OCTOBER 2014
LIVE: FINAL EXAM PREPARATION PAPER 0 OCTOBER 04 Lesson Descrition In this lesson we: Work through uestions from various Paer aers. Challenge Question Phili is designing large fish troughs in the shae of
More informationPage 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.
Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit
More informationQ = (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 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 informationBirth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes.
EEC 686/785 Modelig & Perforace Evaluatio of Couter Systes Lecture Webig Zhao Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity webig@ieee.org based o Dr. Raj jai s lecture otes Relatioshi
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationAnalysis of A Single Queue
Analysis of A Single Queue 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 informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationCS 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 informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationHomework #11. (Due December 5 at the beginning of the class.) Numerical Method Series #6: Engineering applications of Newton-Raphson Method to
Homework #11 (Due December 5 at the beginning of the class.) Numerical Method Series #6: Engineering alications of Newton-Rahson Method to solving systems of nonlinear equations Goals: 1. Understanding
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 informationBirth-Death Processes
Birth-Death Processes Birth-Death Processes: Transient Solution Poisson Process: State Distribution Poisson Process: Inter-arrival Times Dr Conor McArdle EE414 - Birth-Death Processes 1/17 Birth-Death
More informationECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains
ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 4: Discrete-Time Markov Chains September 1, 215 Dr. Itamar Arel College of Engineering Department of Electrical Engineering & Computer
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 informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
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 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 information11 The M/G/1 system with priorities
11 The M/G/1 system with priorities In this chapter we analyse queueing models with different types of customers, where one or more types of customers have priority over other types. More precisely we
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 informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
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 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 informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationMA162 EXAM III SPRING 2017 APRIL 11, 2017 TEST NUMBER 01 INSTRUCTIONS:
MA62 EXAM III SPRING 207 APRIL, 207 TEST NUMBER 0 INSTRUCTIONS:. Do not open the exam booklet until you are instructed to do so. 2. Before you open the booklet fill in the information below and use a #
More informationMASSACHUSETTS 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 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 informationTHE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS
Probability in the Engineering and Informational Sciences, 8, 04, 9 doi:007/s0699648300096 THE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS NIR PEREL AND URI YECHIALI Deartment of Statistics and Oerations
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More 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 informationSince 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 informationA MONOTONICITY RESULT FOR A G/GI/c QUEUE WITH BALKING OR RENEGING
J. Al. Prob. 43, 1201 1205 (2006) Printed in Israel Alied Probability Trust 2006 A MONOTONICITY RESULT FOR A G/GI/c QUEUE WITH BALKING OR RENEGING SERHAN ZIYA, University of North Carolina HAYRIYE AYHAN
More informationFurther differentiation and integration
7 Toic Further differentiation and integration Contents. evision exercise................................... 8. Introduction...................................... 9. Differentiation of sin x and cos x..........................
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 informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationDiscrete-time Geo/Geo/1 Queue with Negative Customers and Working Breakdowns
Discrete-time GeoGeo1 Queue with Negative Customers and Working Breakdowns Tao Li and Liyuan Zhang Abstract This aer considers a discrete-time GeoGeo1 queue with server breakdowns and reairs. If the server
More informationMATH 2203 Exam 3 Version 2 Solutions Instructions mathematical correctness clarity of presentation complete sentences
MATH 2203 Exam 3 (Version 2) Solutions March 6, 2015 S. F. Ellermeyer Name Instructions. Your work on this exam will be graded according to two criteria: mathematical correctness and clarity of presentation.
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
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 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 informationECE 6960: Adv. Random Processes & Applications Lecture Notes, Fall 2010
ECE 6960: Adv. Random Processes & Alications Lecture Notes, Fall 2010 Lecture 16 Today: (1) Markov Processes, (2) Markov Chains, (3) State Classification Intro Please turn in H 6 today. Read Chater 11,
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationP (L d k = n). P (L(t) = n),
4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with
More informationThe 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 informationPhoto: US National Archives
ESD.86. Markov Processes and their Application to Queueing II Richard C. Larson March 7, 2007 Photo: US National Archives Outline Little s Law, one more time PASTA treat Markov Birth and Death Queueing
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 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 information1.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 informationAnswers to selected exercises
Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting
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 informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
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 information2905 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 informationECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.
ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. 1. Enter your name, student ID number, e-mail address, and signature in the space provided on this page, NOW! 2. This is a closed book exam.
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More 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 informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
More informationStationary remaining service time conditional on queue length
Stationary remaining service time conditional on queue length Karl Sigman Uri Yechiali October 7, 2006 Abstract In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary
More informationCOMP9334: 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 informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More 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 informationMA EXAM 2 INSTRUCTIONS VERSION 01 March 9, Section # and recitation time
MA 16600 EXAM INSTRUCTIONS VERSION 01 March 9, 016 Your name Student ID # Your TA s name Section # and recitation time 1. You must use a # pencil on the scantron sheet (answer sheet).. Check that the cover
More informationOperations Management
Universidade Nova de Lisboa Faculdade de Economia Oerations Management Winter Semester 009/010 First Round Exam January, 8, 009, 8.30am Duration: h30 RULES 1. Do not searate any sheet. Write your name
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationStatistics 433 Practice Final Exam: Cover Sheet and Marking Sheet
Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet YOUR NAME INSTRUCTIONS: No notes, no calculators, and no communications devices are permitted. Please keep all materials away from your
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationIntro to Queueing Theory
1 Intro to Queueing Theory Little s Law M/G/1 queue Conservation Law 1/31/017 M/G/1 queue (Simon S. Lam) 1 Little s Law No assumptions applicable to any system whose arrivals and departures are observable
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 information