Self-Configuring Network Traffic Generation

Total Page:16

File Type:pdf, Size:1020Kb

Self-Configuring Network Traffic Generation Self-Configuring Network Traffic Generation Joel Sommers Paul Barford University of Wisconsin–Madison University of Wisconsin–Madison [email protected] [email protected] ABSTRACT results [15, 30]. Having appropriate tools for generating scal- The ability to generate repeatable, realistic network traffic is able, tunable and representative network traffic is therefore critical in both simulation and testbed environments. Traf- of fundamental importance. Such tools are critical in labo- fic generation capabilities to date have been limited to either ratory test environments (such as [10, 11]) where they can simple sequenced packet streams typically aimed at through- be used to evaluate behavior and performance of new sys- put testing, or to application-specific tools focused on, for tems and real networking hardware. They are also critical example, recreating representative HTTP requests. In this in emulation environments (such as [48, 49]) and simulation paper we describe Harpoon, a new application-independent environments (such as [9, 12]) where representative back- tool for generating representative packet traffic at the IP ground traffic is needed. Without the capability to consis- flow level. Harpoon generates TCP and UDP packet flows tently create realistic network test conditions, new systems that have the same byte, packet, temporal and spatial char- run the risk of unpredictable behavior and unacceptable per- acteristics as measured at routers in live environments. Har- formance when deployed in live environments. poon is distinguished from other tools that generate statis- Current best practices for traffic generation have focused tically representative traffic in that it can self-configure by on either simple packet streams or recreation of a single automatically extracting parameters from standard Netflow application-specific behavior. Packet streaming methods such logs or packet traces. We provide details on Harpoon’s ar- as those used in tools like iperf [6] consist of sequences of chitecture and implementation, and validate its capabilities packets separated by a constant interval. These methods in controlled laboratory experiments using configurations form the basis for standard router performance tests such as derived from flow and packet traces gathered in live envi- those recommended in RFC 2544 [21] and RFC 2889 [40]. ronments. We then demonstrate Harpoon’s capabilities in Another example is an infinite FTP source which is com- a router benchmarking experiment that compares Harpoon monly used for traffic generation in simulations. While these with commonly used throughput test methods. Our results approaches provide some insight into network system capa- show that the router subsystem load generated by Harpoon bilities, they lack nearly all of the richness and diversity of is significantly different, suggesting that this kind of test can packet streams observed in the live Internet [32, 34, 44]. provide important insights into how routers might behave A number of successful application-specific workload gen- under actual operating conditions. erators have been developed including [13, 18, 37]. These tools typically focus on generating application-level request Categories and Subject Descriptors: C.2.6 [Computer- sequences that result in network traffic that has the same Communication Networks]: Internetworking—Routers; C.4 statistical properties as live traffic from the modeled applica- [Performance of Systems]: Measurement techniques, Model- tion. While they are useful for evaluating the behavior and ing techniques, Performance attributes performance of host systems (such as servers and caches), General Terms: Measurement, Performance these tools can be cumbersome for use in router or switch Keywords: Traffic Generation, Network Flows tests and obviously only recreate one kind of application traffic, not the diversity of traffic observed in the Internet. 1. INTRODUCTION These observations motivate the need for a tool capable of The network research community has a persistent need to generating a range of network traffic such as might be ob- evaluate new algorithms, systems and protocols using tools served either at the edges or core of the Internet. that (1) create a range of test conditions similar to those The contribution of this paper is the description and eval- experienced in live deployment and (2) ensure reproducible uation of a new network traffic generator capable of recre- ating IP traffic flows (where flow is defined as a series of packets between a given IP/port pair using a specific trans- port protocol - see Section 3 for more detail) representative Permission to make digital or hard copies of all or part of this work for of those observed at routers in the Internet. We are aware of personal or classroom use is granted without fee provided that copies are no other tools that target representative traffic generation not made or distributed for profit or commercial advantage and that copies at the IP flow level. Our approach is to abstract flow-level bear this notice and the full citation on the first page. To copy otherwise, to traffic generation into a series of application-independent republish, to post on servers or to redistribute to lists, requires prior specific file transfers that use either TCP or UDP for transport. permission and/or a fee. IMC’04, October 25–27, 2004, Taormina, Sicily, Italy. Our model also includes both temporal (diurnal effects as- Copyright 2004 ACM 1-58113-821-0/04/0010 ...$5.00. sociated with traffic volume) and spatial (vis-`a-vis IP ad- measured at a router in a live network. Our model can be dress space coverage) components. The resulting construc- realized in a tool for generating representative packet traffic tive model can be manually parameterized or can be self- in a live (or emulated) network environment or for creating parameterized using Netflow [2] or packet trace data and traffic in a simulation environment. components of the traffic generation tool itself. The self- An approach similar to ours has been used in a number parameterizing capability simplifies use and further distin- of application-specific workload generators. In [18], the au- guishes our system from other tools that attempt to generate thors describe the SURGE Web workload generator which statistically representative traffic. was built by combining distributional properties of Web We realized this model in a tool we call Harpoon that use. A similar approach was used in developing Web Poly- can be used in a router testbed environment or emulation graph [13] and GISMO [37] which are used to generate scal- testbed environment to generate scalable, representative net- able, representative Web cache and streaming workloads re- work traffic. Harpoon has two components: client threads spectively. Harpoon differs from these tools in that it is that make file transfer requests and server threads that trans- application independent, uses empirical distributions, gen- fer the requested files using either TCP or UDP. The result erates both UDP and TCP traffic and includes both spatial is byte/packet/flow traffic at the first hop router (from the and temporal characteristics. It should also be noted that perspective of the server) that is qualitatively the same as there are several commercial products that target application- the traffic used to produce input parameters. specific workload generation including [8]. We evaluated Harpoon’s capabilities in two ways. First, A model closely related to ours was introduced by Feld- we conducted experiments in a controlled laboratory en- mann et al. in [28]. That model generalizes the SURGE vironment using two different data sets to show that we model for Web traffic for the purpose of general background can qualitatively recreate the same traffic using Harpoon. traffic generation in the ns-2 simulator. A similar model We used a one week data set of Netflow records collected based on connection-rate superposition was developed by at a border router of the University of Wisconsin-Madison Cleveland et al. in [25]. Our model is more general in that and a series of packet traces (from which we constructed it has no Web-specific parameters, includes the capability to flow records using a standard tool) collected at the border transfer files via UDP and incorporates temporal and spa- of the University of Auckland. These experiments demon- tial request characteristics. Uhlig presents a flow level traffic strate Harpoon’s capability to generate representative flow model in [47] that is also similar to ours. That model, how- level traffic. Next, we used the same laboratory environ- ever, uses three parameters (compared with the eight that ment to conduct a throughput evaluation of a Cisco 6509 we use) and does not rely on an underlying transport proto- switch/router following the testing protocol described in RFC col to transfer individual files. Our work is also distinct from 2889. We show that while throughputs achieved using stan- each of these models in that we create and evaluate a tool dard packet streaming methods compared with Harpoon are (Harpoon) that can be used for traffic generation on real similar, the loads placed on router subsystems are substan- systems and that can be automatically parameterized from tially different. The implication of this result is that a tool flow records, thus requiring no additional modeling steps. like Harpoon can augment standard test suites to give both In contrast to workload generators based on models de- router designers and network operators insight into system signed to synthesize distributional characteristics are tools behavior under actual operating conditions. that replay traffic based on raw packet traces. tcpreplay This paper is organized as follows. After discussing re- and flowreplay [46], for example, take a very low-level ap- lated work in §2, we describe the design requirements and proach by attempting to generate packets (while option- architecture of our flow-level workload model in §3. We ally rewriting IP addresses) that mirror the specific timings present the details of Harpoon’s implementation in §4 and recorded in a packet trace. Monkey-See Monkey-Do [23] the results of the validation tests in §5.
Recommended publications
  • A Comparison of Mechanisms for Improving TCP Performance Over Wireless Links
    A Comparison of Mechanisms for Improving TCP Performance over Wireless Links Hari Balakrishnan, Venkata N. Padmanabhan, Srinivasan Seshan and Randy H. Katz1 {hari,padmanab,ss,randy}@cs.berkeley.edu Computer Science Division, Department of EECS, University of California at Berkeley Abstract the estimated round-trip delay and the mean linear deviation from it. The sender identifies the loss of a packet either by Reliable transport protocols such as TCP are tuned to per- the arrival of several duplicate cumulative acknowledg- form well in traditional networks where packet losses occur ments or the absence of an acknowledgment for the packet mostly because of congestion. However, networks with within a timeout interval equal to the sum of the smoothed wireless and other lossy links also suffer from significant round-trip delay and four times its mean deviation. TCP losses due to bit errors and handoffs. TCP responds to all reacts to packet losses by dropping its transmission (conges- losses by invoking congestion control and avoidance algo- tion) window size before retransmitting packets, initiating rithms, resulting in degraded end-to-end performance in congestion control or avoidance mechanisms (e.g., slow wireless and lossy systems. In this paper, we compare sev- start [13]) and backing off its retransmission timer (Karn’s eral schemes designed to improve the performance of TCP Algorithm [16]). These measures result in a reduction in the in such networks. We classify these schemes into three load on the intermediate links, thereby controlling the con- broad categories: end-to-end protocols, where loss recovery gestion in the network. is performed by the sender; link-layer protocols, that pro- vide local reliability; and split-connection protocols, that Unfortunately, when packets are lost in networks for rea- break the end-to-end connection into two parts at the base sons other than congestion, these measures result in an station.
    [Show full text]
  • Lecture 8: Overview of Computer Networking Roadmap
    Lecture 8: Overview of Computer Networking Slides adapted from those of Computer Networking: A Top Down Approach, 5th edition. Jim Kurose, Keith Ross, Addison-Wesley, April 2009. Roadmap ! what’s the Internet? ! network edge: hosts, access net ! network core: packet/circuit switching, Internet structure ! performance: loss, delay, throughput ! media distribution: UDP, TCP/IP 1 What’s the Internet: “nuts and bolts” view PC ! millions of connected Mobile network computing devices: server Global ISP hosts = end systems wireless laptop " running network apps cellular handheld Home network ! communication links Regional ISP " fiber, copper, radio, satellite access " points transmission rate = bandwidth Institutional network wired links ! routers: forward packets (chunks of router data) What’s the Internet: “nuts and bolts” view ! protocols control sending, receiving Mobile network of msgs Global ISP " e.g., TCP, IP, HTTP, Skype, Ethernet ! Internet: “network of networks” Home network " loosely hierarchical Regional ISP " public Internet versus private intranet Institutional network ! Internet standards " RFC: Request for comments " IETF: Internet Engineering Task Force 2 A closer look at network structure: ! network edge: applications and hosts ! access networks, physical media: wired, wireless communication links ! network core: " interconnected routers " network of networks The network edge: ! end systems (hosts): " run application programs " e.g. Web, email " at “edge of network” peer-peer ! client/server model " client host requests, receives
    [Show full text]
  • Bit & Baud Rate
    What’s The Difference Between Bit Rate And Baud Rate? Apr. 27, 2012 Lou Frenzel | Electronic Design Serial-data speed is usually stated in terms of bit rate. However, another oft- quoted measure of speed is baud rate. Though the two aren’t the same, similarities exist under some circumstances. This tutorial will make the difference clear. Table Of Contents Background Bit Rate Overhead Baud Rate Multilevel Modulation Why Multiple Bits Per Baud? Baud Rate Examples References Background Most data communications over networks occurs via serial-data transmission. Data bits transmit one at a time over some communications channel, such as a cable or a wireless path. Figure 1 typifies the digital-bit pattern from a computer or some other digital circuit. This data signal is often called the baseband signal. The data switches between two voltage levels, such as +3 V for a binary 1 and +0.2 V for a binary 0. Other binary levels are also used. In the non-return-to-zero (NRZ) format (Fig. 1, again), the signal never goes to zero as like that of return- to-zero (RZ) formatted signals. 1. Non-return to zero (NRZ) is the most common binary data format. Data rate is indicated in bits per second (bits/s). Bit Rate The speed of the data is expressed in bits per second (bits/s or bps). The data rate R is a function of the duration of the bit or bit time (TB) (Fig. 1, again): R = 1/TB Rate is also called channel capacity C. If the bit time is 10 ns, the data rate equals: R = 1/10 x 10–9 = 100 million bits/s This is usually expressed as 100 Mbits/s.
    [Show full text]
  • LTE-Advanced
    Table of Contents INTRODUCTION........................................................................................................ 5 EXPLODING DEMAND ............................................................................................... 8 Smartphones and Tablets ......................................................................................... 8 Application Innovation .............................................................................................. 9 Internet of Things .................................................................................................. 10 Video Streaming .................................................................................................... 10 Cloud Computing ................................................................................................... 11 5G Data Drivers ..................................................................................................... 11 Global Mobile Adoption ........................................................................................... 11 THE PATH TO 5G ..................................................................................................... 15 Expanding Use Cases ............................................................................................. 15 1G to 5G Evolution ................................................................................................. 17 5G Concepts and Architectures ................................................................................ 20 Information-Centric
    [Show full text]
  • RTM-100 Troposcatter Modem Improved Range, Stability and Throughput for Troposcatter Communications
    RTM-100 Troposcatter Modem Improved range, stability and throughput for troposcatter communications The Raytheon RTM-100 troposcatter modem sets new milestones in troposcatter communications featuring 100 MB throughput. Benefits Superior Performance The use of turbo-coding An industry first, the waveform forward error correction The RTM-100 comes as n Operation up to 100 Mbps of Raytheon’s RTM-100 (FEC) and state-of-the-art a compact 2U rack with troposcatter modem offers digital processing ensures an n Unique waveform for multipath standard 70 MHz inputs/ strong resiliency to multipath, unprecedented throughput cancellation and optimized outputs. algorithms for fading immunity which negatively affects up to 100 Mbps. The modem n Quad diversity with soft decision troposcatter communications. integrates a non-linear digital algorithm Combined with an optimized pre-distortion capability. time-interleaving process and n Highly spectrum-efficient FEC The Gigabit Ethernet (GbE) signal channel diversity, the processing data port and the ability RTM- 100 delivers superior n Dual transmission path with to command and control transmission performance. independent digital pre- the operation over Simple The sophisticated algorithms, distortion Network Management including Doppler n Ethernet data and control Protocol (SNMP) simplify the compensation and maximum interface (SNMP and Web integration of the device into ratio combining between the graphical user interface) a net-centric Internet protocol four diversity inputs, ensure n Compact 2U 19-inch
    [Show full text]
  • On the Goodput of TCP Newreno in Mobile Networks
    On the Goodput of TCP NewReno in Mobile Networks Sushant Sharma Donald Gillies Wu-chun Feng Virginia Tech, Blacksburg, VA, USA Qualcomm, San Diego, USA Virginia Tech, Blacksburg, VA, USA Abstract—Next-generation wireless networks such as LTE and WiMax can achieve throughputs of several Mbps with TCP. These higher throughputs, however, can easily be destroyed by frequent handoffs, which occur in urban environments due to shadowing. A primary reason for the throughput drop during handoffs is the out of order arrival of packets at the receiver. As a result, in this paper, we model the precise effect of packet-reordering on the goodput of TCP NewReno. Specifically, we develop a TCP NewReno model that captures the goodput of TCP as a function of round-trip time, average time duration between packet-reorder events, average number of packets reordered during every reorder event, and the congestion window threshold of TCP NewReno. We also developed an emulator that runs on a router to implement packet reordering events from time to time. We validate our NewReno model by comparing the goodput results obtained by transferring data between two hosts connected via the emulator to the goodput results that our model predicts. I. MOTIVATION Next-generation wireless technologies such as WiMax and LTE (long term evolution) offer very high data rates (on Fig. 1. Handoff description. the order of several Mbps) to mobile users. As a result, mobile users will come to expect better peak performance a rare event in the wired Internet [12], [13], [14], [15], and from the networks than from current mobile networks.
    [Show full text]
  • Webrtc Based Network Performance Measurements Miranda Mcclellan
    WebRTC Based Network Performance Measurements by Miranda McClellan Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Masters of Engineering in Computer Science and Engineering at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2019 c Massachusetts Institute of Technology 2019. All rights reserved. Author.............................................................. Department of Electrical Engineering and Computer Science May 24, 2019 Certified by. Steven Bauer Research Scientist Thesis Supervisor Accepted by . Katrina LaCurts Chair, Master of Engineering Thesis Committee 2 WebRTC Based Network Performance Measurements by Miranda McClellan Submitted to the Department of Electrical Engineering and Computer Science on May 24, 2019, in partial fulfillment of the requirements for the degree of Masters of Engineering in Computer Science and Engineering Abstract As internet connections achieve gigabit speeds, local area networks (LANs) be- come the main bottleneck for users connection. Currently, network performance tests focus on end-to-end performance over wide-area networks and provide no platform- independent way to tests LANs in isolation. To fill this gap, I developed a suite of network performance tests that run in a web application. The network tests support LAN performance measurement using WebRTC peer-to-peer technology and statis- tically evaluate performance according to the Model-Based Metrics framework. Our network testing application is browser based for easy adoption across platforms and can empower users to understand their in-home networks. Our tests hope to give a more accurate view of LAN performance that can influence regulatory policy of internet providers and consumer decisions. Thesis Supervisor: Steven Bauer Title: Research Scientist 3 4 Acknowledgments I am grateful to the Internet Policy Research Initiative for providing support and context for my technical research within a larger ecosystem of technology policy and advancements.
    [Show full text]
  • Bufferbloat: Advertently Defeated a Critical TCP Con- Gestion-Detection Mechanism, with the Result Being Worsened Congestion and Increased Latency
    practice Doi:10.1145/2076450.2076464 protocol the presence of congestion Article development led by queue.acm.org and thus the need for compensating adjustments. Because memory now is significant- A discussion with Vint Cerf, Van Jacobson, ly cheaper than it used to be, buffering Nick Weaver, and Jim Gettys. has been overdone in all manner of net- work devices, without consideration for the consequences. Manufacturers have reflexively acted to prevent any and all packet loss and, by doing so, have in- BufferBloat: advertently defeated a critical TCP con- gestion-detection mechanism, with the result being worsened congestion and increased latency. Now that the problem has been di- What’s Wrong agnosed, people are working feverishly to fix it. This case study considers the extent of the bufferbloat problem and its potential implications. Working to with the steer the discussion is Vint Cerf, popu- larly known as one of the “fathers of the Internet.” As the co-designer of the TCP/IP protocols, Cerf did indeed play internet? a key role in developing the Internet and related packet data and security technologies while at Stanford Univer- sity from 1972−1976 and with the U.S. Department of Defense’s Advanced Research Projects Agency (DARPA) from 1976−1982. He currently serves as Google’s chief Internet evangelist. internet DeLays nOw are as common as they are Van Jacobson, presently a research maddening. But that means they end up affecting fellow at PARC where he leads the networking research program, is also system engineers just like all the rest of us. And when central to this discussion.
    [Show full text]
  • Real-Time Latency: Rethinking Remote Networks
    Real-Time Latency: Rethinking Remote Networks You can buy your way out of “bandwidth problems. But latency is divine ” || Proprietary & Confidential 2 Executive summary ▲ Latency is the time delay over a communications link, and is primarily determined by the distance data must travel between a user and the server ▲ Low earth orbits (LEO) are 35 times closer to Earth than traditional geostationary orbit (GEO) used for satellite communications. Due to the closeness and shorter data paths, LEO-based networks have latency similar to terrestrial networks1 ▲ LEO’s low latency enables fiber quality connectivity, benefiting users and service providers by - Loading webpages as fast as Fiber and ~8 times faster than a traditional satellite system - Simplifying networks by removing need for performance accelerators - Improving management of secure and encrypted traffic - Allowing real-time applications from remote areas (e.g., VoIP, telemedicine, remote-control machines) ▲ Telesat Lightspeed not only offers low latency but also provides - High throughput and flexible capacity - Transformational economics - Highly resilient and secure global network - Plug and play, standard-based Ethernet service 30 – 50 milliseconds Round Trip Time (RTT) | Proprietary & Confidential 3 Questions answered ▲ What is Latency? ▲ How does it vary for different technologies? How does lower latency improve user experience? What business outcomes can lower latency enable? Telesat Lightspeed - what is the overall value proposition? | Proprietary & Confidential 4 What is
    [Show full text]
  • The Bufferbloat Problem Over Intermittent Multi-Gbps Mmwave Links
    The Bufferbloat Problem over Intermittent Multi-Gbps mmWave Links Menglei Zhang, Marco Mezzavilla, Jing Zhuy, Sundeep Rangan, Shivendra Panwar NYU WIRELESS, Brooklyn, NY, USA y Intel, Santa Clara, USA emails: fmenglei, mezzavilla, srangan, [email protected], [email protected] Abstract—Due to massive available spectrum in the millimeter transport layer mechanisms and buffering must rapidly adapt wave (mmWave) bands, cellular systems in these frequencies may to the link capacities that can dramatically change. This work provides orders of magnitude greater capacity than networks addresses one particularly important problem – bufferbloat. in conventional lower frequency bands. However, due to high susceptibility to blocking, mmWave links can be extremely inter- Bufferbloat: Bufferbloat is triggered by persistently filled mittent in quality. This combination of high peak throughputs or full buffers, and usually results in long latency and packet and intermittency can cause significant challenges in end-to-end drops. This phenomenon was first pointed out in late 2010 transport-layer mechanisms such as TCP. This paper studies [16]. Optimal buffer sizes should equal the bandwidth de- the particularly challenging problem of bufferbloat. Specifically, lay product (BDP), however, as the delay is usually hard with current buffering and congestion control mechanisms, high throughput-high variable links can lead to excessive buffers to estimate, larger buffers are deployed to prevent losses. incurring long latency. In this paper, we capture the performance Even though these oversized buffer prevent packet loss, the trends obtained while adopting two potential solutions that overall performance degrades, especially when transmitting have been proposed in the literature: Active queue manage- TCP flows,1 which is the main focus of this paper.
    [Show full text]
  • How to Generate Realistic Network Traffic? Antoine VARET and Nicolas LARRIEU ENAC (French Civil Aviation University) - Telecom/Resco Laboratory
    How to generate realistic network traffic ? Antoine Varet, Nicolas Larrieu To cite this version: Antoine Varet, Nicolas Larrieu. How to generate realistic network traffic ?. IEEE COMPSAC 2014, 38th Annual International Computers, Software & Applications Conference, Jul 2014, Västerås, Swe- den. pp xxxx. hal-00973913 HAL Id: hal-00973913 https://hal-enac.archives-ouvertes.fr/hal-00973913 Submitted on 4 Oct 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU ENAC (French Civil Aviation University) - Telecom/Resco Laboratory ABSTRACT instance, an Internet Service Provider (ISP) providing access for Network engineers and designers need additional tools to generate software engineering companies manage a different profile of data network traffic in order to test and evaluate, for instance, communications than an ISP for private individuals [2]. However, application performances or network provisioning. In such a there are some common characteristics between both profiles. The context, traffic characteristics are the most important part of the goal of the tool we have developed is to handle most of Internet work. Indeed, it is quite easy to generate traffic, but it is more traffic profiles and to generate traffic flows by following these difficult to produce traffic which can exhibit real characteristics different Internet traffic properties.
    [Show full text]
  • CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction
    CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction Yi Sun⊗, Xiaoqi Yiny, Junchen Jiangy, Vyas Sekary Fuyuan Lin⊗, Nanshu Wang⊗, Tao Liu, Bruno Sinopoliy ⊗ ICT/CAS, y CMU, iQIYI {sunyi, linfuyuan, wangnanshu}@ict.ac.cn, [email protected], [email protected], [email protected], [email protected], [email protected] ABSTRACT Keywords Bitrate adaptation is critical to ensure good quality-of- Internet Video; TCP; Throughput Prediction; Bitrate Adap- experience (QoE) for Internet video. Several efforts have tation; Dynamic Adaptive Streaming over HTTP (DASH) argued that accurate throughput prediction can dramatically improve the efficiency of (1) initial bitrate selection to lower 1 Introduction startup delay and offer high initial resolution and (2) mid- There has been a dramatic rise in the volume of HTTP-based stream bitrate adaptation for high QoE. However, prior ef- adaptive video streaming traffic in recent years [1]. De- forts did not systematically quantify real-world throughput livering good application-level video quality-of-experience predictability or develop good prediction algorithms. To (QoE) entails new metrics such as low buffering or smooth bridge this gap, this paper makes three contributions. First, bitrate delivery [5, 22]. To meet these new application-level we analyze the throughput characteristics in a dataset with QoE goals, video players need intelligent bitrate selection 20M+ sessions. We find: (a) Sessions sharing similar key and adaptation algorithms [27, 30]. features (e.g., ISP, region) present similar initial throughput Recent work has shown that accurate throughput predic- values and dynamic patterns; (b) There is a natural “state- tion can significantly improve the QoE for adaptive video ful” behavior in throughput variability within a given ses- streaming (e.g., [47, 48, 50]).
    [Show full text]