1 Statistical Multiplexing: Basic Principles Carey Williamson University of Calgary.

Slides:

Advertisements

Similar presentations

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

Advertisements

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,

The JOURNEY Active Network Model Maximilian Ott et al. IEEE Journal on Selected Areas in Communications, vol.19, no. 3, March 2001.

A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.

Recent Progress on a Statistical Network Calculus Jorg Liebeherr Department of Computer Science University of Virginia.

E E Module 17 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 ATM VP-based (or MPLS path) Restoration with Controlled Over-

1 LAN Traffic Measurements Carey Williamson Department of Computer Science University of Calgary.

1 Call Admission Control Carey Williamson Department of Computer Science University of Calgary.

1 Cell Networking Carey Williamson Department of Computer Science University of Calgary.

1 Self-Similar Ethernet LAN Traffic Carey Williamson University of Calgary.

Presented By: Pariya Raoufi. Motivations Future applications require: higher bandwidth, generate a heterogeneous mix of network traffic, low latency.

Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,

October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.

Supporting Stored Video: Reducing Rate Variability and End-toEnd Resource Requirements through Optimal Smoothing By James D. salehi, Zhi-Li Zhang, James.

ATM Networks An Engineering Approach to Computer Networking.

2001/09/26Chin-Kai Wu, CS, NTHU1 Resource Allocation and Management in DiffServ Networks for IP Telephony Maarten Büchli, Danny De Vleeschauwer, Jan Janssen,

Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Statistical inference (Sec. )

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

Random Early Detection Gateways for Congestion Avoidance

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

2001/11/29Chin-Kai Wu, CS, NTHU1 Characteristics of Network Delay and Delay Jitter and its Effect on Voice over IP Li Zheng, Liren Zhang, Dong Xu Communications,

Connection Admission Control Schemes for Self-Similar Traffic Yanping Wang Carey Williamson University of Saskatchewan.

1 ATM Switching: An Overview Carey Williamson Department of Computer Science University of Calgary.

A Traffic Characterization of Popular On-Line Games Wu-Chang Feng, Francis Chang, Wu- Chi Feng, and Jonathan Walpole IEEE/ACM Trans. Networking, Jun

UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.

1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,

Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,

Energy Aware Network Operations Authors: Priya Mahadevan, Puneet Sharma, Sujata Banerjee, Parthasarathy Ranganathan HP Labs IEEE Global Internet Symposium.

Probability and the Sampling Distribution Quantitative Methods in HPELS 440:210.

Network Management and Internet Pricing S. Raghavan J. Bailey The Robert H. Smith School of Business University of Maryland.

Lin Yingpei (Huawei Technologies) doc.: IEEE /0056r1 Submission Jan 2014 Slide 1 Traffic Model on Virtual Desktop Infrastructure Date:

Traffic Modeling.

Analyzing Reliability and Validity in Outcomes Assessment (Part 1) Robert W. Lingard and Deborah K. van Alphen California State University, Northridge.

Tutor: Prof. A. Taleb-Bendiab Contact: Telephone: +44 (0) CMPDLLM002 Research Methods Lecture 8: Quantitative.

AP Statistics Section 9.3A Sample Means. In section 9.2, we found that the sampling distribution of is approximately Normal with _____ and ___________.

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

Assumptions of value-added models for estimating school effects sean f reardon stephen w raudenbush april, 2008.

Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)

Distributions of the Sample Mean

LANGUAGE MODELS FOR RELEVANCE FEEDBACK Lee Won Hee.

Chapter 18: Sampling Distribution Models

1 On Maximum Rate Control of Weighted Fair Scheduling Jeng Farn Lee.

1 Self Similar Video Traffic Carey Williamson Department of Computer Science University of Calgary.

1 A Cross-Layer Scheduling Algorithm With QoS Support in Wireless Networks Qingwen Liu, Student Member, IEEE, Xin Wang, Member, IEEE, and Georgios B. Giannakis,

ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.

Z-Scores Quantitative Methods in HPELS HPELS 6210.

1 Collecting and Interpreting Quantitative Data Deborah K. van Alphen and Robert W. Lingard California State University, Northridge.

Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.

OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,

Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.

Energy Aware Network Operations

