Analysis of Traffic Flow Characteristics During Video Streaming

Današnje višeuslužne mreže pružaju korisnicima različite vrste komunikacijskih usluga putem iste prijenosne infrastrukture (fiksne ili mobilne mreže) neovisno o prijenosnom mediju. Novija istraživanja pokazuju kako je usluga prijenosa videosadržaja strujanjem jedna od najčešće korištenih usluga. Sve je više videoportala koji objavljuju različite videosadržaje koji se često mogu gledati bez ikakve naknade. Stoga uslijed popularnosti ove usluge i njenih specifičnih zahtjeva po pitanju mrežnih preformansi, u ovom radu napravljena je analiza prometnog toka pomoću programskog alata Wireshark na temelju pristiglih paketa za vrijeme gledanja videosadržaja (uživo ili na zahtjev). Analiza služi kako bi se opisala distribucija duljine paketa koji pristižu s poslužitelja na uređaj klijenta s obzirom na vrstu sadržaja i različitih kvaliteta videosadržaja. Također se analizirao broj generiranih paketa te na taj način dodatno opisao prometni tok prilikom prijenosa videosadržaja niže i više kvalitete.Today's multiservice networks provide users with different types of communication services through the same transport infrastructure (fixed or mobile) regardless of the media. Newer research shows that video streaming service is one of the most commonly used services. A lot of video portals publish various video content that can often be viewed without any compensation. Therefore, due to the popularity of this service and its specific requirements regarding network performance, in this paper, an analisys of trafic flow has been made using software tool Wireshark on the basis of the received packets while watching the video (live or on demand). The analysis is used to describe the distribution of packet lengths that arrive from server to client based on the content type and different video content quality. The number of generated packets was also analyzed, and in that way additionally described the traffic flow in lower and higher quality video streams

Analysis of Traffic Flow Characteristics During Video Streaming

Današnje višeuslužne mreže pružaju korisnicima različite vrste komunikacijskih usluga putem iste prijenosne infrastrukture (fiksne ili mobilne mreže) neovisno o prijenosnom mediju. Novija istraživanja pokazuju kako je usluga prijenosa videosadržaja strujanjem jedna od najčešće korištenih usluga. Sve je više videoportala koji objavljuju različite videosadržaje koji se često mogu gledati bez ikakve naknade. Stoga uslijed popularnosti ove usluge i njenih specifičnih zahtjeva po pitanju mrežnih preformansi, u ovom radu napravljena je analiza prometnog toka pomoću programskog alata Wireshark na temelju pristiglih paketa za vrijeme gledanja videosadržaja (uživo ili na zahtjev). Analiza služi kako bi se opisala distribucija duljine paketa koji pristižu s poslužitelja na uređaj klijenta s obzirom na vrstu sadržaja i različitih kvaliteta videosadržaja. Također se analizirao broj generiranih paketa te na taj način dodatno opisao prometni tok prilikom prijenosa videosadržaja niže i više kvalitete.Today's multiservice networks provide users with different types of communication services through the same transport infrastructure (fixed or mobile) regardless of the media. Newer research shows that video streaming service is one of the most commonly used services. A lot of video portals publish various video content that can often be viewed without any compensation. Therefore, due to the popularity of this service and its specific requirements regarding network performance, in this paper, an analisys of trafic flow has been made using software tool Wireshark on the basis of the received packets while watching the video (live or on demand). The analysis is used to describe the distribution of packet lengths that arrive from server to client based on the content type and different video content quality. The number of generated packets was also analyzed, and in that way additionally described the traffic flow in lower and higher quality video streams

Analysis of Traffic Flow Characteristics During Video Streaming

