10/24/2015Anue Systems, Inc. www.anuesystems.com 1 v1.0 - 20050426 Telecommunications Industry AssociationTR-30.3/08-12-022 Lake Buena Vista, FL December.

Slides:

Advertisements

Similar presentations

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.

Advertisements

Min-Plus Linear Systems Theory and Bandwidth Estimation Min-Plus Linear Systems Theory and Bandwidth Estimation TexPoint fonts used in EMF. Read the TexPoint.

10/11/2014Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December.

1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.

TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:

William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.

CONGESTION CONTROL T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System.

24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.

UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä

Analytical Modeling and Evaluation of On- Chip Interconnects Using Network Calculus M. BAkhouya, S. Suboh, J. Gaber, T. El-Ghazawi NOCS 2009, May 10-13,

Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,

The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP

Statistics & Modeling By Yan Gao. Terms of measured data Terms used in describing data –For example: “mean of a dataset” –An objectively measurable quantity.

Random Variables Dr. Abdulaziz Almulhem. Almulhem©20022 Preliminary An important design issue of networking is the ability to model and estimate performance.

Failure Patterns Many failure-causing mechanisms give rise to measured distributions of times-to-failure which approximate quite closely to probability.

1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp

Data Communication and Networks

Random Early Detection Gateways for Congestion Avoidance

Introduction. 2 What Is SmartFlow? SmartFlow is the first application to test QoS and analyze the performance and behavior of the new breed of policy-based.

6/28/2015CSC82601 Radio-resource sharing for adhoc Networking with UWB. by Francesca Cuomo, Cristina Martello, Andrea Baiocchi, and Fabrizio Capriotti.

28-1 ©2006 Raj Jain Random Variate Generation.

7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.

1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,

STATISTIC & INFORMATION THEORY (CSNB134)

597 APPLICATIONS OF PARAMETERIZATION OF VARIABLES FOR MONTE-CARLO RISK ANALYSIS Teaching Note (MS-Excel)

L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.

Routing Protocol Evaluation David Holmer

Bandwidth Estimation TexPoint fonts used in EMF.

Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.

Chapter 3 System Performance and Models. 2 Systems and Models The concept of modeling in the study of the dynamic behavior of simple system is be able.

Implementation of Finite Field Inversion

ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.

1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.

1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.

Anue Systems Inc1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008.

27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.

1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.

9-1 Chapter 9 Project Scheduling Chapter 9 Project Scheduling McGraw-Hill/Irwin Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.

1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO

© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.

1 SmartGossip: An Adaptive Broadcast Service for Wireless Sensor Networks Presented By Thomas H. Hand Duke University Adapted from: “ SmartGossip: An Adaptive.

Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.

9.7 Other Congestion Related Issues Outline Queuing Discipline Avoiding Congestion.

1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.

V Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008.

Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.

V Telecommunications Industry AssociationTR-30.3/ Arlington, VA, March 30-31, 2009.

THROUGHPUT ANALYSIS OF IEEE DCF BASIC IN PRESENCE OF HIDDEN STATIONS Shahriar Rahman Stanford Electrical Engineering

CONGESTION CONTROL.

1 CSCD 326 Data Structures I Hashing. 2 Hashing Background Goal: provide a constant time complexity method of searching for stored data The best traditional.

1 Chapter 4 Fundamental Queueing System. 2 3 Ref: Mischa Schwartz “Telecommunication Networks” Addison-Wesley publishing company 1988.

Internet Protocol Version 4 VersionHeader Length Type of Service Total Length IdentificationFragment Offset Time to LiveProtocolHeader Checksum Source.

Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.

Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.

Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.

Linear Regression Linear Regression. Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Purpose Understand Linear Regression. Use R functions.

Dynamics of Binary Search Trees under batch insertions and deletions with duplicates ╛ BACKGROUND The complexity of many operations on Binary Search Trees.

RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.

Distance Vector Routing

3/18/2016Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Arlington, VA July ,

Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.

V Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008.

Chapter 4: Basic Estimation Techniques

QoS & Queuing Theory CS352.