Chapter 18: Sampling Distribution Models

Probability and the Sampling Distribution

Quantitative Methods in HPELS HPELS 6210

CprE 458/558: Real-Time Systems

Presented by LINGLING MENG( ), XUN XU( )

Random Early Detection Gateways for Congestion Avoidance

CHAPTER 1 Exploring Data

CHAPTER 1 Exploring Data

CHAPTER 1 Exploring Data

CHAPTER 1 Exploring Data

Schedulability Conditions for Scheduling Algorithms

A Block Based MAP Segmentation for Image Compression

CSE 550 Computer Network Design

CHAPTER 1 Exploring Data

An Engineering Approach to Computer Networking

CHAPTER 1 Exploring Data

Presentation transcript:

1 Statistical Multiplexing: Basic Principles Carey Williamson University of Calgary

2 Introduction l Statistical multiplexing is one of the fundamental principles on which ATM networking is based l Everyone understands the basic concept of stat mux, but figuring out how to do it right is still a hard problem l LOTS of papers on it, but probably as many “answers” as authors!

3 Agenda l This presentation: one sample paper l Woodruff and Kositpaiboon, “Multimedia Traffic Management Principles for Guaranteed ATM Network Performance” l IEEE JSAC, Vol. 8, No. 3, April 1990

4 Overview of Paper l Identifies several high-level general principles regarding statistical multiplexing, traffic management, and call admission control l Presents simulation results to illustrate quantitatively the regions where statistical multiplexing makes good sense and where it does not

5 Main Principles l Reasonable bandwidth utilization l Robustness to traffic uncertainties l Simplicity l Node architecture independence

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Deterministic Multiplexing for Peak/Mean = 2 0.5

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Deterministic Multiplexing for Peak/Mean = 20

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Deterministic Multiplexing for Peak/Mean = Deterministic Multiplexing for Peak/Mean = 20

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Statistical Multiplexing for Peak/Mean = 2 when average burst B = 10

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Statistical Multiplexing for Peak/Mean = 2 when average burst B = 100

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization B = 10 B = 100 Peak/Mean = 2

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Statistical Multiplexing for Peak/Mean = 20 when average burst B = 10

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization Statistical Multiplexing for Peak/Mean = 20 when average burst B = 100

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization B = 10 B = 100 Peak/Mean = 20

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization B = 10 B = 100 Peak/Mean = 20 B = 10 B = 100 Peak/Mean = 2

Granularity of Source (Peak rate/Link rate) Maximum Link Utilization B = 10 B = 100 Peak/Mean = 20 B = 10 B = 100 Peak/Mean = 2 Best region for statistical multiplexing

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Buffer Requirements

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Buffer Requirements Utilization = 10%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Buffer Requirements Utilization = 50%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Buffer Requirements Utilization = 90%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Deterministic Utilization = 10%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Geometric Utilization = 10%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Utilization = 50% Deterministic

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Utilization = 50% Geometric

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Utilization = 90% Deterministic

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution Utilization = 90% Geometric

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution G G G G G D D D U = 90% U = 50%

Granularity of Source (Peak rate/Link rate) Buffer Size/Avg Burst Length 0 30 Effect of Burst Size Distribution G G G G G D D D U = 90% U = 50% Best region for statistical multiplexing

31 Summary l A nice paper describing the general principles to follow in call admission control, statistical multiplexing, and traffic management l Quantitative illustration of performance effects, and illustration of when statistical multiplexing works and when it does not

32 Summary (Cont’d) l General traffic management principles: –Reasonable bandwidth utilization –Robustness –Simplicity –Node architecture independence

33 Summary (Cont’d) l Simulation observations: l Easier to multiplex “small” things than “big” things (peak to link ratio) l The burstier the traffic sources (peak to mean ratio), the greater the potential gains of statistical multiplexing, but the harder it is to multiplex traffic safely and still guarantee performance

34 Summary (Cont’d) l Easier to multiplex homogeneous traffic than it is for heterogeneous traffic l The larger the average burst length, the harder it is to multiplex the traffic l The larger the average burst length, and the greater the variation in burst size, the more buffers you will need in your system in order to multiplex effectively