Exact solutions for first-passage and related problems in certain classes of queueing system Michael J Kearney School of Electronics and Physical Sciences.

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)
Richard J. Boucherie department of Applied Mathematics
Break Position Errors in Climate Records Ralf Lindau & Victor Venema University of Bonn Germany.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
G12: Management Science Markov Chains.
Simulation. Example: A Bank Simulator We are given: –The number of tellers –The arrival time of each customer –The amount of time each customer requires.
1 6.3 Binary Heap - Other Heap Operations There is no way to find any particular key without a linear scan through the entire heap. However, if we know.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec )
A gentle introduction to fluid and diffusion limits for queues Presented by: Varun Gupta April 12, 2006.
Consider the M/M/1 queue Arrival process: Poi( t) Service distribution: Poi(  t) One server, infinite queue length possible Prob(arrival in small interval.
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
SIMULATION EXAMPLES. SELECTED SIMULATION EXAMPLES 4 Queuing systems (Dynamic System) 4 Inventory systems (Dynamic and Static) 4 Monte-Carlo simulation.
1 TCOM 501: Networking Theory & Fundamentals Lectures 9 & 10 M/G/1 Queue Prof. Yannis A. Korilis.
Queueing Theory.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Lecture 4 Mathematical and Statistical Models in Simulation.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
1 Real-Time Queueing Network Theory Presented by Akramul Azim Department of Electrical and Computer Engineering University of Waterloo, Canada John P.
Math 71A 3.1 – Systems of Linear Equations in Two Variables 1.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
PhD-TW-Colloquium, October 09, 2008Polling systems as performance models for mobile ad hoc networking Ahmad Al Hanbali, Richard Boucherie, Jan-Kees van.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Time Parallel Simulations II ATM Multiplexers and G/G/1 Queues.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Analysis of M/M/c/N Queuing System With Balking, Reneging and Synchronous Vacations Dequan Yue Department of Statistics, College of Sciences Yanshan University,
Network Design and Analysis-----Wang Wenjie Queueing System IV: 1 © Graduate University, Chinese academy of Sciences. Network Design and Analysis Wang.
1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Modeling and Analysis of Computer Networks
Queuing Theory. Introduction Queuing is the study of waiting lines, or queues. The objective of queuing analysis is to design systems that enable organizations.
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.
1 Geography and road network vulnerability Erik Jenelius Div. of Transport and Location Analysis Royal Institute of Technology (KTH), Stockholm.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
STA347 - week 91 Random Vectors and Matrices A random vector is a vector whose elements are random variables. The collective behavior of a p x 1 random.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Statistics and Probability Theory Lecture 12 Fasih ur Rehman.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
QUEUING. CONTINUOUS TIME MARKOV CHAINS {X(t), t >= 0} is a continuous time process with > sojourn times S 0, S 1, S 2,... > embedded process X n = X(S.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Simulation Examples And General Principles Part 2
Discrete-Event System Simulation in Java. Discrete Event Systems New dynamic systems New dynamic systems Computer and communication networks Computer.
population or infinite calling population?
Chapter 5 Normal Probability Distributions.
A Physicist’s View of SOC Models
Lecture on Markov Chain
Queuing Systems Don Sutton.
Solutions Queueing Theory 1
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
effective capacity The practical maximum output of a system,
COMP60611 Fundamentals of Parallel and Distributed Systems
Statistics of Extreme Fluctuations in Task Completion Landscapes
Random WALK, BROWNIAN MOTION and SDEs
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
absolute time The passage of time as measured by a clock.
COMP60621 Designing for Parallelism
Chapter 5 Normal Probability Distributions.
Chapter 5 Normal Probability Distributions.
Balanced scales and equations
Presentation transcript:

Exact solutions for first-passage and related problems in certain classes of queueing system Michael J Kearney School of Electronics and Physical Sciences University of Surrey June 29 th 2006

Presentation outline Introduction to the Geo/Geo/1 queue Some physical examples Mathematical analysis – Link to the Brownian motion problem Further problems

Queueing schematic BufferServer Service protocol - First come, first served Customers inCustomers out

A discrete-time queueing system Geo/Geo/1

Small scale queue dynamics

Large scale queue dynamics

Brownian motion with drift

Some questions of interest Time until the queue is next empty – Busy period (first passage time) statistics – Probability that the busy period is infinite Maximum queue length during a busy period – Extreme value statistics (correlated variables) Cumulative waiting time during a busy period – Area under the curve

Areas of application Abelian sandpile model Compact directed percolation Lattice polygons Cellular automaton road traffic model

Nagel and Paczuski (1995) The link to road traffic Cellular automaton model Queueing representation

The critical scalings

The busy period (first passage time)

Moments and ‘defectiveness’

The probability distribution

The maximum (extreme) length Maximum length L Lifetime T

Two important consequences

Mapping onto staircase polygons – the area problem

Arrivals Departures

A functional equation

Three-fold strategy A scaling approach based on the dominant balance method, following Richard (2002) Consider the singularity structure of the generating function G(1,y) as y tends to unity, following Prellberg (1995) Consider the equivalent problem for Brownian motion, following Kearney and Majumdar (2005)

The scaling approach

The q-series approach

The Brownian motion approach

The area distribution

Taking the continuous time limit (but discrete customers) The M/M/1 queue Guillemin and Pinchon (1998)

time Rules Compact directed percolation

Critical condition Making the connection …

Summary of key CDP results Probability that the avalanches are infinite – critical condition Distribution of avalanches by duration (perimeter) Distribution of avalanches by size (area) Dhar and Ramaswamy (1989) Rajesh and Dhar (2005)

Brownian motion

Conclusions New results for discrete and continuous-time queues, and possibly deeper results Large area scaling behaviour for CDP determined exactly at all points in the phase diagram Exact solution for the v = 1 cellular automaton traffic model of Nagel and Paczuski A solvable model of extreme statistics for strongly correlated variables

N = 5 T = 7Time Queue length Time Departures Partition polygon queues

State dependent queues (balking)

Some references On a random area variable arising in discrete-time queues and compact directed percolation – M J Kearney 2004 J.Phys. A: Math. Gen., On the area under a continuous time Brownian motion – M J Kearney and S N Majumdar 2005 J.Phys. A: Math. Gen., A probabilistic growth model for partition polygons and related structures – M J Kearney 2004 J.Phys. A: Math. Gen.,