Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Asymptotic Variance Rate of the Output Process of.

Slides:



Advertisements
Similar presentations
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Advertisements

Flows and Networks Plan for today (lecture 2): Questions? Continuous time Markov chain Birth-death process Example: pure birth process Example: pure death.
TCOM 501: Networking Theory & Fundamentals
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Balancing Reduces Asymptotic Variance of Outputs Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. Based on some joint works.
Lecture 13 – Continuous-Time Markov Chains
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
TCOM 501: Networking Theory & Fundamentals
A gentle introduction to fluid and diffusion limits for queues Presented by: Varun Gupta April 12, 2006.
1 Overview of Queueing Systems Michalis Faloutsos Archana Yordanos The web.
Finite Buffer Fluid Networks with Overflows Yoni Nazarathy, Swinburne University of Technology, Melbourne. Stijn Fleuren and Erjen Lefeber, Eindhoven University.
Lecture 7  Poisson Processes (a reminder)  Some simple facts about Poisson processes  The Birth/Death Processes in General  Differential-Difference.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.
Introduction to Stochastic Models GSLM 54100
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  …
A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Variance of Queueing Output Processes Haifa Statistics.
WELCOME. SUBJECT CODE - MA1252 SUBJECT - PROBABILITY AND SUBJECT CODE - MA1252 SUBJECT - PROBABILITY AND QUEUEING THEORY.
On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner QPA Seminar, EURANDOM January 8, 2009.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
 Birth Death Processes  M/M/1 Queue  M/M/m Queue  M/M/m/B Queue with Finite Buffers  Results for other Queueing systems 2.
