TWO PROBLEMS IN NETWORK PROBING

Size: px
Start display at page:

Download "TWO PROBLEMS IN NETWORK PROBING"

Transcription

1 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

2 TEMPORAL LOSS AND DELAY TOMOGRAPHY VIJAY ARYA, NICK DUFFIELD, DARRYL VEITCH To appear, Performance 2007

3 NETWORK TOMOGRAPHY! Several interesting inverse problems " Link level inferences from path measurements Multicast inference of network characteristics (MINC) " Path level inferences from link measurements Origin-destination traffic matrix estimation Loss rate IP Network Probe Packets Tomos End-to-end measurements Graphia Link level characteristics 1

4 NETWORK TOMOGRAPHY! Previous models for estimation " Assume temporal (and spatial) independence Estimated link parameters: loss rates, delay distribution! Limitation " Packet traffic is bursty and exhibits temporal dependence " Previous models support estimation of only average loss rates and delay distributions of links " Performance of applications also depends on temporal parameters of links, such as durations of loss bursts and bursts of large delays! This work " Relaxes temporal independence assumption " Estimation of temporal characteristics of links from end-to-end measurements 2

5 TEMPORAL LOSS CHARACTERISTICS! Loss-run distribution Probability [ Loss-run length! k ] Mean loss-run length Pr Loss-run length Loss/pass bursts! Importance " Impacts delay sensitive applications like VoIP (FEC tuning) " helps characterizing bottleneck links better 3

6 TEMPORAL DELAY CHARACTERISTICS Link delay states Packets! Run distributions of delays Probability [ Duration of a state! k ] Mean duration of high delay states 4

7 OUTLINE! MINC! Loss model! Estimation! Experiments! Conclusions

8 OUTLINE! MINC! Loss model! Estimation! Experiments! Conclusions

9 MINC! Multicast-based Inference of Network Characteristics... multicast probes! 1 Loss rates in logical Tree! MINC Loss Estimator 5

10 MINC! Multicast-based Inference of Network Characteristics... multicast probes! 1 Loss rates in logical Tree! MINC Loss Estimator Temporal Loss Estimator? 5

11 LOSS MODEL! Probes losses on links are modeled using two discrete-time binary processes! Bookkeeping process : records which probes reach node! Link loss process : determines which probes successfully cross the link &'#).",,)%*"+$,, !""##$$%&'()%*"+$,,! Loss dependence structure! Spatial: Loss processes of links are mutually independent (as before)! Temporal: Loss processes are stationary and ergodic (previously Bernoulli) 6

12 ACCESSING TEMPORAL PARAMETERS! Sufficiency of joint link passage probabilities e.g. " Mean Loss-run length " Loss-run distribution 7

13 OUTLINE! MINC! Loss model! Estimation! Experiments! Conclusions

14 JOINT PASSAGE PROBABILITIES " Sample: (set of receiver nodes) To estimate joint passage probabilities for all links " Probe index set " Joint link passage probability ( vector notation) by stationarity e.g. " Joint path passage probability Sufficient to estimate these 8

15 ESTIMATION: JOINT PATH PASSAGE PROBABILITY No of equations equal to degree of node k computed recursively over index sets = 0 for 9

16 ESTIMATION: JOINT PATH PASSAGE PROBABILITY! Estimation of in general trees " Requires solving polynomials with degree equal to the degree of node k Numerical computations for trees with large degree " Recursion over smaller index sets! Simpler temporal loss estimators " Subtree-partition Requires solutions to only linear or quadratic equations No loss of samples Also simplifies existing MINC estimators " Avoid recursion over index sets by considering only subsets of receiver events which imply 10

17 ESTIMATOR PROPERTIES! Consistent s rational functions of s! Variance Experiments No explicit expressions 11

18 OUTLINE! MINC! Loss model! Estimation! Experiments! Conclusions

19 EXPERIMENTS! Setup " Model-based simulations " Link losses simulated using two families of loss processes Discrete-time Markov chains On-off processes: pass-runs geometric, loss-runs Zipf (finite support) " Estimation Passage probability of a probe, Joint passage probability for a pair of consecutive probes, Mean loss-run length, " Relative error = 12

20 EXPERIMENTS! Estimation for shared path in case of two-receiver binary trees Markov chain On-off process 13

21 EXPERIMENTS! Estimation for shared path in case of two-receiver binary trees Markov chain On-off process 14

