Loading in 2 Seconds...

On the Variance of Output Counts of Some Queueing Systems

Loading in 2 Seconds...

- 88 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' On the Variance of Output Counts of Some Queueing Systems' - dante-carrillo

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

### On the Variance ofOutput Counts of SomeQueueing Systems

Overview

Yoni Nazarathy

Gideon Weiss

SE Club, TU/e

April 20, 2008

Overview

- Introduction and background
- Results for M/M/1/K
- Results for Re-entrant lines
- Possible Future Work

The Classic Theorem on M/M/1 Outputs:Burkes Theorem (50’s):

Output process of stationary version is Poisson ( ).

A Bit On Queueing Output ProcessesA Single Server Queue:

Server

Buffer

…

State:

2

3

4

5

0

1

6

M/M/1 Queue:

- Poisson Arrivals:

- Exponential Service times:

- State Process is a birth-death CTMC

OutputProcess:

Problem Domain: Analysis of Output Processes

PLANT

OUTPUT

- Desired:
- High Throughput
- Low Variability

Model as a Queueing System

Variability of Outputs

Asymptotic Variance Rate of Outputs

For Renewal Processes:

Plant

Example 1: Stationary stable M/M/1, D(t) is PoissonProcess( ):

Example 2: Stationary M/M/1/1 with . D(t) is RenewalProcess(Erlang(2, )):

Previous Work: Numerical

Taken from Baris Tan, ANOR, 2000.

Summary of our Results

Queueing System Without Losses

Finite Capacity Birth Death Queue

Push Pull Queueing Network

Infinite Supply Re-Entrant Line

Overview

- Introduction and background
- Results for M/M/1/K
- Results for Re-entrant lines
- Possible Future Work

What values do we expect for ?

Keep and fixed.

What values do we expect for ?

Keep and fixed.

What values do we expect for ?

Keep and fixed.

Scope: Finite, irreducible, stationary,birth-death CTMC that represents a queue.

(Asymptotic Variance Rate of Output Process)

Part (i)

Part (ii)

Calculation of

If

and

Then

Overview

- Introduction and background
- Results for M/M/1/K
- Results for Re-entrant lines
- Possible Future Work

Stability Resultfor Re-entrant Line (Guo, Zhang, 2008 – Pre-print)

Queues

Residuals

is Markov with state space

Theorem (Guo Zhang):X(t) is positive (Harris) recurrent.

- Proof follows framework of Jim Dai (1995)
- 2 Things to Prove:
- Stability of fluid limit model
- Compact sets are petite

Note: We have similar result for Push-Pull Network.

Positive Harris Recurrence: There exists,

Proof Method: Find diffusion limit of:

It is Brownian Motion

Remember for renewal Process:

- Introduction and background
- Results for M/M/1/K
- Results for Re-entrant lines
- Possible Future Work

Remember:

There is bias due to intercept:

Alternative:

Smith (50’s), Brown Solomon (1975)

Use “Regenerative Simulation”:

Future Work:

Number Customers Served

Busy Cycle Duration

???

Download Presentation

Connecting to Server..