Parameter Estimation Problems in Queueing and Related Stochastic Models Yoni Nazarathy School of Mathematics and Physics, The University of Queensland.
Overflow Queueing Networks: Limiting Traffic Equations, Trajectories and Sojourn Times Stijn Fleuren, Yoni Nazarathy, Erjen Lefeber Open Problem Session.
Analysis of M/M/c/N Queuing System With Balking, Reneging and Synchronous Vacations Dequan Yue Department of Statistics, College of Sciences Yanshan University,
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
Stability using fluid limits: Illustration through an example "Push-Pull" queuing network Yoni Nazarathy* EURANDOM Contains Joint work with Gideon Weiss.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
TexPoint fonts used in EMF.
Modeling and Analysis of Computer Networks
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner CWI Amsterdam March 2009.
EE6610: Week 6 Lectures.
On Control of Queueing Networks and The Asymptotic Variance Rate of Outputs Ph.d Summary Talk Yoni Nazarathy Supervised by Prof. Gideon Weiss Haifa Statistics.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance Rate of the Departure Process of.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Positive Harris Recurrence and Diffusion Scale Analysis of a Push-Pull Queueing Network Yoni Nazarathy and Gideon Weiss University of Haifa ValueTools.
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
ORSIS Conference, Jerusalem Mountains, Israel May 13, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
STUDENTS PROBABILITY DAY Weizmann Institute of Science March 28, 2007 Yoni Nazarathy (Supervisor: Prof. Gideon Weiss) University of Haifa Yoni Nazarathy.
Flows and Networks Plan for today (lecture 2): Questions? Birth-death process Example: pure birth process Example: pure death process Simple queue General.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
The Asymptotic Variance of Departures in Critically Loaded Queues Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
14 th INFORMS Applied Probability Conference, Eindhoven July 9, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University.
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
On the Variance of Output Counts of Some Queueing Systems Yoni Nazarathy Gideon Weiss SE Club, TU/e April 20, 2008.
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Queueing Theory II.
Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.
Flows and Networks Plan for today (lecture 3):
Flows and Networks Plan for today (lecture 4):
CTMCs & N/M/* Queues.
TexPoint fonts used in EMF.
Departure Process Variability of Queues and Queueing Networks
Queueing Theory II.
Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
The Variance of Production Counts over a Long Time Horizon
Queueing Theory 2008.
Departure Process Variability of Queues and Networks
Presentation transcript:

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Asymptotic Variance Rate of the Output Process of Finite Capacity Queues Queueing Analysis, Control and Games December 20,2007 Technion, Israel Queueing Analysis, Control and Games December 20,2007 Technion, Israel

Yoni Nazarathy, Gideon Weiss, University of Haifa, Poisson arrivals: Independent exponential service times: Finite buffer size: Jobs arriving to a full system are a lost. Number in system,, is represented by a finite state irreducible birth-death CTMC: The M/M/1/K Queue  Buffer Server M

Yoni Nazarathy, Gideon Weiss, University of Haifa, Traffic Processes Counts of point processes: - The arrivals during - The entrances into the system during - The outputs from the system during - The lost jobs during Poisson Renewal Non- Renewal Poisson Non- Renewal Renewal M/M/1/K Renewal Book: Traffic Processes in Queueing Networks, Disney, Kiessler 1987.

Yoni Nazarathy, Gideon Weiss, University of Haifa, Some Attributes: (Disney, Kiessler, Farrell, de Morias 70’s) Not a renewal process (but a Markov Renewal Process). Expressions for. Transition probability kernel of Markov Renewal Process. A Markovian Arrival Process (MAP) (Neuts 1980’s). What about ? D(t) – The Output process: Asymptotic Variance Rate:

Yoni Nazarathy, Gideon Weiss, University of Haifa, Asymptotic Variance Rate of Outputs: What values do we expect for ?

Yoni Nazarathy, Gideon Weiss, University of Haifa, Asymptotic Variance Rate of Outputs: What values do we expect for ?

Yoni Nazarathy, Gideon Weiss, University of Haifa, Similar to Poisson: Asymptotic Variance Rate of Outputs: What values do we expect for ?

Yoni Nazarathy, Gideon Weiss, University of Haifa, Asymptotic Variance Rate of Outputs: What values do we expect for ?

Yoni Nazarathy, Gideon Weiss, University of Haifa, M B alancing R educes A symptotic V ariance of O utputs Asymptotic Variance Rate of Outputs: What values do we expect for ?

Yoni Nazarathy, Gideon Weiss, University of Haifa, Some Results

Yoni Nazarathy, Gideon Weiss, University of Haifa, Results for M/M/1/K: Other M/M/1/K results: Asymptotic correlation between outputs and overflows. Formula for y-intercept of linear asymptote when.

Yoni Nazarathy, Gideon Weiss, University of Haifa, Calculating Using MAPs Calculating Using MAPs

Yoni Nazarathy, Gideon Weiss, University of Haifa, Represented as a MAP (Markovian Arrival Process) (Neuts, Lucantoni et. al.) Generator Transitions without events Transitions with events Asymptotic Variance Rate

Yoni Nazarathy, Gideon Weiss, University of Haifa, Attempting to evaluate directly … For, there is a nice structure to the inverse… But This doesn’t get us far…

Yoni Nazarathy, Gideon Weiss, University of Haifa, Main Theorem

Yoni Nazarathy, Gideon Weiss, University of Haifa, Main Theorem: Part (i): Part (ii): Scope: Finite, irreducible, stationary, birth-death CTMC that represents a queue: and or If: Then: Calculation of : (Asymptotic Variance Rate of Output Process)

Yoni Nazarathy, Gideon Weiss, University of Haifa, Proof Outline

Yoni Nazarathy, Gideon Weiss, University of Haifa, Use the Transition Counting Process Lemma: Proof: Q.E.D - Counts the number of transitions in the state space in [0,t] Asymptotic Variance Rate of M(t): BirthsDeaths

Yoni Nazarathy, Gideon Weiss, University of Haifa, Idea of Proof of part (i): Whitt: Book: Stochastic Process Limits, Paper: 1992 –Asymptotic Formulas for Markov Processes… 1) Look at M(t) instead of D(t). 2) The MAP of M(t) has an associated MMPP with same variance. 2) Results of Ward Whitt allow to obtain explicit expression for the asymptotic variance rate of MMPP with birth-death structure. Proof of part (ii), is technical.

Yoni Nazarathy, Gideon Weiss, University of Haifa, More BRAVO B alancing R educes A symptotic V ariance of O utputs

Yoni Nazarathy, Gideon Weiss, University of Haifa, K K-1 Trying to understand what is going on …. M/M/1/K:

Yoni Nazarathy, Gideon Weiss, University of Haifa, Intuition for M/M/1/K doesn ’ t carry over to M/M/c/K … But BRAVO does … M/M/40/40 M/M/K/K K=30 K=20 K=10 M/M/c/40 c=1 c=20 c=30

Yoni Nazarathy, Gideon Weiss, University of Haifa, BRAVO also occurs in GI/G/1/K … MAP is used to evaluate Var Rate for PH/PH/1/40 queue with Erlang and Hyper-Exp

Yoni Nazarathy, Gideon Weiss, University of Haifa, The “ 2/3 property ” seems to hold for GI/G/1/K!!! and increase K for different CVs

Yoni Nazarathy, Gideon Weiss, University of Haifa, Thank You