22 EXPERIMENTS! Estimation of for larger trees Link 1 Trees taken from router-level map of AT&T network produced by Rocketfuel (2253 links, 731 nodes) Random shortest path multicast trees with 32 receivers. Degree of internal nodes from 2 to 6, maximum height 6 15

23 VARIANCE! Estimation for shared path in case of tertiary tree Standard errors shown for various temporal estimators 16

24 CONCLUSIONS! Estimators for temporal loss parameters, in addition to loss rates Estimation of any joint probability possible for a pattern of probes! Class of estimators to reduce computational burden Subtree-partition: simplifies existing MINC estimators! Future work Asymptotic variance MLE for special cases (Markov chains) Hypothesis tests Experiments with real traffic 17

25 OPTIMAL PROBING IN CONVEX NETWORKS FRANÇOIS BACCELLI, SRIDHAR MACHIRAJU, DARRYL VEITCH, JEAN BOLOT Sprint Technical Report ATL

26 PREVIOUS WORK The Case Against Poisson Probing Zero-sampling bias not unique to Poisson (in non-intrusive case) PASTA talks about bias, is silent on variance PASTA is not optimal for variance or MSE PASTA is about sampling only, is silent on inversion Probe Pattern Separation Rule: select inter-probe (or probe pattern) separations as i.i.d. positive random variables, bounded above zero. Example: Uniform (i.i.d.) separations on [ 0.9!, 1.1! ] Aims for variance reduction Avoids phase locking (leads to sample path `bias") Allows freedom of probe stream design 10

27 LIMITATIONS Results derived in context of delay only No optimality result (expected to be highly system and traffic dependent) 10

28 NEW WORK Extended all results to loss case (loss and delay in uniform framework) For convex networks, have universal optimum for variance But: bias problem Give family of probing strategies with Zero bias Variance as close to optimal as desired (tunable) Fast simulation Consistent with spirit of Separation Rule But are networks convex? Some systems when answer is known to be Yes virtual work of M/G/1 loss process of M/M/1/K Insight into when No Real data when answer seems to be Yes 10

29 TWO PROBLEMS: SAMPLING AND INVERSION Sampling For end-to-end delay Only have probe samples of a probe of size x Inversion From the measured delay data of perturbed network, may want: Unperturbed delays Link capacities Available bandwidth Cross traffic parameters at hop 3 TCP fairness metric at hop 5. Here we focus on sampling only, do so using non-intrusive probing 10

30 THE QUESTION OF GROUND TRUTH Non-intrusive Delay Delay process using zero sized probes still meaningful Each probe carries a delay: samples available Non-intrusive Loss Losses with x=0 are hard to find.. meaningful but useless Lost probes are not available (where? How?) Probes which are not lost tell us? about loss? Cannot base non-intrusive probing on virtual (x=0) probes 10

31 GENERAL GROUND TRUTH Approach Define end-to-end process directly in continuous time Must be a function of system in equilibrium - no probes, no perturbation! Non-intrusive probing defined directly as a sampling of this process: Interpretation: what probe would have seen if sent in at time. Note Process may be very general, not just isolated probes but probe patterns! Applies equally to loss or delay This is the only way, even virtual probes can be intrusive! 10

32 LOSS GROUND TRUTH EXAMPLES 1-hop FIFO, buffer size K bytes, droptail If packet based instead, becomes independent of x! 2-hop Depends on x Other examples: Packet pair jitter Indicator of packet loss in a train Largest jitter in a chain, or largest lost 10

33 NIPSTA: NON-INTRUSIVE PROBING SEES TIME AVERAGES Empirical averages seen by probe samples converge to true expectation of continuous time process, assuming: stationarity and ergodicity of CT stationarity and ergodicity of PT (easy) independence of CT and PT (easy) joint ergodicity between CT and PT Result follows just as in delay work, using marked point processes, Palm Calculus and Ergodic Theory Not Restricted to Means : Temporal quantities also, eg jitter Probe-train sampling strategies 10

34 OPTIMAL VARIANCE OF SAMPLE MEAN Covariance function Sample Mean Estimator Periodic Probing 10

35 PERIODIC PROBING IS OPTIMAL! Compare integral terms : If R convex, then can use Jensen s inequality: No amount of probe train design can beat periodic! Problem: Periodic is not mixing, so joint ergodicity not assured (phase lock) If occurs, get `sample path bias (estimator not consistent) 10

36 GAMMA RENEWAL PROBING Gamma Law Gamma Renewal Family: As increases, variance drops at constant mean Poisson is beaten once Process tends to periodic as Sensitivity to periodicities increases however Proof: Again uses Jensen s inequality Uses a conditioning trick and a technical result on Gamma densities 10

37 TEST WITH REAL DATA FOR MEAN DELAY 10

38 EXAMPLE WITH REAL DATA 10

39 EXAMPLE WITH REAL DATA 10

On Optimal Probing for Delay and Loss Measurement

On Optimal Probing for Delay and Loss Measurement On Optimal Probing for Delay and Loss Measurement Francois Baccelli INRIA-ENS, Ecole Normale Supérieure, France Francois.Baccelli@ens.fr ABSTRACT Darryl Veitch Dept. of E&E Engineering University of Melbourne,

More information

SPLITTING AND MERGING OF PACKET TRAFFIC: MEASUREMENT AND MODELLING

SPLITTING 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 information

The Role of PASTA in Network Measurement

The 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 information

SAMPLING AND INVERSION

SAMPLING AND INVERSION SAMPLING AND INVERSION Darryl Veitch dveitch@unimelb.edu.au CUBIN, Department of Electrical & Electronic Engineering University of Melbourne Workshop on Sampling the Internet, Paris 2005 A TALK WITH TWO

More information

Multicast-Based Inference of Network-Internal Loss Characteristics

Multicast-Based Inference of Network-Internal Loss Characteristics Multicast-Based Inference of Network-Internal Loss Characteristics R. Cáceres y N.G. Duffield z J. Horowitz x D. Towsley { Abstract Robust measurements of network dynamics are increasingly important to

More information

Analysis of Scalable TCP in the presence of Markovian Losses

Analysis of Scalable TCP in the presence of Markovian Losses Analysis of Scalable TCP in the presence of Markovian Losses E Altman K E Avrachenkov A A Kherani BJ Prabhu INRIA Sophia Antipolis 06902 Sophia Antipolis, France Email:altman,kavratchenkov,alam,bprabhu}@sophiainriafr

More information

A Stochastic Model for TCP with Stationary Random Losses

A 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 information

Multicast-Based Inference of Network-Internal Delay Distributions

Multicast-Based Inference of Network-Internal Delay Distributions Multicast-Based Inference of Network-Internal Delay Distributions F Lo Presti NG Duffield J Horowitz D Towsley AT&T Labs Research Dept Math & Statistics Dept of Computer Science 18 Park Avenue University

More information

Min Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min

Min Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science

More information

Modelling the Arrival Process for Packet Audio

Modelling 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 information

Network Performance Tomography

Network Performance Tomography Network Performance Tomography Hung X. Nguyen TeleTraffic Research Center University of Adelaide Network Performance Tomography Inferring link performance using end-to-end probes 2 Network Performance

More information

Lecture 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 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 information

A source model for ISDN packet data traffic *

A 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 information

Poisson versus periodic path probing (or, does PASTA matter?)

Poisson versus periodic path probing (or, does PASTA matter?) Poisson versus periodic path probing (or, does PASTA matter?) Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Constantinos Dovrolis, Mostafa Ammar Georgia Institute of Technology {mtariq,amogh,dovrolis,ammar}@cc.gatech.edu

More information

Estimating Internal Link Loss Rates Using Active Network Tomography

Estimating Internal Link Loss Rates Using Active Network Tomography Estimating Internal Link Loss Rates Using Active Network Tomography by Bowei Xi A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Statistics) in

