CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK
|
|
- Arnold Randall
- 5 years ago
- Views:
Transcription
1 CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation models in the study of feedback and cyclic queue network. Assuming various hypothetical situations different authors have introduced various models to promote the theory to apply in practical situations. It may be observed that the mathematical tools applied in the analysis are really elegant, in spite of the fact that many such models lack practical applicability in real life situations. Here a brief outline of some chosen work is given in a series by which they have developed to meet real life situations. Feedback queues relate to those queues in which a customer served once, when his service becomes unsuccessful and are served again and again till his service becomes successful (Takacs [1963], Kleinrock [1975], Takagi [1987], Singh T.P. [1996]).. Section 3.1 of chapter 3 based on the paper Transient Analysis of Three Tandem Feedback Queue System with Service Parameter Constraints, Yamuna Journal of Technology & Business Research [2011]. Vol. 1, No. 1-2, pp Section 3.2 of chapter 3 based on the paper Mathematical Analysis of a General Feedback Queue Tandem Network, Presented and Published in the Proceeding of 6 th International Multi Conference on Intelligent System, Sustainable, New and Renewable Energy Technology & Nanotechnology [ISSN 2012], ISTK March 16-18, [2012]. pp
2 Many real life situations could be modeled as a feedback queue for example, in data transmission a packet transmitted from the source to the destination may be returned and it may go on like until the packet is finally transmitted. A vast amount of research in the field of feedback and cyclic queue model has been conducted by the academic community during the past several decades (Burke s [1956], Jackson [1957], Finch P.D. [1959], Buchan & Koiengsberg [1958], Singh T.P. [1994]). Jackson did a remarkable work in the field of queue network theory. Let us assume that units (customers/message/packets) arrive singly in a Poisson stream with rate λ and that the service time is general. As soon as the service is completed, a unit whose service is successful apart from the system with probability p or if service is unsuccessful the unit is cycled back into the system with probability (1-p). This is known as Bernoulli feedback. The unit or customers may enter the system at some node, traverse from node to node in the system, and depart from some node, not all customers necessarily entering and leaving at the same node, or taking the same path once having entered the system customer may return to nodes previously visited, skip some nodes entirely and even choose to remain in the system forever. In contrast to Jackson s open network, Gordan and Newell [1967] consider a close network of Markovian queues in which a fixed and finite number of customers say (K) circulate through the network, there being no external input or departure from the network. If we consider a close network of k nodes such that the output of nodes i goes to the next node i+1 ( 1 i i-1) where as the output the last node k feedback the node i and so on. Such a queue is called a 76
3 cyclic queue. A cyclic queue system consists of several service channels arranged in series, the end s of which are joined to form a closed circle. Singh T.P. [1994] extended the study made by various researchers in network of cyclic queue. Further Singh T.P., Kusum [2010] made the analytical study of feedback queue model in detail assuming service rate proportional to queue numbers and heterogeneous channels with feedback. This work is further a generalized work in the field feedback queue made by earlier researchers. The chapter is divided into two sections Section Transient behavior of three stage feedback queue system: A specific study Section Feedback queue network with applications: A Generalized model SECTION 3.1 TRANSIENT BEHAVIOR OF THREE STAGE FEEDBACK QUEUE SYSTEM This section studies a network of three queues in series with feedback from the third server under poison assumption of both arrival and departure. We assume the service rate proportional to their respective queue number. The differential difference equation has been explored in transient form. The mean queue size and other parameters for the queue model have been derived by using statistical tools. The model finds its application in banking service system, administrative set up and in decision making process. The transient behavior of the system has been studied and the differential difference equation so formed in the model is being solved by using generating 77
4 function technique and Lagrange s method of solution for partial differential equation. The aim of the section is to investigate various queue characteristics like mean queue length, variance etc. of the queue system which are useful in decision making process, manufacturing concern, banking service system and administrative set up etc PROBLEM FORMULATION: Consider a system of three service nodes say S 1, S 2, S 3. Customers or items arrive in Poisson process at S 1, and then go though S 2 and S 3 for required service, the service pattern at both the nodes are exponentially distributed. Let be mean arrival rate at s 1 and denotes exponential service parameters at S 1, S 2, S 3. Customer after service at S 1 go though mode S 2 and then S 3 in a tandem queue while customer at S 3 is either depart with probability p 3 or feed back to server s 1 with probability p 31. Such that p 3 +p 31 =1.It is further assumed that service parameters are directly proportional to their respective queue numbers defined by µ =, µ =, µ = MATHEMATICAL MODELING: Define the probability at time (t), there are n 1, n 2, n 3 items in system in front of nodes S 1, S 2, S 3 (n 1 n 2, n 3 >0), λ p 3 S 1 S 2 S 3 p 31 Figure Connecting the various state probabilities at time t+ time dependent differential difference equations for the model are obtained as: 78
5 (3.1.1) (3.1.2) (3.1.3) (3.1.4) (3.1.5) (3.1.6) (3.1.7) 79
6 (3.1.8) Taking initial condition at t=0 as, = 0 (3.1.9) SOLUTION METHODOLOGY: To solve the system of equations (3.1.1) to (3.1.8) we apply generating function technique. For this define g.f.t as: F(x, y,z, t) = (3.2.10) (3.2.11) (3.2.12) = (3.2.13) F(x, y, z, t)= (3.2.14) Solving (3.1.1) to (3.1.8) on the line of Maggu [1981] & Singh T.P. [1984],Using equations (3.1.10),(3.1.11), (3.1.12),(3.1.13) in (3.1.1) to (3.1.8) and applying initial condition (3.1.9), after simplifying, ultimate solution in transient form can be expressed as :- (3.1.15) 80
7 As the equation (3.1.15) is linear partial differential equation of first order in four independent variable x, y, z & t the Lagrange s Auxiliary Equations are given by (3.1.16) Now we proceed to obtain four independent solutions of (3.1.16). For this applying the solution technique of Lagrange s Auxiliary Equation, we have On integration we get, C 1 = (3.1.17) And + y (3.1.18) Similarly, C 2 = (3.1.19) + z (3.1.20) And C 3 = (3.1.21) (3.1.22) From (3.1.18), (3.1.20), (3.1.22), values of x, y, z are, x = (3.1.23) y (3.1.24) z (3.1.25) 81
8 using equation (3.1.16), C 4 =F (3.1.26) The general solution Ø(C 1, C 2,C 3,C 4 )=0 becomes, Ø =0 (3.1.27) Where Ø is an arbitrary function. The general solution of (3.1.27) is given by F = Using feedback initial condition F(x, y, z, 0) =1 in (3.1.28) we get, at t=0, (3.1.28) = (3.1.29) Taking C 1, C 2, C 3 at t=0,, (3.1.30) Using (3.1.30) in (3.1.29) we get (3.1.31) = 82
9 Now put the values of C 1, C 2 and C 3 from equations (3.1.17), (3.1.19), (3.1.21) in (3.1.31) then we get = (3.1.32) Putting the value from (3.1.32) to (3.1.28), we have F(x,y,z,t)= F(x,y,z,t)=exp (3.1.33) exp exp exp Which further written as F(x,y,z,t)= (3.1.34) Where A= B= 83
10 C= -(A+B+C)= (3.1.35) In order to find out we proceed as follows Since, F(x,y,z,t) = powers of x,y,z. represents as coefficient of in the expansion of (3.1.34) in i.e = (3.1.36) Using values of A, B and C in (3.1.36), we have = (3.1.37) which gives the required transient solution of the problem (a) MEAN QUEUE SIZE : Let the mean queue size be denoted by L. Then L as per statistical formula is defined as L= Now putting from (3.1.36), we have 84
11 L= L= = = [C + (A+B) ] =A+B+C (3.1.38) (3.1.38) with the help of (3.1.35) on simplification gives the value of L, L= ( ) (b) STEADY STATE SOLUTION: The steady state solution of the model can be found in the usual manner by letting t. Hence when t equation (3.1.37) gives the corresponding steady state probability, as = (3.1.40) 85
12 Also the mean queue size L of the system in the steady state case is obtained by letting t in (3.1.39) which is as L = (3.1.41) 3.1.3(c) PARTICULAR CASE: On letting & and no feedback from third server, then one can easily obtain the result of the model that corresponds to the M M 1 queueing model discussed by Gross and Harries. For this if we identify = P n (t) (with n 1 =n, ) Then the result (3.1.37) corresponds to P n (t) = n 0 (3.1.42) On the similar line one can also easily identify the study state results corresponds to (3.1.40) & (3.1.41) as P n = n 0 (3.1.43) There will be no queue length & a balance is maintained between arrival pattern and service pattern. Other parameters such as variance, busy period distribution etc. can be calculated by using standard statistical formulae. 86
13 SECTION 3.2 GENERALISED FEEDBACK QUEUE MODEL WITH APPLICATIONS This section studies the steady state behavior of a feedback queue network in which after service at a serial channel the customer/items has two choices either to proceed to next or to feedback to one preceding channel. The arrivals and departure both follow the Poisson law at each channel. The Generating function technique (g. f. t), L-Hospital rule, laws of calculus & statistical formulae of Marginal probability distribution has been applied as a solution methodology in order to find various queue parameters. The objective of the study is to find out the mean queue size of each channel and for the entire system. The model is supported by numerical illustration MODEL DESCRIPTION: The model comprises of three service channels in tandem such that a unit or customer after service at initial channel either depart from the system or enter into the next succeeding channel for further operation. After getting service in the second service channel the items found defective are sent back &in similar fashion the units proceed to third channel. The steady state behavior of the system has been studied by applying the Generating function technique, L-Hospital rule & statistical formulae of Marginal probability distribution in order to find various queue parameters. The arrival and departure are assumed to be Poisson distributed. The mean queue size for each channel has been obtained for a decision making process. 87
14 3.2.2 PROBLEM FORMULATION: The units/customers in a Poisson stream at mean rate λ, demanding three phase services first arrive at S 1. Phase one service is completed at S 1 and Phase two service is completed at S 2 and Phase three service is completed at S 3 in a serial order. After phase one, the units either depart from the system at S 1 with probability p 1 or it goes through second channel S 2 with probability P 12 such that P 1 +P 12 = 1.After completing service S 2, the units either depart with probability p 2 or go to next channel with probability p 23 or feedback to preceding channel S 1 with probability p 21 (if items are found defective), such that p 2 +p 21 +p 23 =1.Similarly at S 3 the units either depart with probability p 3 or feedback to preceding channel S 2 with probability p 32 if items are found defective or feedback to channel S 1 with probability p 31, such that p 3 +p 31 +p 32 =1 The service parameters are assumed to be μ 1, μ 2, μ 3. p 1 p 2 p 3 λ p 12 p 23 S 1 S 2 S 3 p 21 p 32 p 31 figure MATHEMATICAL ANALYSIS OF QUEUE MODEL:- Define the probability, there are n 1 units in system in front of S 1, n 2 units in front of S 2, and n 3 units in front of S 3,. The standard argument leads to the following differential difference equations in steady state 88
15 (3.2.1) (3.2.2) (3.2.3) (3.2.4) (3.2.5) (3.2.6) (3.2.7) 89
16 (3.2.8) SOLUTION METHODOLOGY: To solve the system of equations (3.2.1) to (3.2.8) we apply generating function technique. For this define g.f.t as: F(x, y,z) = (3.2.9) (3.2.10) (3.2.11) = (3.2.12) F(x,y,z)= (3.2.13) Multiply (3.2.1) by and summing over n 1 from 0 to using (3.1.2) and (3.2.10). + = (3.2.14) 90
17 Multiply (3.2.3) by and summing over n 1 from 0 to using (3.2.5) and (3.2.10). + = (3.2.15) Multiply (3.2.4) by and summing over n 1 from 0 to using (3.2.7) and (3.2.10). + = (3.2.16) Multiply (3.2.6) by and summing over n 1 from 0 to using (3.2.8) and ( ). + = (3.2.17) Multiply (3.2.14) by and summing over n 2 from 0 to using (3.1.15) and (3.2.12). + + = (3.2.18) 91
18 Multiply (3.2.16) by and summing over n 2 from 0 to using (3.2.17) and (3.2.12). + = (3.2.19) Multiply (3.2.18) by and summing over n 3 from 0 to using (3.2.19) and (3.2.13) (3.2.20) On further simplification, (3.2.20) can be written as- [ (1-x) + + ] = + + (3.2.21) 92
19 Identity, =F 0, =F 1, =F 2 Where Now we find the value of, using L-Hospital rule for limits in case of indeterminate form and using the relation F(1,1,1)=1,the following results are obtained- 93
20 3.2.4(a) MEAN QUEUE LENGTH: The mean queue length L Q of the system is given by- L = L Q1 +L Q2 +L Q3 Now differentiating partially w.r.t. x we get- =
21 + Now, we calculate- (3.2.22) Now putting the values in equation (3.2.22) we get, (3.2.23) (3.2.24) (3.2.25) Mean Queue length: L Q = L Q1 +L Q2 +L Q3 + (3.2.26) 3.2.4(b) WAITING TIME IN QUEUE (W q ) = 95
22 3.2.5 NUMERICAL ILLUSTRATION: For a particular system taking following parameters, =8, =10, =14, λ=6, p 1 =.7, p 12 =.3, p 2 =.5, p 21 =.1, p 23 =.4,p 3 =.5, p 32 =.3, p 31 =.2, then we can find mean queue length and waiting time. After putting these values in the marginal queue length we get the expected queue length: =10, =0.44, =0.14 Then the mean queue length becomes: L = L Q1 + L Q2 + L Q3 = =10.58 W q = L Q /λ =10.58/6 = APPLICATION: The model finds its applications in different situations arising in manufacturing concern, office management, computer networking, banking service system, administrative set up, industrial concern etc. in manufacturing areas e.g. Consider the items which have three stages production, after first stage machine operation, the defective part of production item is dropped at back stage and non defective items are passed to next stage machine for further operation. At second stage machine, either item are dropped if it is defective, or it is sent to first stage for 96
23 reprocessing or sent to next third successive stage machine for further operation. For example, In glass cum soft drink industry we find that the services are done in distinct phases, from phase two the bottles which have defect in shape and sizes are sent back as a raw material to initial phase, from next phase leaked bottles or having some non traceable defects are sent back to phase two or one. The filled bottles are further sent for corking at next phase or not suitable for corking are sent back to initial one. Similarly, in an administrative set up files are sent from one section to second section for remarks then to final authority for checking or the authority either pass the file or sent back to initial one for further clarification. The concept of Network has been found to be very useful in the formulation and modeling of computer, communication, banking and other such system. Queuing network serve as model for multi programmed computer system and communication networks and certain parts manufacturing system. In some multistage queuing process recycling or feedback may occur. Recycling is common in manufacturing processes, where quality control inspections are performed after certain stages, and parts that do not meet quality standards are sent back for reprocessing. Similarly, a telecommunications network may process massages through a randomly selected sequence of nodes with the probability that some messages will require rerouting on occasion through the same stage CONCLUSION: The Aims of this study was to develop the Mathematical model for feedback queue network that would reflect a valuable data in industry. Two models in this study have been proposed. The mean queue length of entire system helps the decision maker how to redesign the queue system so that congestion can be minimized and the service system may no longer be idle. 97
Steady State Behavior Of a Network Queue Model Comprised of Two Bi-serial Channels Linked with a Common Server
Steady State Behavior Of a Network Queue Model Comprised of Two Bi-serial Channels Linked with a Common Server Deepak Gupta Prof. & Head, Dept of Mathematics Maharishi Markandeshwar University Mullana,
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 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 informationSandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue
Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
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 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 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 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 informationNetwork Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model
2st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 205 wwwmssanzorgau/modsim205 Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow
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 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 informationQueuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More 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 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 informationExam of Discrete Event Systems
Exam of Discrete Event Systems - 04.02.2016 Exercise 1 A molecule can switch among three equilibrium states, denoted by A, B and C. Feasible state transitions are from A to B, from C to A, and from B to
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 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 informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
More informationA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South
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 informationMultiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationReview of Queuing Models
Review of Queuing Models Recitation, Apr. 1st Guillaume Roels 15.763J Manufacturing System and Supply Chain Design http://michael.toren.net/slides/ipqueue/slide001.html 2005 Guillaume Roels Outline Overview,
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationA Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time E. Ramesh Kumar 1, L. Poornima 2 1 Associate Professor, Department of Mathematics, CMS College of Science
More informationQueuing Analysis of Markovian Queue Having Two Heterogeneous Servers with Catastrophes using Matrix Geometric Technique
International Journal of Statistics and Systems ISSN 0973-2675 Volume 12, Number 2 (2017), pp. 205-212 Research India Publications http://www.ripublication.com Queuing Analysis of Markovian Queue Having
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More 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 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 information16:330:543 Communication Networks I Midterm Exam November 7, 2005
l l l l l l l l 1 3 np n = ρ 1 ρ = λ µ λ. n= T = E[N] = 1 λ µ λ = 1 µ 1. 16:33:543 Communication Networks I Midterm Exam November 7, 5 You have 16 minutes to complete this four problem exam. If you know
More informationA MATHEMATICAL MODEL FOR LINKAGE OF A QUEUING NETWORK WITH A FLOW SHOP SCHEDULING SYSTEM
IJMS, Vol., No. -4, (July-December 202), pp. 97-2 Serials Publications ISSN: 0972-754X A MATHEMATICAL MODEL FOR LINKAGE OF A QUEUING NETWORK WITH A FLOW SHOP SCHEDULING SYSTEM Deepak Gupta, Sameer Sharma
More informationA Retrial Queueing model with FDL at OBS core node
A Retrial Queueing model with FDL at OBS core node Chuong Dang Thanh a, Duc Pham Trung a, Thang Doan Van b a Faculty of Information Technology, College of Sciences, Hue University, Hue, Viet Nam. E-mail:
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More information10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL.
Bibliography Asmussen, S. (2003). Applied probability and queues (2nd ed). New York: Springer. Baccelli, F., & Bremaud, P. (2003). Elements of queueing theory: Palm martingale calculus and stochastic recurrences
More informationMONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL
Volume 117 No. 13 2017, 271-282 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN
More informationThe Passport Control Problem or How to Keep an Unstable Service System Load Balanced?
The Passport Control Problem or How to Keep an Unstable Service System Load Balanced? A. ITAI Computer Science Department, Technion M. RODEH Computer Science Department, Technion H. SHACHNAI Computer Science
More informationWaiting Time Analysis of A Single Server Queue in an Out- Patient Clinic
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in
More 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 informationSection 3.3: Discrete-Event Simulation Examples
Section 33: Discrete-Event Simulation Examples Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 33: Discrete-Event Simulation
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
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 informationPriority Queueing System with a Single Server Serving Two Queues M [X 1], M [X 2] /G 1, G 2 /1 with Balking and Optional Server Vacation
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 11, Issue 1 (June 216), pp. 61 82 Applications and Applied Mathematics: An International Journal (AAM) Priority Queueing System
More informationI, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.
A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu
More informationQueuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.
Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals
More 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 informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationA discrete-time priority queue with train arrivals
A discrete-time priority queue with train arrivals Joris Walraevens, Sabine Wittevrongel and Herwig Bruneel SMACS Research Group Department of Telecommunications and Information Processing (IR07) Ghent
More informationPerformance analysis of queueing systems with resequencing
UNIVERSITÀ DEGLI STUDI DI SALERNO Dipartimento di Matematica Dottorato di Ricerca in Matematica XIV ciclo - Nuova serie Performance analysis of queueing systems with resequencing Candidato: Caraccio Ilaria
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 informationBasic Queueing Theory
After The Race The Boston Marathon is a local institution with over a century of history and tradition. The race is run on Patriot s Day, starting on the Hopkinton green and ending at the Prudential Center
More 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 informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
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 informationSystem occupancy of a two-class batch-service queue with class-dependent variable server capacity
System occupancy of a two-class batch-service queue with class-dependent variable server capacity Jens Baetens 1, Bart Steyaert 1, Dieter Claeys 1,2, and Herwig Bruneel 1 1 SMACS Research Group, Dept.
More informationIEOR 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 informationChapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model
Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More 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 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 informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationReview Paper Machine Repair Problem with Spares and N-Policy Vacation
Research Journal of Recent Sciences ISSN 2277-2502 Res.J.Recent Sci. Review Paper Machine Repair Problem with Spares and N-Policy Vacation Abstract Sharma D.C. School of Mathematics Statistics and Computational
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationb. ( ) ( ) ( ) ( ) ( ) 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 informationTHE INTERCHANGEABILITY OF./M/1 QUEUES IN SERIES. 1. Introduction
THE INTERCHANGEABILITY OF./M/1 QUEUES IN SERIES J. Appl. Prob. 16, 690-695 (1979) Printed in Israel? Applied Probability Trust 1979 RICHARD R. WEBER,* University of Cambridge Abstract A series of queues
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 informationDefinition and Examples of DTMCs
Definition and Examples of DTMCs Natarajan Gautam Department of Industrial and Systems Engineering Texas A&M University 235A Zachry, College Station, TX 77843-3131 Email: gautam@tamuedu Phone: 979-845-5458
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationNon-Persistent Retrial Queueing System with Two Types of Heterogeneous Service
Global Journal of Theoretical and Applied Mathematics Sciences. ISSN 2248-9916 Volume 1, Number 2 (211), pp. 157-164 Research India Publications http://www.ripublication.com Non-Persistent Retrial Queueing
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationOn optimization of a Coxian queueing model with two phases
AppliedandComputationalMathematics 204; 3(2): 43-47 Published online March 20, 204 (http://www.sciencepublishinggroup.com/j/acm) doi: 0.648/j.acm.2040302. On optimization of a Coxian queueing model with
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More 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 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 informationM [X] /G/1 with Second Optional Service, Multiple Vacation, Breakdown and Repair
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 3-9364, ISSN (Print): 3-9356 Volume Issue ǁ November. 4 ǁ PP.7-77 M [X] /G/ with Second Optional Service, Multiple Vacation,
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More 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 informationTwo Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server
Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server S. Jehoashan Kingsly 1, S. Padmasekaran and K. Jeganathan 3 1 Department of Mathematics, Adhiyamaan
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 information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
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 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 informationA Simple Memoryless Proof of the Capacity of the Exponential Server Timing Channel
A Simple Memoryless Proof of the Capacity of the Exponential Server iming Channel odd P. Coleman ECE Department Coordinated Science Laboratory University of Illinois colemant@illinois.edu Abstract his
More informationEngineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)
More 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 informationStrategic Dynamic Jockeying Between Two Parallel Queues
Strategic Dynamic Jockeying Between Two Parallel Queues Amin Dehghanian 1 and Jeffrey P. Kharoufeh 2 Department of Industrial Engineering University of Pittsburgh 1048 Benedum Hall 3700 O Hara Street Pittsburgh,
More informationOperations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:
Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam 1 2 3 4 5 6 7 8 9 10 7 questions. 1. [5+5] Let X and Y be independent exponential random variables where X has
More 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 informationQueueing 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 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 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 informationInequality Comparisons and Traffic Smoothing in Multi-Stage ATM Multiplexers
IEEE Proceedings of the International Conference on Communications, 2000 Inequality Comparisons and raffic Smoothing in Multi-Stage AM Multiplexers Michael J. Neely MI -- LIDS mjneely@mit.edu Abstract
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 informationRetrial queue for cloud systems with separated processing and storage units
Retrial queue for cloud systems with separated processing and storage units Tuan Phung-Duc Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro-ku, Tokyo, Japan
More informationSPREADSHEET SIMULATION: ICT ENABLED TEACHING OF OPERATIONS RESEARCH
Bulletin of the Marathwada Mathematical Society Vol. 14, No. 1, June 2013, Pages 23 31. SPREADSHEET SIMULATION: ICT ENABLED TEACHING OF OPERATIONS RESEARCH S. B. Kalyankar S.A.S. Mahavidylaya, Mukhed,
More informationChapter 2 SIMULATION BASICS. 1. Chapter Overview. 2. Introduction
Chapter 2 SIMULATION BASICS 1. Chapter Overview This chapter has been written to introduce the topic of discreteevent simulation. To comprehend the material presented in this chapter, some background in
More informationreversed chain is ergodic and has the same equilibrium probabilities (check that π j =
Lecture 10 Networks of queues In this lecture we shall finally get around to consider what happens when queues are part of networks (which, after all, is the topic of the course). Firstly we shall need
More information