SAMPLING AND INVERSION
|
|
- Lionel Edwards
- 5 years ago
- Views:
Transcription
1 SAMPLING AND INVERSION Darryl Veitch CUBIN, Department of Electrical & Electronic Engineering University of Melbourne Workshop on Sampling the Internet, Paris 2005
2 A TALK WITH TWO PARTS CHALLENGES IN SAMPLING Introduction Two Consequences CROSS TRAFFIC ESTIMATION AS NON-LINEAR SAMPLING An Inverse Queueing Problem Limits to Inversion: Identifiability From Inversion Theory to Estimation Practice
3 FIRST BYTES Given i.i.d. pkt sampling, recover 1st order pkt statistics. EXAMPLE 1: AVERAGE PACKET RATE λ X Sampling regime is given (not selected) No shortage of data Simple inversion: ˆλX = λ X p Here sampling well adapted to the parameter, inversion easy.
4 FIRST BYTES Given i.i.d. pkt sampling, recover 1st order pkt statistics. EXAMPLE 1: AVERAGE PACKET RATE λ X Sampling regime is given (not selected) No shortage of data Simple inversion: ˆλX = λ X p Here sampling well adapted to the parameter, inversion easy.
5 FIRST BYTES Given i.i.d. pkt sampling, recover 1st order pkt statistics. EXAMPLE 1: AVERAGE PACKET RATE λ X Sampling regime is given (not selected) No shortage of data Simple inversion: ˆλX = λ X p Here sampling well adapted to the parameter, inversion easy.
6 FIRST PROBLEMS Given i.i.d. pkt sampling, recover flow statistics. EXAMPLE 2: FLOW SIZE DISTRIBUTION P Sampling regime is given Drastic data shortage for body of P (tail ok) Simple inversion (sample histogram) very poor, better methods still struggle Sampling not well adapted, inversion problematic.
7 FIRST PROBLEMS Given i.i.d. pkt sampling, recover flow statistics. EXAMPLE 2: FLOW SIZE DISTRIBUTION P Sampling regime is given Drastic data shortage for body of P (tail ok) Simple inversion (sample histogram) very poor, better methods still struggle Sampling not well adapted, inversion problematic.
8 FIRST PROBLEMS Given i.i.d. pkt sampling, recover flow statistics. EXAMPLE 2: FLOW SIZE DISTRIBUTION P Sampling regime is given Drastic data shortage for body of P (tail ok) Simple inversion (sample histogram) very poor, better methods still struggle Sampling not well adapted, inversion problematic.
9 A SOLUTION: SELECT SAMPLING REGIME Given i.i.d. flow sampling, recover flow statistics. EXAMPLE: FLOW SIZE DISTRIBUTION P Sampling regime is selected Data shortage for P vanishes Simple inversion (sample histogram) good Matching sampling regime to the metric worth considering! BUT Comes at a cost Not neccessarily possible
10 A SOLUTION: SELECT SAMPLING REGIME Given i.i.d. flow sampling, recover flow statistics. EXAMPLE: FLOW SIZE DISTRIBUTION P Sampling regime is selected Data shortage for P vanishes Simple inversion (sample histogram) good Matching sampling regime to the metric worth considering! BUT Comes at a cost Not neccessarily possible
11 A SOLUTION: SELECT SAMPLING REGIME Given i.i.d. flow sampling, recover flow statistics. EXAMPLE: FLOW SIZE DISTRIBUTION P Sampling regime is selected Data shortage for P vanishes Simple inversion (sample histogram) good Matching sampling regime to the metric worth considering! BUT Comes at a cost Not neccessarily possible
12 A SOLUTION: SELECT SAMPLING REGIME Given i.i.d. flow sampling, recover flow statistics. EXAMPLE: FLOW SIZE DISTRIBUTION P Sampling regime is selected Data shortage for P vanishes Simple inversion (sample histogram) good Matching sampling regime to the metric worth considering! BUT Comes at a cost Not neccessarily possible
13 THE BROADER PICTURE NEED TO CONSIDER Parameter to measure Sampling regime Inversion task Costs: What can we infer from this?
14 NEED TO CONSIDER THE BROADER PICTURE Parameter to measure Sampling regime matched to parameter? or data model? preserves needed information? Inversion task Costs: What can we infer from this?
15 NEED TO CONSIDER Parameter to measure THE BROADER PICTURE Sampling regime Inversion task well posed? it is possible? robust/stable? Costs: What can we infer from this?
16 NEED TO CONSIDER Parameter to measure Sampling regime THE BROADER PICTURE Inversion task Costs: sampling complexity (Cisco..) inversion (real-time?) scalable aggregation (transport to analysis node) of failure ($ per unit std) What can we infer from this?
17 THE BROADER PICTURE NEED TO CONSIDER Parameter to measure Sampling regime Inversion task Costs: What can we infer from this?
18 OUTLINE CHALLENGES IN SAMPLING Introduction Two Consequences CROSS TRAFFIC ESTIMATION AS NON-LINEAR SAMPLING An Inverse Queueing Problem Limits to Inversion: Identifiability From Inversion Theory to Estimation Practice
19 I: NEED STRUCTURE DETECTORS SINCE Cannot match sampling to all parameters, and Parallelism is limited Relevant information is generically scarce. HENCE Forced to detect weak signals in noise (in most cases) Essential to exploit unique structure of information
20 A FLOW-CLUSTER MODEL OF PACKET ARRIVALS
21 NAIVE INTUITION: CLUSTERS ARE FLOWS
22 MORE REALISTICALLY: FLOWS INTERLEAVE
23 REALITY CHECK: CLUSTERS LOST IN FOG
24 UNASSISTED: WHERE ARE THE CLUSTERS NOW?
25 FLOWS ARE ESSENTIAL, YET INVISIBLE FLOWS ARE REAL, HAVE IMPACT, YET INVISIBLE WITHOUT side information, or more powerful ways to detect structure in noise.
26 II: SAMPLING NEEDS A BROADER CONTEXT SAMPLING IS The threetuple {parameter, sampling, inversion} Any measurements carrying information, followed by inference Example: active probing is a branch of sampling.
27 OUTLINE CHALLENGES IN SAMPLING Introduction Two Consequences CROSS TRAFFIC ESTIMATION AS NON-LINEAR SAMPLING An Inverse Queueing Problem Limits to Inversion: Identifiability From Inversion Theory to Estimation Practice
28 INVERTING DELAY SAMPLES FOR CROSS TRAFFIC JOINT WORK WITH S.MACHIRAJU, F.BACCELLI, J.BOLOT, A.NUCCI A FIFO QUEUE: Packet workload arrives instantaneously Deterministic service rate µ PROBE STREAM: Constant probe service time x = p/µ Arrivals {T n }, departures {T n}, E2E delays {D n = T n T n } Examine residual delay: R n = D n x 0 CROSS TRAFFIC: A measure A (or process): workload A(t) arrives in [0, t] Think of Poisson packet arrivals with random sizes (Eg constant or trimodal service time distribution)
29 INVERTING DELAY SAMPLES FOR CROSS TRAFFIC JOINT WORK WITH S.MACHIRAJU, F.BACCELLI, J.BOLOT, A.NUCCI A FIFO QUEUE: Packet workload arrives instantaneously Deterministic service rate µ PROBE STREAM: Constant probe service time x = p/µ Arrivals {T n }, departures {T n}, E2E delays {D n = T n T n } Examine residual delay: R n = D n x 0 CROSS TRAFFIC: A measure A (or process): workload A(t) arrives in [0, t] Think of Poisson packet arrivals with random sizes (Eg constant or trimodal service time distribution)
30 INVERTING DELAY SAMPLES FOR CROSS TRAFFIC JOINT WORK WITH S.MACHIRAJU, F.BACCELLI, J.BOLOT, A.NUCCI A FIFO QUEUE: Packet workload arrives instantaneously Deterministic service rate µ PROBE STREAM: Constant probe service time x = p/µ Arrivals {T n }, departures {T n}, E2E delays {D n = T n T n } Examine residual delay: R n = D n x 0 CROSS TRAFFIC: A measure A (or process): workload A(t) arrives in [0, t] Think of Poisson packet arrivals with random sizes (Eg constant or trimodal service time distribution)
31 THE INVERSE QUEUEING PROBLEM Given measured delays {R i }, what can be learned about A?
32 CONDITION ON TIME-SCALE t WHY? Desirable to understand A as a function of timescale Also necessary technically LOOK AT CONDITIONAL DELAYS: Of the sequence {R i }, take those for which T n+1 T n = t (if probes periodic, all probes qualify) For a given such R, the next probe arrives t later with residual delay S. We study statistics of the pair (R, S) Not limited to Poisson or periodic probe streams!
33 CONDITION ON TIME-SCALE t WHY? Desirable to understand A as a function of timescale Also necessary technically LOOK AT CONDITIONAL DELAYS: Of the sequence {R i }, take those for which T n+1 T n = t (if probes periodic, all probes qualify) For a given such R, the next probe arrives t later with residual delay S. We study statistics of the pair (R, S) Not limited to Poisson or periodic probe streams!
34 JOINT DENSITY OF (R, S) FIGURE: Diagonals are lines U = u, where U = R S is delay variation.
35 FORWARD EQUATIONS: FROM A TO R S = max [ x + R + C, B ] C = A(t) t B = sup A([v, t)) (t v) 0 v t TECHNICAL ASSUMPTION R n is independent of (R n 1, C n, T n+1 T n ) {R n } is an ergodic Markov chain i.e.: future delays conditionally independent of past, R free to vary. RESULT f r (s) = P(S R = r) determined by density h(k, l) = P(B = k, C = l)
36 FORWARD EQUATIONS: FROM A TO R S = max [ x + R + C, B ] C = A(t) t B = sup A([v, t)) (t v) 0 v t TECHNICAL ASSUMPTION R n is independent of (R n 1, C n, T n+1 T n ) {R n } is an ergodic Markov chain i.e.: future delays conditionally independent of past, R free to vary. RESULT f r (s) = P(S R = r) determined by density h(k, l) = P(B = k, C = l)
37 FORWARD EQUATIONS: FROM A TO R S = max [ x + R + C, B ] C = A(t) t B = sup A([v, t)) (t v) 0 v t TECHNICAL ASSUMPTION R n is independent of (R n 1, C n, T n+1 T n ) {R n } is an ergodic Markov chain i.e.: future delays conditionally independent of past, R free to vary. RESULT f r (s) = P(S R = r) determined by density h(k, l) = P(B = k, C = l)
38 MEANING OF (B, C) FIGURE: C = A t is net workload in interval t B a measure of burstiness
39 SUPPORT OF (B, C) DENSITY C s1 r1 x f r1 (s1) 0 B x s2 r2 x f r2 (s2) t s2 s1 FIGURE: Density h(k, l) vanishes outside yellow strip
40 EXAMPLE OF (B, C) DENSITY C(l) l*d (Bytes) k*d (Bytes)
41 OUTLINE CHALLENGES IN SAMPLING Introduction Two Consequences CROSS TRAFFIC ESTIMATION AS NON-LINEAR SAMPLING An Inverse Queueing Problem Limits to Inversion: Identifiability From Inversion Theory to Estimation Practice
42 SYSTEM IDENTIFIABILITY TWO KINDS OF AMBIGUITY FOR THE INVERSION Pathwise: knowledge of {R i } does not determine A. Eg.: probes in Same busy period: different pkt arrivals with same total service Different busy periods: anything between is invisible Distributions: Again does not (in general) determine A
43 SYSTEM IDENTIFIABILITY TWO KINDS OF AMBIGUITY FOR THE INVERSION Pathwise: knowledge of {R i } does not determine A. Eg.: probes in Same busy period: different pkt arrivals with same total service Different busy periods: anything between is invisible Distributions: Again does not (in general) determine A
44 SYSTEM IDENTIFIABILITY TWO KINDS OF AMBIGUITY FOR THE INVERSION Pathwise: knowledge of {R i } does not determine A. Eg.: probes in Same busy period: different pkt arrivals with same total service Different busy periods: anything between is invisible Distributions: Again does not (in general) determine A
45 A RECURSIVE PROCEDURE TO DETERMINE h(k, l) Condition on R = r. From S = max [ x + R + C, B ], conditional probabilities f r (s) = P(S = s R = r) corresponds to a simple sum of h(k, l) values. These expresssions can be combined to invert: k 1 h(k, l) = [2f k l x (i) f k l x 1 (i) f k l x+1 (i)]+[f k l x (k) f k l x+1 (k)] i=0 provided k l x 1. This is almost a full inversion of the joint density!
46 LINKING (R, S) TO (B, C) DENSITY C s1 r1 x f r1 (s1) 0 B x s2 r2 x f r2 (s2) t s2 s1 FIGURE: Observed (r, s) corresponds to a (b, c) value in the angle.
47 INVERSION METHOD USING ANGLES FIGURE: Values in the ambiguity zone (top) cannot be resolved.
48 THE ROLE OF x Width of ambiguity zone is x + 1 probe invasiveness hides system details However! if A has stationary independent increments: The partial inversion here is not fundamental Not only can h(k, l) be recovered for this t, but the entire law of the process also In general, full inversion in inherently impossible
49 THE ROLE OF x Width of ambiguity zone is x + 1 probe invasiveness hides system details However! if A has stationary independent increments: The partial inversion here is not fundamental Not only can h(k, l) be recovered for this t, but the entire law of the process also In general, full inversion in inherently impossible HOW DOES THAT WORK? The marginal c(l) of C can always be recovered This is enough to determine the Lèvy exponent, which characterises such processes
50 LINKING (R, S) TO (B, C) DENSITY C s1 r1 x f r1 (s1) 0 B x s2 r2 x f r2 (s2) t s2 s1 FIGURE: Observed (r, s) corresponds to a (b, c) value in the angle.
51 OUTLINE CHALLENGES IN SAMPLING Introduction Two Consequences CROSS TRAFFIC ESTIMATION AS NON-LINEAR SAMPLING An Inverse Queueing Problem Limits to Inversion: Identifiability From Inversion Theory to Estimation Practice
52 IMPLEMENTING THE INVERSION METHOD MAJOR CHALLENGES: Must condition: t, r Must estimate the f r (s) Coverage of (k, l) plane may not be adequate, even missing! Must map available mass into the strip in right way Epicentre of h(k, l) may be far from available mass But, can exploit strong assumption to extend effective invertibility to low data availability
53 EXAMPLE OF (B, C) DENSITY C(l) l*d (Bytes) k*d (Bytes)
54 AVAILABLE MASS AND h(k, l) (ρ = 0.8) Avail c(l) with h Contour 80 % Utilization l*d (Bytes) k*d (Bytes)
55 AVAILABLE MASS AND h(k, l) (ρ = 0.2) Avail c(l) with h Contour 20 % Utilization l*d (Bytes) k*d (Bytes)
56 ROUTER DATA: ESTIMATING h(k, l) l*d (KB) l*d (KB) k*d (KB) k*d (KB) 0 FIGURE: Left: replayed router data through FIFO, Right: estimation
57 SUMMARY CHALLENGES IN SAMPLING: Sampling and Inversion must be structure aware Sampling is a general program {parameter,sampling,inversion} CROSS TRAFFIC ESTIMATION: Cross traffic inversion impossible in general! Invasiveness an intrinsic barrier Detailed partial inversion still possible
58 SUMMARY CHALLENGES IN SAMPLING: Sampling and Inversion must be structure aware Sampling is a general program {parameter,sampling,inversion} CROSS TRAFFIC ESTIMATION: Cross traffic inversion impossible in general! Invasiveness an intrinsic barrier Detailed partial inversion still possible
TWO PROBLEMS IN NETWORK PROBING
TWO PROBLEMS IN NETWORK PROBING DARRYL VEITCH The University of Melbourne 1 Temporal Loss and Delay Tomography 2 Optimal Probing in Convex Networks Paris Networking 27 Juin 2007 TEMPORAL LOSS AND DELAY
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 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 informationSPLITTING AND MERGING OF PACKET TRAFFIC: MEASUREMENT AND MODELLING
SPLITTING AND MERGING OF PACKET TRAFFIC: MEASUREMENT AND MODELLING Nicolas Hohn 1 Darryl Veitch 1 Tao Ye 2 1 CUBIN, Department of Electrical & Electronic Engineering University of Melbourne, Vic 3010 Australia
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 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 informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationCapturing Network Traffic Dynamics Small Scales. Rolf Riedi
Capturing Network Traffic Dynamics Small Scales Rolf Riedi Dept of Statistics Stochastic Systems and Modelling in Networking and Finance Part II Dependable Adaptive Systems and Mathematical Modeling Kaiserslautern,
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 informationStochastic Network Calculus
Stochastic Network Calculus Assessing the Performance of the Future Internet Markus Fidler joint work with Amr Rizk Institute of Communications Technology Leibniz Universität Hannover April 22, 2010 c
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 informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
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 informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationOutline Network structure and objectives Routing Routing protocol protocol System analysis Results Conclusion Slide 2
2007 Radio and Wireless Symposium 9 11 January 2007, Long Beach, CA. Lifetime-Aware Hierarchical Wireless Sensor Network Architecture with Mobile Overlays Maryam Soltan, Morteza Maleki, and Massoud Pedram
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 informationResource Allocation for Video Streaming in Wireless Environment
Resource Allocation for Video Streaming in Wireless Environment Shahrokh Valaee and Jean-Charles Gregoire Abstract This paper focuses on the development of a new resource allocation scheme for video streaming
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationEffective Bandwidth for Traffic Engineering
Brigham Young University BYU ScholarsArchive All Faculty Publications 2-5- Effective Bandwidth for Traffic Engineering Mark J. Clement clement@cs.byu.edu Rob Kunz See next page for additional authors Follow
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic
ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
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 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 informationChapter 5. Elementary Performance Analysis
Chapter 5 Elementary Performance Analysis 1 5.0 2 5.1 Ref: Mischa Schwartz Telecommunication Networks Addison-Wesley publishing company 1988 3 4 p t T m T P(k)= 5 6 5.2 : arrived rate : service rate 7
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationReading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process.
Renewal Processes Wednesday, December 16, 2015 1:02 PM Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3 A renewal process is a generalization of the Poisson point process. The Poisson point process is completely
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
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 informationDirected Graphical Models
CS 2750: Machine Learning Directed Graphical Models Prof. Adriana Kovashka University of Pittsburgh March 28, 2017 Graphical Models If no assumption of independence is made, must estimate an exponential
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationModelling the Arrival Process for Packet Audio
Modelling the Arrival Process for Packet Audio Ingemar Kaj and Ian Marsh 2 Dept. of Mathematics, Uppsala University, Sweden ikaj@math.uu.se 2 SICS AB, Stockholm, Sweden ianm@sics.se Abstract. Packets in
More informationAsymptotic Delay Distribution and Burst Size Impact on a Network Node Driven by Self-similar Traffic
Èíôîðìàöèîííûå ïðîöåññû, Òîì 5, 1, 2005, ñòð. 4046. c 2004 D'Apice, Manzo. INFORMATION THEORY AND INFORMATION PROCESSING Asymptotic Delay Distribution and Burst Size Impact on a Network Node Driven by
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 informationThe Distribution of the Number of Arrivals in a Subinterval of a Busy Period of a Single Server Queue
The Distribution of the Number of Arrivals in a Subinterval of a Busy Period of a Single Server Queue A. Novak (a.novak@ms.unimelb.edu.au) Department of Mathematics and Statistics, University of Melbourne,
More informationqueue KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology
Analysis of the Packet oss Process in an MMPP+M/M/1/K queue György Dán, Viktória Fodor KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology {gyuri,viktoria}@imit.kth.se
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 informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
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 informationEXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY
EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 011 MODULE 3 : Stochastic processes and time series Time allowed: Three Hours Candidates should answer FIVE questions. All questions carry
More informationThe Role of PASTA in Network Measurement
The Role of PASTA in Network Measurement François Baccelli INRIA-ENS, Ecole Normale Supérieure, France Francois.Baccelli@ens.fr ABSTRACT Darryl Veitch Dept. of E&E Engineering University of Melbourne,
More informationInput-queued switches: Scheduling algorithms for a crossbar switch. EE 384X Packet Switch Architectures 1
Input-queued switches: Scheduling algorithms for a crossbar switch EE 84X Packet Switch Architectures Overview Today s lecture - the input-buffered switch architecture - the head-of-line blocking phenomenon
More informationCongestion Equilibrium for Differentiated Service Classes Richard T. B. Ma
Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma School of Computing National University of Singapore Allerton Conference 2011 Outline Characterize Congestion Equilibrium Modeling
More informationEffect of the Traffic Bursts in the Network Queue
RICE UNIVERSITY Effect of the Traffic Bursts in the Network Queue by Alireza KeshavarzHaddad A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Approved, Thesis
More informationThinning-stable point processes as a model for bursty spatial data
Thinning-stable point processes as a model for bursty spatial data Chalmers University of Technology, Gothenburg, Sweden Paris, Jan 14th 2015 Communications Science. XXth Century Fixed line telephony Scientific
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
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 informationCapacity management for packet-switched networks with heterogeneous sources. Linda de Jonge. Master Thesis July 29, 2009.
Capacity management for packet-switched networks with heterogeneous sources Linda de Jonge Master Thesis July 29, 2009 Supervisors Dr. Frank Roijers Prof. dr. ir. Sem Borst Dr. Andreas Löpker Industrial
More informationEnergy minimization based Resource Scheduling for Strict Delay Constrained Wireless Communications
Energy minimization based Resource Scheduling for Strict Delay Constrained Wireless Communications Ibrahim Fawaz 1,2, Philippe Ciblat 2, and Mireille Sarkiss 1 1 LIST, CEA, Communicating Systems Laboratory,
More informationLatency and Backlog Bounds in Time- Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping
Latency and Backlog Bounds in Time- Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping Ehsan Mohammadpour, Eleni Stai, Maaz Mohuiddin, Jean-Yves Le Boudec September 7 th 2018,
More informationDesign of IP networks with Quality of Service
Course of Multimedia Internet (Sub-course Reti Internet Multimediali ), AA 2010-2011 Prof. Pag. 1 Design of IP networks with Quality of Service 1 Course of Multimedia Internet (Sub-course Reti Internet
More informationA packet switch with a priority. scheduling discipline: performance. analysis
A packet switch with a priority scheduling discipline: performance analysis Joris Walraevens, Bart Steyaert and Herwig Bruneel SMACS Research Group Ghent University, Department TELIN (TW07) Sint-Pietersnieuwstraat
More informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationDISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition
DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition R. G. Gallager January 31, 2011 i ii Preface These notes are a draft of a major rewrite of a text [9] of the same name. The notes and the text are outgrowths
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 informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationCS 2750: Machine Learning. Bayesian Networks. Prof. Adriana Kovashka University of Pittsburgh March 14, 2016
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016 Plan for today and next week Today and next time: Bayesian networks (Bishop Sec. 8.1) Conditional
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 informationA Simple Solution for the M/D/c Waiting Time Distribution
A Simple Solution for the M/D/c Waiting Time Distribution G.J.Franx, Universiteit van Amsterdam November 6, 998 Abstract A surprisingly simple and explicit expression for the waiting time distribution
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
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 informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 11 Oct, 3, 2016 CPSC 422, Lecture 11 Slide 1 422 big picture: Where are we? Query Planning Deterministic Logics First Order Logics Ontologies
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 informationInformation and Entropy
Information and Entropy Shannon s Separation Principle Source Coding Principles Entropy Variable Length Codes Huffman Codes Joint Sources Arithmetic Codes Adaptive Codes Thomas Wiegand: Digital Image Communication
More informationA New Technique for Link Utilization Estimation
A New Technique for Link Utilization Estimation in Packet Data Networks using SNMP Variables S. Amarnath and Anurag Kumar* Dept. of Electrical Communication Engineering Indian Institute of Science, Bangalore
More informationring structure Abstract Optical Grid networks allow many computing sites to share their resources by connecting
Markovian approximations for a grid computing network with a ring structure J. F. Pérez and B. Van Houdt Performance Analysis of Telecommunication Systems Research Group, Department of Mathematics and
More informationOmnithermal perfect simulation for multi-server queues
Omnithermal perfect simulation for multi-server queues Stephen Connor stephen.connor@york.ac.uk LMS-EPSRC Durham Symposium July-August 2017 Dominated CFTP in a nutshell Suppose that we re interested in
More informationFractal Analysis of Intraflow Unidirectional Delay over W-LAN and W-WAN WAN Environments
Fractal Analysis of Intraflow Unidirectional Delay over W-LAN and W-WAN WAN Environments Dimitrios Pezaros with Manolis Sifalakis and Laurent Mathy Computing Department Lancaster University [dp@comp.lancs.ac.uk]
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 informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationThe Timing Capacity of Single-Server Queues with Multiple Flows
The Timing Capacity of Single-Server Queues with Multiple Flows Xin Liu and R. Srikant Coordinated Science Laboratory University of Illinois at Urbana Champaign March 14, 2003 Timing Channel Information
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
More informationA source model for ISDN packet data traffic *
1 A source model for ISDN packet data traffic * Kavitha Chandra and Charles Thompson Center for Advanced Computation University of Massachusetts Lowell, Lowell MA 01854 * Proceedings of the 28th Annual
More informationA Quantitative View: Delay, Throughput, Loss
A Quantitative View: Delay, Throughput, Loss Antonio Carzaniga Faculty of Informatics University of Lugano September 27, 2017 Outline Quantitative analysis of data transfer concepts for network applications
More informationA Stochastic Model for TCP with Stationary Random Losses
A Stochastic Model for TCP with Stationary Random Losses Eitan Altman, Kostya Avrachenkov Chadi Barakat INRIA Sophia Antipolis - France ACM SIGCOMM August 31, 2000 Stockholm, Sweden Introduction Outline
More informationInverting Sampled Traffic
Inverting Sampled Traffic Nicolas Hohn n.hohn@ee.mu.oz.au Darryl Veitch dveitch@unimelb.edu.au Australian Research Council Special Research Center for Ultra-Broadband Information Networks Department of
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 informationarxiv: v2 [math.pr] 24 Mar 2018
Exact sampling for some multi-dimensional queueing models with renewal input arxiv:1512.07284v2 [math.pr] 24 Mar 2018 Jose Blanchet Yanan Pei Karl Sigman October 9, 2018 Abstract Using a recent result
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 informationThe Burstiness Behavior of Regulated Flows in Networks
The Burstiness Behavior of Regulated Flows in Networks Yu Ying 1, Ravi Mazumdar 2, Catherine Rosenberg 2 and Fabrice Guillemin 3 1 Dept. of ECE, Purdue University, West Lafayette, IN, 47906, U.S.A. yingy@ecn.purdue.edu
More informationStochastic Optimization for Undergraduate Computer Science Students
Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline
More informationStationary remaining service time conditional on queue length
Stationary remaining service time conditional on queue length Karl Sigman Uri Yechiali October 7, 2006 Abstract In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More informationFDST Markov Chain Models
FDST Markov Chain Models Tuesday, February 11, 2014 2:01 PM Homework 1 due Friday, February 21 at 2 PM. Reading: Karlin and Taylor, Sections 2.1-2.3 Almost all of our Markov chain models will be time-homogenous,
More informationAverage-cost temporal difference learning and adaptive control variates
Average-cost temporal difference learning and adaptive control variates Sean Meyn Department of ECE and the Coordinated Science Laboratory Joint work with S. Mannor, McGill V. Tadic, Sheffield S. Henderson,
More informationNetwork Traffic Characteristic
Network Traffic Characteristic Hojun Lee hlee02@purros.poly.edu 5/24/2002 EL938-Project 1 Outline Motivation What is self-similarity? Behavior of Ethernet traffic Behavior of WAN traffic Behavior of WWW
More informationDelay Bounds in Communication Networks with Heavy-Tailed and Self-Similar Traffic
Delay Bounds in Communication Networks with Heavy-Tailed and Self-Similar Traffic Jörg Liebeherr, Almut Burchard, Florin Ciucu 1 Abstract Traffic with self-similar and heavy-tailed characteristics has
More informationEfficient Network-wide Available Bandwidth Estimation through Active Learning and Belief Propagation
Efficient Network-wide Available Bandwidth Estimation through Active Learning and Belief Propagation mark.coates@mcgill.ca McGill University Department of Electrical and Computer Engineering Montreal,
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 informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More information