 Throughput subject to packet size  High latency: 11 – 32 ms  Not flexible  Choose high throughput or low latency.

Slides:



Advertisements
Similar presentations
Centre for Communications Research Scheduling Techniques for Improving Call Capacity for VoIP Traffic in MIMO-OFDMA Networks M. Nicolaou, S. Armour, A.
Advertisements

Doc.: IEEE /1413r1 Submission November 2013 Edward Reuss, UnaffiliatedSlide 1 Real-Time Multicast Streams During Power Save – Part 2 Date:
© 2006 Cisco Systems, Inc. All rights reserved. Module 4: Implement the DiffServ QoS Model Lesson 4.8: Understanding WAN Link Efficiency Mechanisms.
EE 122: Error detection and reliable transmission Ion Stoica September 16, 2002.
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
An Empirical Study of Delay Jitter Management Policies D. Stone and K. Jeffay Computer Science Department University of North Carolina, Chapel Hill ACM.
Mapping a Network by Latency (and other things) Client connecting to , UDP port.
DataGrid WP7 Meeting CERN April 2002 R. Hughes-Jones Manchester Some Measurements on the SuperJANET 4 Production Network (UK Work in progress)
Doc.: IEEE / ax Submission March 2015 Slide 1 Discussion on OFDMA Scheduling for ax Date: Authors: Huawei Technologies.
Submission doc.: IEEE /0097r0 Slide 1 Performance Analysis of Frequency Selective Scheduling Date: Authors: Ningbo Zhang, BUPT January.
Submission doc.: IEEE /1452r0 November 2014 Leif Wilhelmsson, EricssonSlide 1 Frequency selective scheduling in OFDMA Date: Authors:
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
High survival HF radio network Michele Morelli, Marco Moretti, Luca Sanguinetti CNIT- PISA.
High Performance, Easy to Deploy Wireless. Agenda Foundry Key Differentiators Business Value Product Overview Questions.
Multimedia and Mobile communications Laboratory Augmenting Mobile 3G Using WiFi Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani Jimin.
Dynamic versus Static Traffic Policing: A New Approach for Videoconference Traffic over Wireless Cellular Networks Author: Polychronis Koutsakis Anukrati.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Raj Jain The Ohio State University R1: Performance Analysis of TCP Enhancements for WWW Traffic using UBR+ with Limited Buffers over Satellite.
BMAC - Versatile Low Power Media Access for Wireless Sensor Networks.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
02 – Performance Basics 1CS Computer Networks.
Doc.: IEEE /0424r0 Submission March 2012 Ron Porat, Broadcom Downclocking Options for TGaf PHY Date: Authors: Slide 1.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
1© Nokia Siemens Networks Confidential Realities of LTE Deployment Bill Payne Head of Innovation Team CTO Office.
Voice-Data Channel Access Integration in Third Generation Microcellular Wireless Network : Design and Performance Evaluation Allan C. Cleary Chapter 2.
Addressing Image Compression Techniques on current Internet Technologies By: Eduardo J. Moreira & Onyeka Ezenwoye CIS-6931 Term Paper.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
CSCI 465 D ata Communications and Networks Lecture 14 Martin van Bommel CSCI 465 Data Communications & Networks 1.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
Designing for High Density Wireless LANs Last Update Copyright Kenneth M. Chipps Ph.D.
Business objectives. What are business objectives? On your own write down how a business comes up with objectives and what these would typically be about
Submission doc.: IEEE /0869r0 July 2015 Hakan Persson, Ericsson ABSlide 1 OFDMA and VoIP Capacity Date: Authors:
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Dynamic and Persistent Scheduling for Voice over IP Traffic in the Long-Term Evolution Uplink Master’s.
Dynamic Data Rate and Transmit Power Adjustment in IEEE Wireless LANs Pierre Chevillat, Jens Jelitto, and Hong Linh Truong IBM Zurich Research Laboratory.
Forward Error Correction vs. Active Retransmit Requests in Wireless Networks Robbert Haarman.
, Slide 1 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Impact of Frame Length on Latency and Throughput]
Doc.: IEEE /0071r0 January 2013 Submission Channel indication in RAW/TWT Date: Authors: Merlin, Qualcomm Slide 1.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Wireless Sensor Networks M Homework #2. IEEE MAC Protocol - Star topology – Part I Consider a square area equipped with 30 nodes distributed.
A Throughput-Adaptive MAC Protocol for Wireless Sensor Networks Zuo Luo, Liu Danpu, Ma Yan, Wu Huarui Beijing University of Posts and Telecommunications.
Review Session Jehan-François Pâris. Agenda Statistical Analysis of Outputs Operational Analysis Case Studies Linear Regression.
Emir Halepovic, Jeffrey Pang, Oliver Spatscheck AT&T Labs - Research
Performance Evaluation of IEEE
IEEE Standard The IEEE (Low Rate Wireless Personal Area Network) Standard Lance Hester Ken Cornett Florida Communication Research Lab.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
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,
CS541 Advanced Networking 1 Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang 4/20/2009.
8 Date: Topic: Similar Triangles __ (7.5) Warm-up: 6 The shapes are similar. Find the similarity ratio, x, and y y 93° x x Similarity ratio =
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-05.txt Slides:
Artur BarczykRT2003, High Rate Event Building with Gigabit Ethernet Introduction Transport protocols Methods to enhance link utilisation Test.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Data Link Layer Chapter 3.
doc.: IEEE /409r0 Submission March 2002 Mathilde BenvenisteSlide 1 Persistence Factors in EDCF Mathilde Benveniste
May 2014doc.: IEEE Submission ZC, HL, QL, CW, Slide 1 Project: IEEE P Working Group for Wireless Personal Area.
Computer Networking Lecture 16 – Reliable Transport.
Adaptive Roaming between LTE and Wi-Fi 1 Daeguil Science high school, Daegu, Republic of Korea. 2 Daegu Gyeongbuk Institute of Science and Technology,
Dirk Grunwald Dept. of Computer Science, ECEE and ITP University of Colorado, Boulder.
Doc.: IEEE /0477r0 Submission March 2007 C. Wright, AzimuthSlide 1 Proposal for fixing additional issues in some subclauses Notice: This document.
Efficient FDMA MU Transmission Schemes for WUR WLAN
2200 Mission College Blvd., Santa Clara, CA 95054, USA
Sally Floyd and Eddie Kohler draft-floyd-ccid4-00.txt November 2006
2200 Mission College Blvd., Santa Clara, CA 95054, USA
CX-CBP in 3.65GHz – Simulation results
< Sungrae Cho >, <Chung-Ang UNIV>
Efficient FDMA MU Transmission Schemes for WUR WLAN
OFDMA performance in 11ax
CX-CBP in 3.65GHz – Simulation results
Schedule Element Synchronization and Simplification
Efficient FDMA MU Transmission Schemes for WUR WLAN
Direct Variation How else could we have solved for k?
Multi-Link Aggregation: Latency Gains
Presentation transcript:

 Throughput subject to packet size  High latency: 11 – 32 ms  Not flexible  Choose high throughput or low latency

