E-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
|
|
- Blaze Ferguson
- 5 years ago
- Views:
Transcription
1 E-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments Jun Luo Antai College of Economics and Management Shanghai Jiao Tong University Shanghai China L Jeff Hong Department of Economics and Finance and Department of Management Sciences College of Business City University of Hong Kong Kowloon Hong Kong Barry L Nelson Department of Industrial Engineering and Management Sciences Northwestern University Evanston Illinois Yang Wu Tmall Company the Alibaba Group Hangzhou Zhejiang China EC Technical Notes EC Derivation of the Asymptotic Independence in Section 23 Because there is only alternative for notational simplicity we omit the (denoting alternative ) in the subscript of Y l and replace Y l by Y l in this section We first derive closed-form expressions for Y l l 2 and their properties Since the m processors are identical and the service time of each customer (replication time) is exponentially distributed with mean µ by the Markovian property we know that the interdeparture time between the (l )th and lth customer denoted by A l l 2 are iid with mean µ µ /m (note that A is the departure time for the first customer which is Y ) At time t 0 0 there are m customers assigned to the server pool; at time t l l 2 the lth customer leaves the system and the next customer in queue is immediately admitted to the empty server (see Figure EC) m 0 A t t 2 A 2 A 3 t 3 A l t l t l t st 2nd 3rd (l )th lth Figure EC The inter-departure time ec
2 ec2 Notice that Y l is the service time of the lth departing customer in this example for l 2 Moreover the service time of the lth departing customer depends on the time point at which it enters the system For instance the first departure can only enter the system at time t 0 then Y A The second departure can enter the system at times t or t 0 with probabilities m m 2 m(m ) respectively Then m 2 { A2 wp Y 2 m m A + A 2 wp m The third departure can enter the system at time t 2 t or t 0 with probabilities mm m(m ) m 3 m 3 or m(m )(m ) respectively Then m 3 Y 3 A 3 wp m m A 2 + A 3 wp A + A 2 + A 3 wp m 2 (m ) 2 m 2 Similarly like counting the paths in an m-ary tree we can obtain A l wp m m A l + A l wp Y l l d2 A d wp l A d d wp m 2 (m ) l 2 m l (m ) l m l Then based on the closed-form expression for the distribution of Y l we can further derive the mean of Y l and expectation of the sample mean estimator Ȳl(n) respectively as follows l ( ) l d [ ( m E[Y l ] E[A d ] µ ) l ] m m d E [ Ȳ l (n) ] { µ m [ ( ) n ]} n m We next use the moment generating function (MGF) to show the asymptotic independence between Y l and Y as n that is ( lim MYl (t) M (t) M Y Y n l +Y (t)) 0 (EC) Define Y l in a rigorous way Let D l s denote the event that the lth departing customer enters the system at time t s s 0 l Conditioning on D l s Y l can be written as follows Y l {D l s} l ds+ Then the MGF of Y l is M Yl (t) E [E [e ty l D l ]] l P {D s0 l s} E [e t ] l ds+ A d A d or
3 ec3 Recall that A l are independent exponential random variables with mean µ µ so the MGF of m A d is M Ad (t) ( µt) Furthermore we derive the probability distribution function of D l m(m ) l s 0 P {D l s} m l m s (m ) l s s 2 l m l Plugging the expressions for P {D l s} and M Ad (t) into M Yl (t) and with some algebra we obtain that M Yl (t) mµt mµt ( ) l m mµt m µt Notice that the MGF M Yl (t) is well-defined in the neighborhood of zero Furthermore the nonnegativity of M Yl (t) implies that mµt > 0 which further indicates that m < Then m µt lim l M Yl (t) mµt which is the MGF of an exponential random variable with mean µ mµ By calculating the first order derivative of M Yl (t) at t 0 we also arrive that the conclusion that lim l E[Y l ] µ as in Section 23 Similarly we can derive the closed-form expression of the MGF of Y as M Y (t) mµt mµt ( ) m mµt m µt Then lim n M Y l (t) M Y (t) ( ( mµt) mµt m 2 ( mµt) 2 m ) l (EC2) µt The MGF of Y l + Y is M Yl +Y (t) E [ E [ e t(y l +Y ) D l D ]] l j0 s0 P {D l j D s} E [e t( l dj+ A d + ] ds+ A d ) (EC3) The joint distribution of D l and D seems complicated because it depends on the relations between j and s as well as l and s Since we are interested in the situation that n without loss of generality we assume that n 2 We derive the results for the case that l 3 (in fact the
4 ec4 case that l or l 2 can be handled in a similar but simpler way as l 3) By enumerating all possibilities we obtain the the joint distribution as follows m(m ) n (m 2) l P {D l j D s} m j 0 s 0 m(m ) n+s (m 2) l s m j 0 s l m s l+ (m ) n+2l s 2 m j 0 s l l + n m(m ) n+j (m 2) l j m j l s 0 m s (m ) n+j s (m 2) l j m j l s j 0 j l s j m j (m ) n+s j (m 2) l s m j l s j + l m s+j l (m ) n+2l s j 2 m j l s l l + n Then Equation (EC3) can be written as the sum of eight parts [ M Yl +Y (t) P {D l 0 D 0} E e t( l d A d + ] d A d ) l + P {D l 0 D s} E [e t( l d A d + ] ds+ A d ) s0 + sl j P {D l 0 D s} E [e t( l d A d + ] ds+ A d ) l + P {D l j D 0} E [e t( l dj+ A d + ] d A d ) l j + P {D l j D s} E [e t( l dj+ A d + ] ds+ A d ) j s l + P {D l j D j} E [e t( l dj+ A d + dj+ A )] d j l + j sj+ l + j l sl P {D l j D s} E [e t( l dj+ A d + ] ds+ A d ) (EC4) (EC5) (EC6) (EC7) (EC8) (EC9) (EC0) P {D l j D s} E [e t( l dj+ A d + ] ds+ A d ) (EC) We now deal with the eight parts in Equation (EC4) (EC) one-by-one The first part is (EC4) P {D l 0 D 0} E [e 2t l d A d +t ] dl+ A d m(m )n (m 2) l m ( 2µt) l ( µt) n
5 ec5 which converges to zero as n because of the condition m < verified above m µt The second part is l (EC5) P {D l 0 D s} E [e t s d A d +2t l ds+ A d +t ] dl+ A d s0 l s0 m(m ) n+s (m 2) l s m ( µt) s ( 2µt) l s ( µt) n which converges to zero as n because of the condition m < verified above m µt The third part is (EC6) sl sl P {D l 0 D s} E [e t l d A d +t ] ds+ A d m s l+ (m ) n+2l s 2 m ( µt) 2 s m(m ) m ( µt) mµt + mn+ (m ) l m (m )l 0 + m l ( µt) as n l mµt ( µt) l mµt The fourth part is the same as the second part with only exchanging the positions of s and j so (EC7) also converges to zero as n The fifth part is l j (EC8) P {D l j D s} E [e t j ds+ A d +2t l dj+ A d +t ] dl+ A d j s l j j s m s (m ) n+j s (m 2) l j m m(m )n (m 2) l m m(m ) m m(m )n (m 2) l m ( 2µt) l ( µt) 2 ( 2µt) l + ml (m ) n m ( µt) n 2( mµt) 2 0 as n ( 2µt) l j ( µt) n ( mµt) 2 ( µt) n ( µt) n+j s ( mµt) 2 2( mµt) 2 The sixth part (EC9) equals zero because the joint probability equals zero The seventh part is (EC0) l l j sj+ P {D l j D s} E [e t s dj+ A d +2t l ds+ A d +t ] dl+ A d
6 ec6 l l j sj+ m j (m ) n+s j (m 2) l s m ( 2µt) l s m(m )n (m 2) l m ( 2µt) l 2 ( µt) n ml (m ) n ( 2µt) m ( µt) n 2( mµt) 2 m(m ) m ( µt) 2 0 as n The eighth part is (EC) l j sl l j sl 2( mµt) 2 ( mµt) 2 + ml (m ) n m P {D l j D s} E [e t l dj+ A d +t ] ds+ A d m s+j l (m ) n+2l s j 2 m ( µt) l j ( µt) s ( µt) n+s j m(m ) m ( µt) ( mµt) mn+ (m ) l 2 m ml (m ) n m 0 (m )l m l ( µt) n ( µt) l ( mµt) 2 + m m ( mµt) 2 ( µt) n ( µt) l ( mµt) 0 + as n 2 ( mµt) 2 ( mµt) 2 ( mµt) 2 Combining the limits of the eight parts for (EC4) (EC) and (EC2) yields the equality in Equation (EC) which concludes the desired result EC2 Useful Lemmas Lemma EC Let (x n : n ) be a real-valued sequence such that n n i x i µ as n where µ is finite Then n max in x i 0 as n Proof: Let s n n i x i Then x n n s n n n n s n n µ µ 0 as n Since x n /n 0 it follows that for all ɛ > 0 there exists n n (ɛ) such that for n > n x n /n ɛ For n n n max in x i n max in x i + n n max x i + in n max x i + ɛ in max in +n x i max in +n Then the limsup of the LHS as n is at most 0 + ɛ Since ɛ is arbitrary the result follows x i i
7 ec7 Lemma EC2 (Fabian (974)) For a fixed triangular continuation region C defined by U(s) max {0 A Bs} and U(s) if B /2 and > 0 then P[B (T ) < 0] 2 e A where T inf{s > 0 B (s) / C} the random stopping time that B () first exits C EC3 Sketch of the Proof of Lemma 2 The detailed proof of Lemma 2 follows exactly the same steps as in Kim et al (2005) so we only provide a sketch of the idea behind it Recall that D[0 ] is the Skorohod space of all right-continuous functions with left limits Let Λ be the set of strictly increasing functions λ mapping the domain [0 ] onto itself such that both λ and its inverse λ are continuous Then the Skorohod metric ρ on D[0 ] can be defined by { } ρ(x Y ) inf λ Λ d : sup λ(t) t d and t [0] sup X(t) Y (λ(t)) d t [0] Besides the definition of the Skorohod metric ρ we also need to define the following two mapping functions (as Definitions 2 and 22 in Kim et al (2005)): Definition EC On the Skorohod space D[0 ] (a) For Y D[0 ] Let T Y (U δ ) inf { t : Y (t) U δ (t) } and define the function p δ : Y D[0 ] p δ (Y ) R by p δ (Y ) Y (T Y (U δ )) (b) For Y D[0 ] Let T Y (U) inf {t : Y (t) U(t)} and define the function p : Y D[0 ] p(y ) R by p(y ) Y (T Y (U)) Notice that the forms of the upper boundaries U δ (t) and U(t) can be generally specified as in Kim et al (2005) however for simplicity we may directly regard U δ (t) U δ j(t) and U(t) as defined in Section 42 To show that Z j (T δ j) B (T j ) in Lemma 2 a key step is to show that p δ (Z j ()) p (B ()) as δ 0 which involves the functional central limit theorem and the generalized continuous mapping theorem (Theorem 344 in Whitt (2002)) The following proposition justifies that the conditions of Theorem 344 in Whitt (2002) can be satisfied Proposition EC If p δ () and p() are as in Definition EC then P[B D p ] 0 (EC2) where D p is the set of x D[0 ] such that p δ (x δ ) p(x) fails for some sequence {x δ } with ρ(x δ x) 0 in D[0 ] as δ 0
8 ec8 Proposition EC presents the same result as Proposition 3 in Kim et al (2005) and interested readers may refer to the paper for the detailed proof Then with the results in Equations () and (EC2) we can apply the generalized continuousmapping theorem (Theorem 344 in Whitt (2002)) to show that which concludes the proof p δ (Z j ()) p (B ()) as δ 0 EC2 Numerical Results of Test Experiments using Master/Slave When the time to generate one observation is extremely small then the master may not be able to process available observations immediately after they are ready to be sent back to the master We conducted some numerical experiments on our local server to help better understand this issue We consider the SC with k and implement the APS procedure using Master/Slave structure with m 48 slaves The replication time is simply the time for generating a normal random variable ( ms) We report the numerical result in Table EC Compared with the result in Table in the paper for the same k 0 3 and m 48 the samples simulated on the server (ie ) is larger than that generated on the simulator (ie ) That is because the replication time is relatively short on the server which leads to the situation that the master is not fast enough to process all available samples immediately Thus the available observations are filling the queueing buffer in front of the master waiting for the comparison and elimination decisions This is consistent with the monitoring of the buffer in front of the master during the simulation Secondly we find that the total sample size increases in proportion to the makespan as k increases However most of the time is not devoted to simulation (ie generating samples) but consumed by the master for computing work For instance it only takes about 002 ( /48) seconds to generate samples with m 48 slaves but the procedure spends about 90 seconds to select the best This means 978% of the time the slaves are idling either for submitting the result or waiting for the next task which is very close to what we observe during the simulation as shown in Figure EC2 Figure EC2 captures a snapshot of the status of the threads for the Master/Slave structure after starting the APS procedure with 48 slaves From that figure we find that all slaves (denoted as slaves 0 to 47) are working in parallel to generate samples using only a small proportion of the total time Table EC Summary under the SC settings when m 48 Number of alternatives k 0 3 k 0 4 k 0 5 Total samples Makespan (seconds) PCS
9 ec9 Figure EC2 A screenshot of the Master/Slave with the number of processors m 48 References Fabian Vaclav 974 Note on anderson s sequential procedures with triangular boundary The Annals of Statistics Kim S-H B L Nelson James R Wilson 2005 Some almost-sure convergence properties useful in sequential analysis Sequential Anal 24(4) 4 49 Whitt Ward 2002 Stochastic-process limits Springer Series in Operations Research Springer-Verlag New York
Proceedings of the 2016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds.
Proceedings of the 016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds. SPEEDING UP PAIRWISE COMPARISONS FOR LARGE SCALE RANKING AND
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 informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationOverflow Networks: Approximations and Implications to Call-Center Outsourcing
Overflow Networks: Approximations and Implications to Call-Center Outsourcing Itai Gurvich (Northwestern University) Joint work with Ohad Perry (CWI) Call Centers with Overflow λ 1 λ 2 Source of complexity:
More informationFluid Models of Parallel Service Systems under FCFS
Fluid Models of Parallel Service Systems under FCFS Hanqin Zhang Business School, National University of Singapore Joint work with Yuval Nov and Gideon Weiss from The University of Haifa, Israel Queueing
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 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 informationSolution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.
Solutions Stochastic Processes and Simulation II, May 18, 217 Problem 1: Poisson Processes Let {N(t), t } be a homogeneous Poisson Process on (, ) with rate λ. Let {S i, i = 1, 2, } be the points of the
More informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
More informationANALYSIS OF THE LAW OF THE ITERATED LOGARITHM FOR THE IDLE TIME OF A CUSTOMER IN MULTIPHASE QUEUES
International Journal of Pure and Applied Mathematics Volume 66 No. 2 2011, 183-190 ANALYSIS OF THE LAW OF THE ITERATED LOGARITHM FOR THE IDLE TIME OF A CUSTOMER IN MULTIPHASE QUEUES Saulius Minkevičius
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationFair Operation of Multi-Server and Multi-Queue Systems
Fair Operation of Multi-Server and Multi-Queue Systems David Raz School of Computer Science Tel-Aviv University, Tel-Aviv, Israel davidraz@post.tau.ac.il Benjamin Avi-Itzhak RUTCOR, Rutgers University,
More informationElectronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing
Submitted to Management Science manuscript MS-251-27 Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing Rishi Talreja, Ward Whitt Department of
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
OPERATIONS RESEARCH Vol. 6, No. 6, November December 212, pp. 1551 1564 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.114 212 INFORMS Stabilizing Customer Abandonment in
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More informationIndifference-Zone-Free Selection of the Best
Submitted to Operations Research manuscript (Please, provide the manuscript number!) Indifference-Zone-Free Selection of the Best Weiwei Fan Department of Management Science, School of Management, University
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 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 informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationMinimizing Mean Flowtime and Makespan on Master-Slave Systems
Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The
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 informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationManaging Service Systems with an Offline Waiting Option and Customer Abandonment: Companion Note
Managing Service Systems with an Offline Waiting Option and Customer Abandonment: Companion Note Vasiliki Kostami Amy R. Ward September 25, 28 The Amusement Park Ride Setting An amusement park ride departs
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 informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationarxiv:math/ v4 [math.pr] 12 Apr 2007
arxiv:math/612224v4 [math.pr] 12 Apr 27 LARGE CLOSED QUEUEING NETWORKS IN SEMI-MARKOV ENVIRONMENT AND ITS APPLICATION VYACHESLAV M. ABRAMOV Abstract. The paper studies closed queueing networks containing
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 informationMassachusetts Institute of Technology
.203J/6.28J/3.665J/5.073J/6.76J/ESD.26J Quiz Solutions (a)(i) Without loss of generality we can pin down X at any fixed point. X 2 is still uniformly distributed over the square. Assuming that the police
More informationTransient Analysis of a Series Configuration Queueing System
Transient Analysis of a Series Configuration Queueing System Yu-Li Tsai*, Daichi Yanagisawa, and Katsuhiro Nishinari Abstract In this paper, we consider the transient analysis of a popular series configuration
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 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 informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationOne important issue in the study of queueing systems is to characterize departure processes. Study on departure processes was rst initiated by Burke (
The Departure Process of the GI/G/ Queue and Its MacLaurin Series Jian-Qiang Hu Department of Manufacturing Engineering Boston University 5 St. Mary's Street Brookline, MA 2446 Email: hqiang@bu.edu June
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationA Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationM/G/1 queues and Busy Cycle Analysis
queues and Busy Cycle Analysis John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong www.cse.cuhk.edu.hk/ cslui John C.S. Lui (CUHK) Computer Systems Performance
More informationIEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.
IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory Fall 2009, Professor Whitt Class Lecture Notes: Wednesday, September 9. Heavy-Traffic Limits for the GI/G/1 Queue 1. The GI/G/1 Queue We will
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 informationMotivated by models of tenant assignment in public housing, we study approximating deterministic fluid
MANAGEMENT SCIENCE Vol. 54, No. 8, August 2008, pp. 1513 1527 issn 0025-1909 eissn 1526-5501 08 5408 1513 informs doi 10.1287/mnsc.1080.0868 2008 INFORMS Fluid Models for Overloaded Multiclass Many-Server
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationMinimizing response times and queue lengths in systems of parallel queues
Minimizing response times and queue lengths in systems of parallel queues Ger Koole Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
More informationA TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY. Wai-Ki Ching. Tang Li. Sin-Man Choi. Issic K.C. Leung
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY WAI-KI CHING SIN-MAN CHOI TANG
More informationThe Expected Opportunity Cost and Selecting the Optimal Subset
Applied Mathematical Sciences, Vol. 9, 2015, no. 131, 6507-6519 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.58561 The Expected Opportunity Cost and Selecting the Optimal Subset Mohammad
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationMaximum pressure policies for stochastic processing networks
Maximum pressure policies for stochastic processing networks Jim Dai Joint work with Wuqin Lin at Northwestern Univ. The 2011 Lunteren Conference Jim Dai (Georgia Tech) MPPs January 18, 2011 1 / 55 Outline
More informationA Robust Queueing Network Analyzer Based on Indices of Dispersion
A Robust Queueing Network Analyzer Based on Indices of Dispersion Wei You (joint work with Ward Whitt) Columbia University INFORMS 2018, Phoenix November 6, 2018 1/20 Motivation Many complex service systems
More informationIOE 202: lectures 11 and 12 outline
IOE 202: lectures 11 and 12 outline Announcements Last time... Queueing models intro Performance characteristics of a queueing system Steady state analysis of an M/M/1 queueing system Other queueing systems,
More informationAsymptotic Coupling of an SPDE, with Applications to Many-Server Queues
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with
More informationDeparture Processes of a Tandem Network
The 7th International Symposium on perations Research and Its Applications (ISRA 08) Lijiang, China, ctober 31 Novemver 3, 2008 Copyright 2008 RSC & APRC, pp. 98 103 Departure Processes of a Tandem Network
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.7J Fall 213 Lecture 22 12/9/213 Skorokhod Mapping Theorem. Reflected Brownian Motion Content. 1. G/G/1 queueing system 2. One dimensional reflection mapping
More informationA Review of Basic FCLT s
A Review of Basic FCLT s Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, 10027; ww2040@columbia.edu September 10, 2016 Abstract We briefly review
More informationAsymptotics for Polling Models with Limited Service Policies
Asymptotics for Polling Models with Limited Service Policies Woojin Chang School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA Douglas G. Down Department
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
More informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationM/M/3/3 AND M/M/4/4 RETRIAL QUEUES. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
JOURNAL OF INDUSTRIAL AND doi:10.3934/imo.2009.5.431 MANAGEMENT OPTIMIZATION Volume 5, Number 3, August 2009 pp. 431 451 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Tuan Phung-Duc, Hiroyuki Masuyama, Shoi Kasahara
More informationThe Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation.
The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation. Binghamton University Department of Mathematical Sciences
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More information(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 informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationHITTING TIME IN AN ERLANG LOSS SYSTEM
Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations
More 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 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 informationTOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS
TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS by Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636 March 31, 199 Revision: November 9, 199 ABSTRACT
More informationIEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008
IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 Justify your answers; show your work. 1. A sequence of Events. (10 points) Let {B n : n 1} be a sequence of events in
More informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
Submitted to Operations Research manuscript OPRE-29-6-259; OPRE-211-12-597.R1 Stabilizing Customer Abandonment in Many-Server Queues with -Varying Arrivals Yunan Liu Department of Industrial Engineering,
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationA PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS
A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;
More informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationThe G/GI/N Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations
The G/GI/ Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations J. E Reed School of Industrial and Systems Engineering Georgia Institute of Technology October 17, 27 Abstract In this
More informationON THE NON-EXISTENCE OF PRODUCT-FORM SOLUTIONS FOR QUEUEING NETWORKS WITH RETRIALS
ON THE NON-EXISTENCE OF PRODUCT-FORM SOLUTIONS FOR QUEUEING NETWORKS WITH RETRIALS J.R. ARTALEJO, Department of Statistics and Operations Research, Faculty of Mathematics, Complutense University of Madrid,
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
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 informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationQuiz 1 EE 549 Wednesday, Feb. 27, 2008
UNIVERSITY OF SOUTHERN CALIFORNIA, SPRING 2008 1 Quiz 1 EE 549 Wednesday, Feb. 27, 2008 INSTRUCTIONS This quiz lasts for 85 minutes. This quiz is closed book and closed notes. No Calculators or laptops
More informationA.Piunovskiy. University of Liverpool Fluid Approximation to Controlled Markov. Chains with Local Transitions. A.Piunovskiy.
University of Liverpool piunov@liv.ac.uk The Markov Decision Process under consideration is defined by the following elements X = {0, 1, 2,...} is the state space; A is the action space (Borel); p(z x,
More informationarxiv: v1 [math.pr] 11 May 2018
FCFS Parallel Service Systems and Matching Models Ivo Adan a, Igor Kleiner b,, Rhonda Righter c, Gideon Weiss b,, a Eindhoven University of Technology b Department of Statistics, The University of Haifa,
More informationOnline Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates
Online Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates Xu Sun and Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationNetwork Calculus Analysis of Feedback Systems with Random Service. Alireza Shekaramiz
Network Calculus Analysis of Feedback Systems with Random Service by Alireza Shekaramiz A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department
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 informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationCross-Selling in a Call Center with a Heterogeneous Customer Population. Technical Appendix
Cross-Selling in a Call Center with a Heterogeneous Customer opulation Technical Appendix Itay Gurvich Mor Armony Costis Maglaras This technical appendix is dedicated to the completion of the proof of
More informationRegenerative Processes. Maria Vlasiou. June 25, 2018
Regenerative Processes Maria Vlasiou June 25, 218 arxiv:144.563v1 [math.pr] 22 Apr 214 Abstract We review the theory of regenerative processes, which are processes that can be intuitively seen as comprising
More informationOPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS
OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS Xiaofei Fan-Orzechowski Department of Applied Mathematics and Statistics State University of New York at Stony Brook Stony
More informationThe Fluid Limit of an Overloaded Processor Sharing Queue
MATHEMATICS OF OPERATIONS RESEARCH Vol. 31, No. 2, May 26, pp. 316 35 issn 364-765X eissn 1526-5471 6 312 316 informs doi 1.1287/moor.15.181 26 INFORMS The Fluid Limit of an Overloaded Processor Sharing
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 informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More information