More information

Efficient Network-wide Available Bandwidth Estimation through Active Learning and Belief Propagation

Efficient 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 information

Poisson versus periodic path probing (or, does PASTA matter?)

Poisson versus periodic path probing (or, does PASTA matter?) Poisson versus periodic path probing (or, does PASTA matter?) Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Constantinos Dovrolis, Mostafa Ammar Georgia Institute of Technology {mtariq,amogh,dovrolis,ammar}@cc.gatech.edu

More information

Computing and Communications 2. Information Theory -Entropy

Computing and Communications 2. Information Theory -Entropy 1896 1920 1987 2006 Computing and Communications 2. Information Theory -Entropy Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Entropy Joint entropy

More information

Recap. 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 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 information

Performance Evaluation of Queuing Systems

Performance 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 information

Maximum Likelihood Estimation of the Flow Size Distribution Tail Index from Sampled Packet Data

Maximum Likelihood Estimation of the Flow Size Distribution Tail Index from Sampled Packet Data Maximum Likelihood Estimation of the Flow Size Distribution Tail Index from Sampled Packet Data Patrick Loiseau 1, Paulo Gonçalves 1, Stéphane Girard 2, Florence Forbes 2, Pascale Vicat-Blanc Primet 1

More information

Stat 5101 Lecture Notes