packet size64 Bytes128 Bytes256 Bytes512Bytes1024 Bytes1280 Bytes1518Bytes1522 Bytes(Vlan tagged) UL %DL%Wi100T.....Wi100T.....Wi100T.....Wi100T.....Wi100T.....Wi100T.....Wi100T.....Wi100T Wi-Fi is extremely sensitive to packet size Max throughput can only be achieved when big packet sizes are transmitted.

 The small packet problem can be solved in Wi-Fi through concatenation.  Small packets are received in the radio and grouped into larger packets.  The end result is similar data throughput as with large packets. PROBLEM: Concatenation adds 10 – 14 ms Delay!

 The latency problem in Wi-Fi can be resolved by fragmenting packets so that smaller packets are sent on a fixed time interval.  This means that all packet sizes are fixed and at a smaller size.  As seen on the previous slides, Wi-Fi performance suffers when packet-sizes are small. PROBLEM: Fixed frames lower data throughput!

 Throughput subject to packet size  Concatenation solves problem  Adds significant delay (+10 – 14ms)  High latency: 11 – 18 ms (21 – 32ms w/concatenation)  Fixed frame sizes (fragmentation) solves latency  Turn-off concatenation  Choose latency or throughput  Wi-Fi based product can offer: 1. High Throughput with high latency 2. Low latency with low throughput at fixed frame rate