Današnje višeuslužne mreže pružaju korisnicima različite vrste komunikacijskih usluga putem iste prijenosne infrastrukture (fiksne ili mobilne mreže) neovisno o prijenosnom mediju. Novija istraživanja pokazuju kako je usluga prijenosa videosadržaja strujanjem jedna od najčešće korištenih usluga. Sve je više videoportala koji objavljuju različite videosadržaje koji se često mogu gledati bez ikakve naknade. Stoga uslijed popularnosti ove usluge i njenih specifičnih zahtjeva po pitanju mrežnih preformansi, u ovom radu napravljena je analiza prometnog toka pomoću programskog alata Wireshark na temelju pristiglih paketa za vrijeme gledanja videosadržaja (uživo ili na zahtjev). Analiza služi kako bi se opisala distribucija duljine paketa koji pristižu s poslužitelja na uređaj klijenta s obzirom na vrstu sadržaja i različitih kvaliteta videosadržaja. Također se analizirao broj generiranih paketa te na taj način dodatno opisao prometni tok prilikom prijenosa videosadržaja niže i više kvalitete.Today's multiservice networks provide users with different types of communication services through the same transport infrastructure (fixed or mobile) regardless of the media. Newer research shows that video streaming service is one of the most commonly used services. A lot of video portals publish various video content that can often be viewed without any compensation. Therefore, due to the popularity of this service and its specific requirements regarding network performance, in this paper, an analisys of trafic flow has been made using software tool Wireshark on the basis of the received packets while watching the video (live or on demand). The analysis is used to describe the distribution of packet lengths that arrive from server to client based on the content type and different video content quality. The number of generated packets was also analyzed, and in that way additionally described the traffic flow in lower and higher quality video streams

Analysis of Buffer Starvation with Application to Objective QoE Optimization of Streaming Services

Our purpose in this paper is to characterize buffer starvations for streaming services. The buffer is modeled as an M/M/1 queue, plus the consideration of bursty arrivals. When the buffer is empty, the service restarts after a certain amount of packets are \emph{prefetched}. With this goal, we propose two approaches to obtain the \emph{exact distribution} of the number of buffer starvations, one of which is based on \emph{Ballot theorem}, and the other uses recursive equations. The Ballot theorem approach gives an explicit result. We extend this approach to the scenario with a constant playback rate using T\`{a}kacs Ballot theorem. The recursive approach, though not offering an explicit result, can obtain the distribution of starvations with non-independent and identically distributed (i.i.d.) arrival process in which an ON/OFF bursty arrival process is considered in this work. We further compute the starvation probability as a function of the amount of prefetched packets for a large number of files via a fluid analysis. Among many potential applications of starvation analysis, we show how to apply it to optimize the objective quality of experience (QoE) of media streaming, by exploiting the tradeoff between startup/rebuffering delay and starvations.Comment: 9 pages, 7 figures; IEEE Infocom 201

Playback Delay and Buffering Optimization in Scalable Video Broadcasting

This paper addresses the problem of optimizing the playback delay experienced by a population of heterogeneous clients, in video streaming applications. We consider a typical broadcast scenario, where clients subscribe to different portions of a scalable video stream, depending on their capabilities. Clients share common network resources, whose limited rate directly drives the playback delays imposed to the different groups of receivers. We derive an optimization problem, that targets a fair distribution of the playback delays among heterogeneous clients, as well as minimal buffer usage. A server-based scheduling strategy is then proposed, that takes into account the properties of the targeted clients, the channel status, and the structure of the media encoding. A polynomial-time algorithm providing close to optimal results is introduced and it is shown to offer significantly reduced playback delays per client population, as compared to traditional scheduling strategies. In the same time, PSNR performance is not affected, which altogether leads to an overall improvement of the quality of service

Probabilistic Analysis of Buffer Starvation in Markovian Queues

International audienceOur purpose in this paper is to obtain the \emph{exact distribution} of the number of buffer starvations within a sequence of $N$ consecutive packet arrivals. The buffer is modeled as an M/M/1 queue. When the buffer is empty, the service restarts after a certain amount of packets are \emph{prefetched}. With this goal, we propose two approaches, one of which is based on \emph{Ballot theorem}, and the other uses recursive equations. The Ballot theorem approach gives an explicit solution, but at the cost of the high complexity order in certain circumstances. The recursive approach, though not offering an explicit result, needs fewer computations. We further propose a fluid analysis of starvation probability on the file level, given the distribution of file size and the traffic intensity. The starvation probabilities of this paper have many potential applications. We apply them to optimize the quality of experience (QoE) of media streaming service, by exploiting the tradeoff between the start-up delay and the starvation