Stat 5101 Lecture Notes Stat 5101 Lecture Notes Charles J. Geyer Copyright 1998, 1999, 2000, 2001 by Charles J. Geyer May 7, 2001 ii Stat 5101 (Geyer) Course Notes Contents 1 Random Variables and Change of Variables 1 1.1 Random

More information

Lecture 20: Reversible Processes and Queues

Lecture 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 information

Shortest Paths & Link Weight Structure in Networks

Shortest Paths & Link Weight Structure in Networks Shortest Paths & Link Weight Structure in etworks Piet Van Mieghem CAIDA WIT (May 2006) P. Van Mieghem 1 Outline Introduction The Art of Modeling Conclusions P. Van Mieghem 2 Telecommunication: e2e A ETWORK

More information

Information in Aloha Networks

Information in Aloha Networks Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha

More information

Stochastic Network Calculus

Stochastic 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 information

COPYRIGHTED MATERIAL CONTENTS. Preface Preface to the First Edition

COPYRIGHTED MATERIAL CONTENTS. Preface Preface to the First Edition Preface Preface to the First Edition xi xiii 1 Basic Probability Theory 1 1.1 Introduction 1 1.2 Sample Spaces and Events 3 1.3 The Axioms of Probability 7 1.4 Finite Sample Spaces and Combinatorics 15

More information

Capturing Network Traffic Dynamics Small Scales. Rolf Riedi

Capturing 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 information

TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS

TOWARDS 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 information

WiFi MAC Models David Malone

WiFi MAC Models David Malone WiFi MAC Models David Malone November 26, MACSI Hamilton Institute, NUIM, Ireland Talk outline Introducing the 82.11 CSMA/CA MAC. Finite load 82.11 model and its predictions. Issues with standard 82.11,

More information

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 "

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 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 information

NICTA 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 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 information

Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis

Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis Xiliang Liu City University of New York xliu@gc.cuny.edu Kaliappa Ravindran City College of New York ravi@cs.ccny.cuny.edu

More information

Congestion In Large Balanced Fair Links

Congestion In Large Balanced Fair Links Congestion In Large Balanced Fair Links Thomas Bonald (Telecom Paris-Tech), Jean-Paul Haddad (Ernst and Young) and Ravi R. Mazumdar (Waterloo) ITC 2011, San Francisco Introduction File transfers compose

More information

A Mathematical Model of the Skype VoIP Congestion Control Algorithm

A Mathematical Model of the Skype VoIP Congestion Control Algorithm A Mathematical Model of the Skype VoIP Congestion Control Algorithm Luca De Cicco, S. Mascolo, V. Palmisano Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari 47th IEEE Conference on Decision

More information

Design of IP networks with Quality of Service

Design 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 information

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii LIST OF TABLES... xv LIST OF FIGURES... xvii LIST OF LISTINGS... xxi PREFACE...xxiii CHAPTER 1. PERFORMANCE EVALUATION... 1 1.1. Performance evaluation... 1 1.2. Performance versus resources provisioning...

More information

The Burstiness Behavior of Regulated Flows in Networks

The 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 information

Layer 0. α 1. Path P(0,2) Layer 1. α 2 α 3. Layer 2. α 4. α 5. Layer 3 = Receiver Set

Layer 0. α 1. Path P(0,2) Layer 1. α 2 α 3. Layer 2. α 4. α 5. Layer 3 = Receiver Set onference on Information Sciences and Systems, The Johns Hopkins University, March 4, Least Squares Estimates of Network Link Loss Probabilities using End-to-end Multicast Measurements owei Xi, George

More information

An Entropy-Based Approach to Detecting Covert Timing Channels

An Entropy-Based Approach to Detecting Covert Timing Channels 1 An Entropy-Based Approach to Detecting Covert Timing Channels Steven Gianvecchio and Haining Wang Abstract The detection of covert timing channels is of increasing interest in light of recent exploits

