ECE697AA Lecture 17. Birth-Death Processes

Similar documents
Introduction to Continuous-Time Markov Chains and Queueing Theory

Analysis of Discrete Time Queues (Section 4.6)

Queueing Networks II Network Performance

TCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis

Queuing system theory

Equilibrium Analysis of the M/G/1 Queue

Birth Death Processes

Assignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

Applied Stochastic Processes

Priority Queuing with Finite Buffer Size and Randomized Push-out Mechanism

6. Stochastic processes (2)

6. Stochastic processes (2)

Network of Markovian Queues. Lecture

Review: Discrete Event Random Processes. Hongwei Zhang

Continuous Time Markov Chain

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1

A queuing theory approach to compare job shop and lean work cell considering transportations

Meenu Gupta, Man Singh & Deepak Gupta

Suggested solutions for the exam in SF2863 Systems Engineering. June 12,

EURANDOM PREPRINT SERIES October, Performance analysis of polling systems with retrials and glue periods

Departure Process from a M/M/m/ Queue

Continuous Time Markov Chains

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9

Buffer Dumping Management for High Speed Routers

Adaptive Dynamical Polling in Wireless Networks

Order Full Rate, Leadtime Variability, and Advance Demand Information in an Assemble- To-Order System

Lecture 4: November 17, Part 1 Single Buffer Management

Minimisation of the Average Response Time in a Cluster of Servers

NOVEL ANALYSIS METHOD FOR OPTICAL PACKET SWITCHING NODES

Application of Queuing Theory to Waiting Time of Out-Patients in Hospitals.

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

Linear Regression Analysis: Terminology and Notation

Differentiating Gaussian Processes

Systematic Error Illustration of Bias. Sources of Systematic Errors. Effects of Systematic Errors 9/23/2009. Instrument Errors Method Errors Personal

CS 798: Homework Assignment 2 (Probability)

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

Statistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation

FEATURE ANALYSIS ON QUEUE LENGTH OF ASYMMETRIC TWO-QUEUE POLLING SYSTEM WITH GATED SERVICES *

Motivated by large-scale service systems with network structure, we introduced in a previous paper a

Lecture 2 M/G/1 queues. M/G/1-queue

arxiv: v1 [math.pr] 19 Oct 2016

Homework Assignment 3 Due in class, Thursday October 15

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

Use Subsurface Altitude and Groundwater Level Variations to Estimate Land Subsidence in Choushui River Alluvial Fan, Taiwan. Reporter : Ya-Yun Zheng

Rapporto di Ricerca CS Simonetta Balsamo, Andrea Marin. On representing multiclass M/M/k queue by Generalized Stochastic Petri Net

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification

Uncertainty in measurements of power and energy on power networks

Method for Fast Estimation of Contact Centre Parameters Using Erlang C Model

Markov Chain Monte Carlo Lecture 6

BMAP/M/C Bulk Service Queue with Randomly Varying Environment

Performance-Energy Trade-off in Multi-Server Queueing Systems with Setup Delay

Rockefeller College University at Albany

STAT 511 FINAL EXAM NAME Spring 2001

A conditional probability approach to M/G/1-like queues

T E C O L O T E R E S E A R C H, I N C.

Chapter 14 Simple Linear Regression

JOHANNES KEPLER UNIVERSITÄT LINZ BERICHTE DER MATHEMATISCHEN INSTITUTE

CIE4801 Transportation and spatial modelling Trip distribution

Structure and Drive Paul A. Jensen Copyright July 20, 2003

ON A CLASS OF RENEWAL QUEUEING AND RISK PROCESSES

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva

>>> SOLUTIONS <<< Comprehensive Final Exam for Computer Networks (CNT 6215) Fall 2011

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

Title: Radiative transitions and spectral broadening

COMPLETE BUFFER SHARING IN ATM NETWORKS UNDER BURSTY ARRIVALS

Contents & objectives

Providing Real-Time Guarantees

IS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Error Probability for M Signals

CS418 Operating Systems

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis

A Multi-Stage Queue Approach to Solving Customer Congestion Problem in a Restaurant

M/G/1 POLLING SYSTEMS WITH RANDOM VISIT TIMES

Chapter 11: Simple Linear Regression and Correlation

Chapter 13: Multiple Regression

Self-Adaptive Admission Control Policies for Resource-Sharing Systems

Lecture Notes for STATISTICAL METHODS FOR BUSINESS II BMGT 212. Chapters 14, 15 & 16. Professor Ahmadi, Ph.D. Department of Management

Performance Evaluation of Queuing Systems

Statistical Evaluation of WATFLOOD

Iterative approximation of k-limited polling systems

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

The Ordinary Least Squares (OLS) Estimator

Lectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 5. Monotonicity and Saturation Rule

Analysis of Queuing Delay in Multimedia Gateway Call Routing

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Transient results for M/M/1/c queues via path counting. M. Hlynka*, L.M. Hurajt and M. Cylwa