Topics discussed in this section:

CONGESTION CONTROL.

ECE 544 Protocol Design Project 2016

Maths Unit 1 - Algebra Order of operations - BIDMAS Algebraic Notation

Parametric Methods Berlin Chen, 2005 References:

DetNet Bounded Latency-04

Presentation transcript:

10/24/2015Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008

10/24/2015Anue Systems, Inc. 2 Overview Recap last meeting Define a Burstiness Model Define the disturbance Load PDF  Simple generators (CBR, Gamma)  Bursty case  Composite case Next presentation: Putting it all together  The Relationship between load and delay/loss one node multiple cascaded nodes

10/24/2015Anue Systems, Inc. 3 Recap: G.8261 Network model

10/24/2015Anue Systems, Inc. 4 Recap: Node model 10 cascaded instances of this basic element Disturbance load generator + Input packets Output packets Disturbance Packets Link Latency

10/24/2015Anue Systems, Inc. 5 Recap: Test cases ScenarioNote G.8261MEF18 Test CaseTMDS1E1DS3E3 Static Load1TM2 Step Changes 2TM1 2TM26.1a6.1b6.1c6.1d Slow Ramp24 hr 3TM1 3TM26.2a6.2b6.2c6.2d Network Outage 10 sec 4TM1 4TM26.3a6.3b6.3c6.3d 100 sec 4TM1 4TM26.4a6.4b6.4c6.4d Congestion 10 sec 5TM1 5TM26.5a6.5b6.5c6.5d 100 sec 5TM1 5TM26.6a6.6b6.6c6.6d Route Change 1 hop 6TM1 6TM26.7a6.7b6.7c6.7d 5 hops 6TM1 6TM26.8a6.8b6.8c6.8d

10/24/2015Anue Systems, Inc. 6 TM1 and TM2 TM1 is composed of packets carrying voice and SMS messages and is specified as  80% minimum size packets (64 bytes)  5% medium size packets (576 bytes)  15 % maximum size packets (1518 bytes) TM2 is composed of larger packets representative of a more data-centric network. It is specified as  30% minimum size packets (64 bytes)  10% medium size packets (576 bytes)  60 % maximum size packets (1518 bytes) The maximum size packets for both TM1 and TM2 occur in bursts lasting between 0.1s and 3 s. The minimum size packets for TM1 are constant bit rate (CBR).

10/24/2015Anue Systems, Inc. 7 A fly in the ointment Definitions of TM1 and TM2 in G.8261 are incomplete  Burstiness is critical and not defined  I’ll define one view of burstiness later And only max-len pkt generators are bursty. Others need to be specified as well. Assume CBR for simplicity, but there is no loss of generality in the subsequent analysis.

10/24/2015Anue Systems, Inc. 8 Burstiness: Definitions Define as an off and on process  Disturbance load generator is off or on Definitions:  Nominal generator load is L nom  While the generator is on, it creates a burst load L burst  While the generator is off, it generates load of 0%  The time that the generator is on is T burst  The time that the generator is off is T gap

10/24/2015Anue Systems, Inc. 9 Burstiness: Some math Require: Average load over a burst and immediately following gap must equal L nom. Therefore: To complete the burstiness definition  Must define either L burst or T gap. One way: Define L burst as a function of L nom. Where L Bmin and L Bmax represent the minimum and maximum burst load values Thus there is a linear relation between burst & nominal load

10/24/2015Anue Systems, Inc Burstiness: more math The only remaining item is T gap : Can calculate burst duty cycle as well:

10/24/2015Anue Systems, Inc Burstiness Example #1 L Bmin =0, L Bmax =200%, then:  L burst = 2 x L nom  Duty is always 50%.

10/24/2015Anue Systems, Inc Burstiness Example #2 L Bmin = L Bmax = 100%, then:  Burst load is constant at 100%  Duty decreases as L nom increases.

10/24/2015Anue Systems, Inc Burstiness Example #3 L Bmin = 50%, L Bmax = 133%