More information

Intro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin

Intro 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 information

LECTURE 3. Last time:

LECTURE 3. Last time: LECTURE 3 Last time: Mutual Information. Convexity and concavity Jensen s inequality Information Inequality Data processing theorem Fano s Inequality Lecture outline Stochastic processes, Entropy rate

More information

Queueing 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. ! 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 information

A Stochastic Model of TCP/IP with Stationary Random Losses

A Stochastic Model of TCP/IP with Stationary Random Losses 1 A Stochastic Model of TCP/IP with Stationary Random Losses Eitan Altman, Konstantin Avrachenkov, Chadi Barakat INRIA, 24 route des Lucioles, 692 Sophia Antipolis, France Email:{altman,kavratch,cbarakat}@sophiainriafr

More information

TCP over Cognitive Radio Channels

TCP over Cognitive Radio Channels 1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done

More information

Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis

Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis 1 Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis Xiliang Liu, Kaliappa Ravindran, and Dmitri Loguinov Abstract This paper analyzes the asymptotic behavior of packet-train

More information

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process.

Reading: 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 information

CHAPTER 3 MATHEMATICAL AND SIMULATION TOOLS FOR MANET ANALYSIS

CHAPTER 3 MATHEMATICAL AND SIMULATION TOOLS FOR MANET ANALYSIS 44 CHAPTER 3 MATHEMATICAL AND SIMULATION TOOLS FOR MANET ANALYSIS 3.1 INTRODUCTION MANET analysis is a multidimensional affair. Many tools of mathematics are used in the analysis. Among them, the prime

More information

STAT 302 Introduction to Probability Learning Outcomes. Textbook: A First Course in Probability by Sheldon Ross, 8 th ed.

STAT 302 Introduction to Probability Learning Outcomes. Textbook: A First Course in Probability by Sheldon Ross, 8 th ed. STAT 302 Introduction to Probability Learning Outcomes Textbook: A First Course in Probability by Sheldon Ross, 8 th ed. Chapter 1: Combinatorial Analysis Demonstrate the ability to solve combinatorial

More information

queue KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology

queue 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 information

Resource Allocation for Video Streaming in Wireless Environment

Resource 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 information

A graph contains a set of nodes (vertices) connected by links (edges or arcs)

A graph contains a set of nodes (vertices) connected by links (edges or arcs) BOLTZMANN MACHINES Generative Models Graphical Models A graph contains a set of nodes (vertices) connected by links (edges or arcs) In a probabilistic graphical model, each node represents a random variable,

More information

INDEX. production, see Applications, manufacturing

INDEX. production, see Applications, manufacturing INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline

More information

Thinning-stable point processes as a model for bursty spatial data

Thinning-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 information

Confidence intervals for the mixing time of a reversible Markov chain from a single sample path

Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Daniel Hsu Aryeh Kontorovich Csaba Szepesvári Columbia University, Ben-Gurion University, University of Alberta

More information

MGR-815. Notes for the MGR-815 course. 12 June School of Superior Technology. Professor Zbigniew Dziong

MGR-815. Notes for the MGR-815 course. 12 June School of Superior Technology. Professor Zbigniew Dziong Modeling, Estimation and Control, for Telecommunication Networks Notes for the MGR-815 course 12 June 2010 School of Superior Technology Professor Zbigniew Dziong 1 Table of Contents Preface 5 1. Example

More information

Processor Sharing Flows in the Internet

Processor Sharing Flows in the Internet STANFORD HPNG TECHNICAL REPORT TR4-HPNG4 Processor Sharing Flows in the Internet Nandita Dukkipati, Nick McKeown Computer Systems Laboratory Stanford University Stanford, CA 9434-93, USA nanditad, nickm

More information

Part I Stochastic variables and Markov chains

Part I Stochastic variables and Markov chains Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)

More information

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into

More information

ECE521 week 3: 23/26 January 2017

ECE521 week 3: 23/26 January 2017 ECE521 week 3: 23/26 January 2017 Outline Probabilistic interpretation of linear regression - Maximum likelihood estimation (MLE) - Maximum a posteriori (MAP) estimation Bias-variance trade-off Linear

More information

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control Saurabh Jain Joint work with Dr. Dmitri Loguinov June 21, 2007 1 Agenda Introduction Analysis of RCP QI-RCP PIQI-RCP Comparison Wrap