Response time in a tandem queue with blocking, Markovian arrivals and phase-type services

ECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

Chapter 15 - Multiple Regression

Frequency-Domain Analysis of Transmission Line Circuits (Part 1)

Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture k r Factorial Designs with Replication

Modeling a Small Scale Business Outfit With M/M/1 Markovian Queuing Process and Revenue Analysis

Research on Route guidance of logistic scheduling problem under fuzzy time window

PHYS 705: Classical Mechanics. Calculus of Variations II

Transcription:

Tlman Wolf Department of Electrcal and Computer Engneerng /4/8 ECE697AA ecture 7 Queung Systems II ECE697AA /4/8 Uass Amherst Tlman Wolf Brth-Death Processes Solvng general arov chan can be dffcult Smpler, constraned verson: brth-death process Transtons are only allowed between neghborng states Transton rates: brth rate and death rate Brth-death process: atrx form: O Q

ECE697AA /4/8 Uass Amherst Tlman Wolf Steady State of Brth-Death Processes Steady state equatons: - - - - Solvng for : / / In general:, What about? Sum of probabltes must be Convergence crteron:, > : / < O Q ECE697AA /4/8 Uass Amherst Tlman Wolf 4 Brth-Death Process Example Smplest example All brth rates are the same All death rates are the same Solve : Then : Represent utlzaton ρ/ -ρρ Geometrc dstrbuton wth parameter p-ρ / /

Brth-Death Process Example ean number of customers n system: N ρ ρ ρ ρ Wth ttle s law: TN///-ρ Qρ /-ρ So, fnally: Wth ncreasng load, queue length and watng tme ncrease ECE697AA /4/8 Uass Amherst Tlman Wolf 5 Kendall s Notaton There are many dfferent queung systems Notaton ndcates type of arrval and servce Exponental dstrbuton memoryless D Determnstc dstrbuton G General dstrbuton Queung dscplne ndcates Arrval process Servce process Number of servers E.g.: // Smplest case prevous example ECE697AA /4/8 Uass Amherst Tlman Wolf 6

// queung model // results: Brth-death process wth and» -ρρ» -ρ Average number of jobs n system» Kρ/-ρ Average response tme» TN/ / -ρ ean queue length» Qρ /-ρ What are the assumptons? Exponentally dstrbuted nterarrval and servce tmes ECE697AA /4/8 Uass Amherst Tlman Wolf 7 /G/ queung model Servce tme s not exponentally dstrbuted What does pacet transmsson tme depend on?» Pacet sze» n speed constant We need dfferent model Generalzed dstrbuton for servce tme How can we model such a servce tme? From pont of vew of arrvng job Watng tme depends on» Remanng servce tme of current job W» Sum of mean servce tmes of jobs n queue Q E[X] Thus, WW Q E[X] ECE697AA /4/8 Uass Amherst Tlman Wolf 8 4

/G/ queung model Expected servce tme s ndependently dstrbuted Use ttle s law» WW Q E[X] W W E[X] Wth E[X]/» WW ρ W Solve for W» WW /-ρ What s value of W? Depends f server s busy or not W P[busy] RP[not busy] How can we determne mean resdual lfe R? Result from Klenroc» R/ E[X ]/E[X]/ E[X]c X c X, where c s coeffcent of varaton c X σ X /E[X] normalzed standard devaton ECE697AA /4/8 Uass Amherst Tlman Wolf 9 /G/ queung model Total watng tme: WW /-ρρ/-ρ / E[X]c X Wth ttle s law Q W and E[X]/: ρ cx ρ E[ X ] Q ρ ρ E[ X ] Pollacze-Khntchne formula Santy chec: Exponental dstrbuton for G» σ X /, E[X]/,c X σ X /E[X]» Qρ /-ρ ECE697AA /4/8 Uass Amherst Tlman Wolf 5

/D/ queung model Determnstc servce tme Examples Servce of requests» Web page» DNS looup emory access Coeffcent of varaton c X Queung tme Q/ ρ /-ρ ECE697AA /4/8 Uass Amherst Tlman Wolf /G/ // comparson How much do /G/ and // dffer? Assume networ traffc //» Servce tme exponentally dstrbuted /G/» Servce tme proportonal to pacet sze Queue length ρ c ρ /G/ queue shorter f X < ρ ρ Need c X for pacets What s the dstrbuton of pacet lengths? ECE697AA /4/8 Uass Amherst Tlman Wolf 6

From NANR: E[X]54 E[X ]5755 σ X 598 c X.687 c X.844 Thus c X // s too optmstc Pacet length dstrbuton.844 > ECE697AA /4/8 Uass Amherst Tlman Wolf Homewor Read Nc ckeown, Pravn Varaya, and Jean Walrand, Schedulng cells n an nput-queued swtch, IEEE Electroncs etters, vol. 9, no. 5, pp. 74 75, Dec. 99. SPARK Assessment quz ECE697AA /4/8 Uass Amherst Tlman Wolf 4 7