10/24/2015Anue Systems, Inc Question What happens if we take  L Bmin = 0%, L Bmax = 100% ?? Burstiness disappears entirely.

10/24/2015Anue Systems, Inc Burstiness: So: Is this a good way to define burstiness?  Yes. It is a good way to set up a model.  It is flexible to model a wide variety of network conditions, while still being mathematically tractable. We gave three examples (+1) of how the mathematical model can be used. This shows its flexibility.

10/24/2015Anue Systems, Inc Load Probability Density Function (PDF) The Load PDF represents the fraction of time that a given disturbance load generator is generating a given short-term load level. We analyze two fairly simple cases here  CBR generator  Gamma generator Then generalize to bursty sources using the foregoing burstiness model And further generalize to sums of disturbance loads.

10/24/2015Anue Systems, Inc CBR generator A CBR packet generator always generates the same percentage load, so it has a load PDF consisting of an impulse at the generator’s percentage load.

10/24/2015Anue Systems, Inc Gamma generator A Gamma packet generator has a load PDF that is based on the Gamma probability density function. The gamma distribution has two parameters  The shape of the distribution  The horizontal scale. We choose k=2 and then substitute  =  /k=  /2 so that the PDF is parameterized by its mean value .

10/24/2015Anue Systems, Inc Gamma Generator (cont.)

10/24/2015Anue Systems, Inc Load PDF for bursty generators The PDF of a bursty generator has two parts:  An impulse at zero load, which represents the proportion of time that the generator is off.  A scaled copy of the load generator’s PDF which represents the time that the generator is on. The relative weights of these two parts are given by the duty cycle of the bursts which we calculated earlier

10/24/2015Anue Systems, Inc Bursty CBR PDF: Example #1 Take a bursty CBR generator at L nom =50%  L Bmin = 50% and L Bmax = 133% Calculate that L burst =92% and Duty=55%.

10/24/2015Anue Systems, Inc Bursty CBR PDF: Example #1 (cont.)

10/24/2015Anue Systems, Inc Bursty Gamma PDF: Example #2 Take a bursty Gamma generator at L nom =50%  L Bmin = 50% and L Bmax = 133% Burstiness same as before  L burst =92% and Duty=55%.

10/24/2015Anue Systems, Inc Bursty Gamma PDF: Example #2 (cont.)

10/24/2015Anue Systems, Inc Composite Disturbance Load PDFs A composite disturbance load is just a sum of two or more underlying disturbance loads. Want to calculate the load PDF for such a source (e.g. TM1) For TM1, the traffic mix is 80%/5%/15%, so a 50% nominal load has  40% load of CBR 64 byte packets  2.5% load of CBR 576 byte packets  7.5% Bursty load of 1518 byte packets

10/24/2015Anue Systems, Inc Composite Disturbance Load PDFs For max size (1518 byte) bursty generator, we use the same burst parameters as before, L Bmin = 50% and L Bmax = 133%, which gives L burst =56% and Duty=13%. 40% CBR 64-byte 2.5% CBR 576-byte 7.5% Bursty 1518-byte 50% TM1 CBR Bursty 

10/24/2015Anue Systems, Inc Composite Disturbance Load PDFs We know the load PDF for the two CBR generators We do not know the load PDF underlying the bursty generator. It is not specified. Therefore, analyze for both the CBR and Gamma cases  TM1 Bursty CBR  TM1 Bursty Gamma

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty CBR

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty CBR To calculate the overall PDF, weeed to calculate the PDF of a sum of random variables. This can be accomplished by convolution. Use the  symbol to represent convolution

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty CBR

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty CBR

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty Gamma

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty Gamma

10/24/2015Anue Systems, Inc Load PDF: TM1 Bursty Gamma

10/24/2015Anue Systems, Inc Next steps Analytical  Show how the disturbance load PDF is related to packet latency and loss at one node  Show how this can be generalized to two or more cascaded nodes  Show how Packet Delay Variation PDV can be predicted using an analytical model Discuss how to modify the disturbance load model to better suit the needs of next version of TIA-921B.