More information

An Overview of Traffic Matrix Estimation Methods

An Overview of Traffic Matrix Estimation Methods An Overview of Traffic Matrix Estimation Methods Nina Taft Berkeley www.intel.com/research Problem Statement 1 st generation solutions 2 nd generation solutions 3 rd generation solutions Summary Outline

More information

Probability 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 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 information

Input-queued switches: Scheduling algorithms for a crossbar switch. EE 384X Packet Switch Architectures 1

Input-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 information

Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues

Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues George Kesidis 1, Takis Konstantopoulos 2, Michael Zazanis 3 1. Elec. & Comp. Eng. Dept, University of Waterloo, Waterloo, ON,

More information

Statistical Estimation of Internal Available Bandwidth

Statistical Estimation of Internal Available Bandwidth Statistical Estimation of Internal Available Bandwidth Ian H. Dinwoodie ISDS Box 9025, Duke University, Durham, NC 27708 June 9 2006 revised April 23 2007 Abstract This paper presents a method for using

More information

CPSC 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 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 information

Efficient MCMC Samplers for Network Tomography

Efficient MCMC Samplers for Network Tomography Efficient MCMC Samplers for Network Tomography Martin Hazelton 1 Institute of Fundamental Sciences Massey University 7 December 2015 1 Email: m.hazelton@massey.ac.nz AUT Mathematical Sciences Symposium

More information

Data analysis and stochastic modeling

Data 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 information

class class ff ff (t) packet loss packet loss (t) - - RED controlled queue Figure : Illustration of a Differentiad Services framework. RED has been an

class class ff ff (t) packet loss packet loss (t) - - RED controlled queue Figure : Illustration of a Differentiad Services framework. RED has been an Modeling RED with Two Traffic Classes P. Kuusela and J. T. Virtamo Laboratory of Telecommunications Technology Helsinki University of Technology P. O. Box 3000, FIN-005 HUT, Finland Email: fpirkko.kuusela,

More information

TABLE OF CONTENTS CHAPTER 1 COMBINATORIAL PROBABILITY 1

TABLE OF CONTENTS CHAPTER 1 COMBINATORIAL PROBABILITY 1 TABLE OF CONTENTS CHAPTER 1 COMBINATORIAL PROBABILITY 1 1.1 The Probability Model...1 1.2 Finite Discrete Models with Equally Likely Outcomes...5 1.2.1 Tree Diagrams...6 1.2.2 The Multiplication Principle...8

More information

Queueing Networks G. Rubino INRIA / IRISA, Rennes, France

Queueing 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 information

A Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale

A Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale 222 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 2, APRIL 2003 A Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale Do Young Eun and Ness B. Shroff, Senior

More information

Stochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS

Stochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Stochastic Processes Theory for Applications Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv Swgg&sfzoMj ybr zmjfr%cforj owf fmdy xix Acknowledgements xxi 1 Introduction and review

More information

Introduction to Queueing Theory with Applications to Air Transportation Systems

Introduction 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 information

Northwestern University Department of Electrical Engineering and Computer Science

Northwestern University Department of Electrical Engineering and Computer Science Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability

More information

Decision Tree Learning Lecture 2

Decision Tree Learning Lecture 2 Machine Learning Coms-4771 Decision Tree Learning Lecture 2 January 28, 2008 Two Types of Supervised Learning Problems (recap) Feature (input) space X, label (output) space Y. Unknown distribution D over

More information

J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY

J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents

More information

A discrete-time priority queue with train arrivals

A 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 information

These are special traffic patterns that create more stress on a switch

These are special traffic patterns that create more stress on a switch Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually

More information

PROBABILITY AND STOCHASTIC PROCESSES A Friendly Introduction for Electrical and Computer Engineers

PROBABILITY AND STOCHASTIC PROCESSES A Friendly Introduction for Electrical and Computer Engineers PROBABILITY AND STOCHASTIC PROCESSES A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates Rutgers, The State University ofnew Jersey David J. Goodman Rutgers, The State University

More information

cs/ee/ids 143 Communication Networks

cs/ee/ids 143 Communication Networks cs/ee/ids 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also

More information

Queueing Theory and Simulation. Introduction

Queueing Theory and Simulation. Introduction Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan

More information

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

Class 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 information

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( )

b. ( ) ( ) ( ) ( ) ( ) 5. Independence: Two events (A & B) are independent if one of the conditions listed below is satisfied; ( ) ( ) ( ) 1. Set a. b. 2. Definitions a. Random Experiment: An experiment that can result in different outcomes, even though it is performed under the same conditions and in the same manner. b. Sample Space: This

More information

NEW FRONTIERS IN APPLIED PROBABILITY

NEW 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 information

Modeling Impact of Delay Spikes on TCP Performance on a Low Bandwidth Link

Modeling Impact of Delay Spikes on TCP Performance on a Low Bandwidth Link Modeling Impact of Delay Spikes on TCP Performance on a Low Bandwidth Link Pasi Lassila and Pirkko Kuusela Networking Laboratory Helsinki University of Technology (HUT) Espoo, Finland Email: {Pasi.Lassila,Pirkko.Kuusela

More information

Markovian Model of Internetworking Flow Control

Markovian Model of Internetworking Flow Control Информационные процессы, Том 2, 2, 2002, стр. 149 154. c 2002 Bogoiavlenskaia. KALASHNIKOV MEMORIAL SEMINAR Markovian Model of Internetworking Flow Control O. Bogoiavlenskaia Petrozavodsk State University

More information

Overfitting, Bias / Variance Analysis

Overfitting, Bias / Variance Analysis Overfitting, Bias / Variance Analysis Professor Ameet Talwalkar Professor Ameet Talwalkar CS260 Machine Learning Algorithms February 8, 207 / 40 Outline Administration 2 Review of last lecture 3 Basic

More information

Link Models for Circuit Switching

Link 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 information

ECEN 689 Special Topics in Data Science for Communications Networks

ECEN 689 Special Topics in Data Science for Communications Networks ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 13 Measuring and Inferring Traffic Matrices

More information

6. Bernoulli Trials and the Poisson Process

6. Bernoulli Trials and the Poisson Process 1 of 5 7/16/2009 7:09 AM Virtual Laboratories > 14. The Poisson Process > 1 2 3 4 5 6 7 6. Bernoulli Trials and the Poisson Process Basic Comparison In some sense, the Poisson process is a continuous time

More information

CS 798: Homework Assignment 3 (Queueing Theory)

CS 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 information

Applied Probability and Stochastic Processes

Applied Probability and Stochastic Processes Applied Probability and Stochastic Processes In Engineering and Physical Sciences MICHEL K. OCHI University of Florida A Wiley-Interscience Publication JOHN WILEY & SONS New York - Chichester Brisbane

More information

Measurements made for web data, media (IP Radio and TV, BBC Iplayer: Port 80 TCP) and VoIP (Skype: Port UDP) traffic.

Measurements made for web data, media (IP Radio and TV, BBC Iplayer: Port 80 TCP) and VoIP (Skype: Port UDP) traffic. Real time statistical measurements of IPT(Inter-Packet time) of network traffic were done by designing and coding of efficient measurement tools based on the Libpcap package. Traditional Approach of measuring

More information

End-to-end Estimation of the Available Bandwidth Variation Range

End-to-end Estimation of the Available Bandwidth Variation Range 1 End-to-end Estimation of the Available Bandwidth Variation Range Manish Jain Georgia Tech jain@cc.gatech.edu Constantinos Dovrolis Georgia Tech dovrolis@cc.gatech.edu Abstract The available bandwidth

More information

UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.

UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours. UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next

More information

Utility, Fairness and Rate Allocation

Utility, Fairness and Rate Allocation Utility, Fairness and Rate Allocation Laila Daniel and Krishnan Narayanan 11th March 2013 Outline of the talk A rate allocation example Fairness criteria and their formulation as utilities Convex optimization

More information

Dynamic Power Allocation and Routing for Time Varying Wireless Networks

Dynamic Power Allocation and Routing for Time Varying Wireless Networks Dynamic Power Allocation and Routing for Time Varying Wireless Networks X 14 (t) X 12 (t) 1 3 4 k a P ak () t P a tot X 21 (t) 2 N X 2N (t) X N4 (t) µ ab () rate µ ab µ ab (p, S 3 ) µ ab µ ac () µ ab (p,

More information

Classification and Regression Trees

Classification and Regression Trees Classification and Regression Trees Ryan P Adams So far, we have primarily examined linear classifiers and regressors, and considered several different ways to train them When we ve found the linearity

More information