Maxim Claeys
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Maxim Claeys has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
Filip De Turck
IDLab, Department of Information Technology Ghent University–IMEC Ghent Belgium
16 shared publications- Steven Latré
Department of Computer Science University of Antwerp imec IDLab Antwerp Belgium
12 shared publications Niels Bouten
IDLab, Department of Mathematics and Computer Science University of Antwerp–imec Antwerp Belgium
6 shared publicationsJeroen Famaey
University of Antwerp - iMinds, Department of Mathematics and Computer Science, Middelheimlaan 1, B-2020 Antwerp, Belgium
5 shared publications- Jeroen Famaey
University of Antwerp - imec, Antwerp, Belgium
5 shared publications Werner Van Leekwijck
IDLab, Department of Mathematics and Computer Science University of Antwerp–imec Antwerp Belgium
5 shared publications
Latest Publications
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (2) , 1387-1400
Parallel Reinforcement Learning With Minimal Communication Overhead for IoT Environments
Many Internet of Things (IoT) applications require a distributed architecture for decision making: either because of a lack of a centralized system, failure-prone connectivity to a centralized system, or because the imposed latency to contact such a system is too high for real-time applications. Often, these IoT applications fall in the domain of Reinforcement Learning (RL), e.g., autonomous robot navigation in Smart Factories and Traffic Signal Control in Smart Cities. However, RL-based applications require a long learning time. To overcome this limitation and scale with the number of agents, Parallel Reinforcement Learning (PRL) algorithms run multiple RL agents in parallel and on distributed environments. However, deploying PRL algorithms in such environments entails a communication overhead that increases the (actual) execution time. State-of-the-art PRL algorithms are designed for reducing the learning time while assuming no (or limited) communication overhead. In this work, we present a novel partitioning algorithm that minimizes the communication overhead in PRL running on IoT environments. To the best of our knowledge, this is the first work that focuses on solving the communication overhead of distributing PRL algorithms algorithm without requiring any a priori knowledge about the structure of the problem. The proposed algorithm intelligently combines a dynamic state partitioning strategy, which exploits the agent’s exploration capabilities to build partition knowledge while learning, with an efficient mapping of agents to partitions, which reduces the communication among agents. Performance evaluations show that the proposed algorithm can achieve almost no communication among PRL agents at the converged state.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (2) , 1387-1400
Parallel Reinforcement Learning With Minimal Communication Overhead for IoT Environments
Many Internet of Things (IoT) applications require a distributed architecture for decision making: either because of a lack of a centralized system, failure-prone connectivity to a centralized system, or because the imposed latency to contact such a system is too high for real-time applications. Often, these IoT applications fall in the domain of Reinforcement Learning (RL), e.g., autonomous robot navigation in Smart Factories and Traffic Signal Control in Smart Cities. However, RL-based applications require a long learning time. To overcome this limitation and scale with the number of agents, Parallel Reinforcement Learning (PRL) algorithms run multiple RL agents in parallel and on distributed environments. However, deploying PRL algorithms in such environments entails a communication overhead that increases the (actual) execution time. State-of-the-art PRL algorithms are designed for reducing the learning time while assuming no (or limited) communication overhead. In this work, we present a novel partitioning algorithm that minimizes the communication overhead in PRL running on IoT environments. To the best of our knowledge, this is the first work that focuses on solving the communication overhead of distributing PRL algorithms algorithm without requiring any a priori knowledge about the structure of the problem. The proposed algorithm intelligently combines a dynamic state partitioning strategy, which exploits the agent’s exploration capabilities to build partition knowledge while learning, with an efficient mapping of agents to partitions, which reduces the communication among agents. Performance evaluations show that the proposed algorithm can achieve almost no communication among PRL agents at the converged state.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Dynamic and Collaborative Spectrum Sharing: The SCATTER Approach
This paper presents the architecture and the basic principles behind the design and implementation of the SCATTER system, a wireless end-to-end communication system that participated in the DARPA Second Spectrum Collaboration Challenge (SC2). The focus is mainly on presenting the architecture and the supported interactions between the different components of the system in order to deliver a true dynamic collaborative spectrum allocation and usage, while coexisting with numerous unknown heterogeneous wireless technologies.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Dynamic and Collaborative Spectrum Sharing: The SCATTER Approach
This paper presents the architecture and the basic principles behind the design and implementation of the SCATTER system, a wireless end-to-end communication system that participated in the DARPA Second Spectrum Collaboration Challenge (SC2). The focus is mainly on presenting the architecture and the supported interactions between the different components of the system in order to deliver a true dynamic collaborative spectrum allocation and usage, while coexisting with numerous unknown heterogeneous wireless technologies.
- 16 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 21 (2) , 1064-1092
A Survey on the Programmability of Wireless MAC Protocols
Self-organizing networks able to adapt to changes in the environment have already been a longstanding research topic. Given the limited number of license-free Industrial, Scientific, and Medical (ISM) radio bands, wireless technologies end up competing with one another for the wireless spectrum. As such, the proper employment of Medium Access Control (MAC) protocols is essential to guarantee efficient and reliable wireless communication. At the data link level, there has been extensive research towards programmable and more future-proof MAC protocols (e.g., Software-Defined Radios (SDRs), which enable to reconfigure the entire protocol and hence access/control fine-grained radio functionalities). However, actual deployments are so far limited because of performance issues and cost. With the increasing popularity of Software-Defined Networking (SDN), also in the wireless domain, and the increasing performance of SDRs, we are evolving into a fully programmable data link layer. In this survey, we deliver: a landscape of the state-of-the-art on programmable MAC protocols; a coherent terminology that represents scope and level of programmability supported; an in-depth study of their advantages and disadvantages; and a discussion about future research challenges on MAC programmability. Many surveys have investigated the use of specific MAC protocols for a wide range of optimization criteria and application demands. This survey is the first that investigates the scope and the level of programmability that MAC protocols support.
- 16 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 21 (2) , 1064-1092
A Survey on the Programmability of Wireless MAC Protocols
Self-organizing networks able to adapt to changes in the environment have already been a longstanding research topic. Given the limited number of license-free Industrial, Scientific, and Medical (ISM) radio bands, wireless technologies end up competing with one another for the wireless spectrum. As such, the proper employment of Medium Access Control (MAC) protocols is essential to guarantee efficient and reliable wireless communication. At the data link level, there has been extensive research towards programmable and more future-proof MAC protocols (e.g., Software-Defined Radios (SDRs), which enable to reconfigure the entire protocol and hence access/control fine-grained radio functionalities). However, actual deployments are so far limited because of performance issues and cost. With the increasing popularity of Software-Defined Networking (SDN), also in the wireless domain, and the increasing performance of SDRs, we are evolving into a fully programmable data link layer. In this survey, we deliver: a landscape of the state-of-the-art on programmable MAC protocols; a coherent terminology that represents scope and level of programmability supported; an in-depth study of their advantages and disadvantages; and a discussion about future research challenges on MAC programmability. Many surveys have investigated the use of specific MAC protocols for a wide range of optimization criteria and application demands. This survey is the first that investigates the scope and the level of programmability that MAC protocols support.
- 19 April 2018
- Published by Wiley in International Journal of Network Management
- Vol. 28 (4)
Deadline‐aware TCP congestion control for HTTP adaptive streaming services
Summary: Over the last decades, video streaming services have gained a lot of popularity, representing over 70% of the total consumer Internet traffic worldwide. While originally dedicated streaming protocols have been used to deliver these services, for several years, the video streaming industry is steadily shifting to HTTP adaptive streaming (HAS)–based delivery over TCP. With each video segment, implicit delivery deadlines are associated in order to avoid playout interruptions. However, TCP is known to be far from minimizing the number of deadline‐missing streams. In this paper, 2 deadline‐aware congestion control mechanisms are proposed, based on a parametrization of the traditional TCP New Reno congestion control strategy. By introducing deadline awareness at the transport layer, the modulation of the congestion window size is dynamically adapted to steer the aggressiveness of the considered stream to optimize the delivery of video streaming services. The proposed approaches are thoroughly evaluated in an HAS video‐on‐demand scenario over tree‐based delivery networks. It was shown that in a realistic scenario, the proposed approaches can outperform traditional congestion control strategies by up to 12% in terms of estimated mean opinion score, mainly by reducing the average video freezing time by more than 85%.
- 19 April 2018
- Published by Wiley in International Journal of Network Management
- Vol. 28 (4)
Deadline‐aware TCP congestion control for HTTP adaptive streaming services
Summary: Over the last decades, video streaming services have gained a lot of popularity, representing over 70% of the total consumer Internet traffic worldwide. While originally dedicated streaming protocols have been used to deliver these services, for several years, the video streaming industry is steadily shifting to HTTP adaptive streaming (HAS)–based delivery over TCP. With each video segment, implicit delivery deadlines are associated in order to avoid playout interruptions. However, TCP is known to be far from minimizing the number of deadline‐missing streams. In this paper, 2 deadline‐aware congestion control mechanisms are proposed, based on a parametrization of the traditional TCP New Reno congestion control strategy. By introducing deadline awareness at the transport layer, the modulation of the congestion window size is dynamically adapted to steer the aggressiveness of the considered stream to optimize the delivery of video streaming services. The proposed approaches are thoroughly evaluated in an HAS video‐on‐demand scenario over tree‐based delivery networks. It was shown that in a realistic scenario, the proposed approaches can outperform traditional congestion control strategies by up to 12% in terms of estimated mean opinion score, mainly by reducing the average video freezing time by more than 85%.
- Open Access
- 6 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 34 (8) , 2063-2076
Scalable Cache Management for ISP-Operated Content Delivery Services
Content delivery networks (CDNs) have been the prevalent method for the efficient delivery of content across the Internet. Management operations performed by CDNs are usually applied only based on limited information about Internet Service Provider (ISP) networks, which can have a negative impact on the utilization of ISP resources. To overcome these issues, previous research efforts have been investigating ISP-operated content delivery services, by which an ISP can deploy its own in-network caching infrastructure and implement its own cache management strategies. In this paper, we extend our previous work on ISP-operated content distribution and develop a novel scalable and efficient distributed approach to control the placement of content in the available caching points. The proposed approach relies on parallelizing the decision-making process and the use of network partitioning to cluster the distributed decision-making points, which enables fast reconfiguration and limits the volume of information required to take reconfiguration decisions. We evaluate the performance of our approach based on a wide range of parameters. The results demonstrate that the proposed solution can outperform previous approaches in terms of management overhead and complexity while offering similar network and caching performance.
- 6 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 34 (8) , 2063-2076
Open AccessScalable Cache Management for ISP-Operated Content Delivery Services
Content delivery networks (CDNs) have been the prevalent method for the efficient delivery of content across the Internet. Management operations performed by CDNs are usually applied only based on limited information about Internet Service Provider (ISP) networks, which can have a negative impact on the utilization of ISP resources. To overcome these issues, previous research efforts have been investigating ISP-operated content delivery services, by which an ISP can deploy its own in-network caching infrastructure and implement its own cache management strategies. In this paper, we extend our previous work on ISP-operated content distribution and develop a novel scalable and efficient distributed approach to control the placement of content in the available caching points. The proposed approach relies on parallelizing the decision-making process and the use of network partitioning to cluster the distributed decision-making points, which enables fast reconfiguration and limits the volume of information required to take reconfiguration decisions. We evaluate the performance of our approach based on a wide range of parameters. The results demonstrate that the proposed solution can outperform previous approaches in terms of management overhead and complexity while offering similar network and caching performance.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 310-317
An announcement-based caching approach for video-on-demand streaming
The growing popularity of over the top (OTT) video streaming services has led to a strong increase in bandwidth capacity requirements in the network. By deploying intermediary caches, closer to the end-users, popular content can be served faster and without increasing backbone traffic. Designing an appropriate replacement strategy for such caching networks is of utmost importance to achieve high caching efficiency and reduce the network load. Typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently. This temporal segmentation leads to a strong relationship between consecutive segments of the same video. Therefore, caching strategies have been developed, taking into account the temporal structure of the video. In this paper, we propose a novel caching strategy that takes advantage of clients announcing which videos will be watched in the near future, e.g., based on predicted requests for subsequent episodes of the same TV show. Based on a Video-on-Demand (VoD) production request trace, the presented algorithm is evaluated for a wide range of user behavior and request announcement models. In a realistic scenario, a performance increase of 11% can be achieved in terms of hit ratio, compared to the state-of-the-art.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 310-317
An announcement-based caching approach for video-on-demand streaming
The growing popularity of over the top (OTT) video streaming services has led to a strong increase in bandwidth capacity requirements in the network. By deploying intermediary caches, closer to the end-users, popular content can be served faster and without increasing backbone traffic. Designing an appropriate replacement strategy for such caching networks is of utmost importance to achieve high caching efficiency and reduce the network load. Typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently. This temporal segmentation leads to a strong relationship between consecutive segments of the same video. Therefore, caching strategies have been developed, taking into account the temporal structure of the video. In this paper, we propose a novel caching strategy that takes advantage of clients announcing which videos will be watched in the near future, e.g., based on predicted requests for subsequent episodes of the same TV show. Based on a Video-on-Demand (VoD) production request trace, the presented algorithm is evaluated for a wide range of user behavior and request announcement models. In a realistic scenario, a performance increase of 11% can be achieved in terms of hit ratio, compared to the state-of-the-art.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards SVC-based Adaptive Streaming in information centric networks
HTTP Adaptive Streaming (HAS) is becoming the de-facto standard for video streaming services. In HAS, each video is segmented and stored in different qualities. The client can dynamically select the most appropriate quality level to download, allowing it to adapt to varying network conditions. As the Internet was not designed to deliver such applications, optimal support for multimedia delivery is still missing. Information Centric Networking (ICN) is a recently proposed disruptive architecture that could solve this issue, where the focus is given to the content rather than to end-to-end connectivity. Due to the bandwidth unpredictability typical of ICN, standard AVC-based HAS performs quality selection sub-optimally, thus leading to a poor Quality of Experience (QoE). In this article, we propose to overcome this inefficiency by using Scalable Video Coding (SVC) instead. We individuate the main advantages of SVC-based HAS over ICN and outline, both theoretically and via simulation, the research challenges to be addressed to optimize the delivered QoE.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards SVC-based Adaptive Streaming in information centric networks
HTTP Adaptive Streaming (HAS) is becoming the de-facto standard for video streaming services. In HAS, each video is segmented and stored in different qualities. The client can dynamically select the most appropriate quality level to download, allowing it to adapt to varying network conditions. As the Internet was not designed to deliver such applications, optimal support for multimedia delivery is still missing. Information Centric Networking (ICN) is a recently proposed disruptive architecture that could solve this issue, where the focus is given to the content rather than to end-to-end connectivity. Due to the bandwidth unpredictability typical of ICN, standard AVC-based HAS performs quality selection sub-optimally, thus leading to a poor Quality of Experience (QoE). In this article, we propose to overcome this inefficiency by using Scalable Video Coding (SVC) instead. We individuate the main advantages of SVC-based HAS over ICN and outline, both theoretically and via simulation, the research challenges to be addressed to optimize the delivered QoE.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15730077,p. 131-138
A learning-based algorithm for improved bandwidth-awareness of adaptive streaming clients
HTTP Adaptive Streaming (HAS) is becoming the de-facto standard for Over-The-Top video streaming. A HAS video consists of multiple segments, encoded at multiple quality levels. Allowing the client to select the quality level for every segment, a smoother playback and a higher Quality of Experience (QoE) can be perceived. Although results are promising, current quality selection heuristics are generally hard coded. Fixed parameter values are used to provide an acceptable QoE under all circumstances, resulting in suboptimal solutions. Furthermore, many commercial HAS implementations focus on a video-on-demand scenario, where a large buffer size is used to avoid play-out freezes. When the focus is on a live TV scenario however, a low buffer size is typically preferred, as the video play-out delay should be as low as possible. Hard coded implementations using a fixed buffer size are not capable of dealing with both scenarios. In this paper, the concept of reinforcement learning is introduced at client side, allowing to adaptively change the parameter configuration for existing rate adaptation heuristics. Bandwidth characteristics are taken into account in the decision process, thus allowing to improve the client's bandwidth-awareness. Focus in this paper is on actively reducing the average buffer filling, evaluating results for two heuristics: the Microsoft IIS Smooth Streaming heuristic and the QoE-driven Rate Adaptation Heuristic for Adaptive video Streaming by Petrangeli et al. We show that using the proposed learning-based approach, the average buffer filling can be reduced by 8.3% compared to state of the art, while achieving a comparable level of QoE.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15730077,p. 131-138
A learning-based algorithm for improved bandwidth-awareness of adaptive streaming clients
HTTP Adaptive Streaming (HAS) is becoming the de-facto standard for Over-The-Top video streaming. A HAS video consists of multiple segments, encoded at multiple quality levels. Allowing the client to select the quality level for every segment, a smoother playback and a higher Quality of Experience (QoE) can be perceived. Although results are promising, current quality selection heuristics are generally hard coded. Fixed parameter values are used to provide an acceptable QoE under all circumstances, resulting in suboptimal solutions. Furthermore, many commercial HAS implementations focus on a video-on-demand scenario, where a large buffer size is used to avoid play-out freezes. When the focus is on a live TV scenario however, a low buffer size is typically preferred, as the video play-out delay should be as low as possible. Hard coded implementations using a fixed buffer size are not capable of dealing with both scenarios. In this paper, the concept of reinforcement learning is introduced at client side, allowing to adaptively change the parameter configuration for existing rate adaptation heuristics. Bandwidth characteristics are taken into account in the decision process, thus allowing to improve the client's bandwidth-awareness. Focus in this paper is on actively reducing the average buffer filling, evaluating results for two heuristics: the Microsoft IIS Smooth Streaming heuristic and the QoE-driven Rate Adaptation Heuristic for Adaptive video Streaming by Petrangeli et al. We show that using the proposed learning-based approach, the average buffer filling can be reduced by 8.3% compared to state of the art, while achieving a comparable level of QoE.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 82-90
Proactive multi-tenant cache management for virtualized ISP networks
The content delivery market has mainly been dominated by large Content Delivery Networks (CDNs) such as Akamai and Limelight. However, CDN traffic exerts a lot of pressure on Internet Service Provider (ISP) networks. Recently, ISPs have begun deploying so-called Telco CDNs, which have many advantages, such as reduced ISP network bandwidth utilization and improved Quality of Service (QoS) by bringing content closer to the end-user. Virtualization of storage and networking resources can enable the ISP to simultaneously lease its Telco CDN infrastructure to multiple third parties, opening up new business models and revenue streams. In this paper, we propose a proactive cache management system for ISP-operated multitenant Telco CDNs. The associated algorithm optimizes content placement and server selection across tenants and users, based on predicted content popularity and the geographical distribution of requests. Based on a Video-on-Demand (VoD) request trace of a leading European telecom operator, the presented algorithm is shown to reduce bandwidth usage by 17% compared to the traditional Least Recently Used (LRU) caching strategy, both inside the network and on the ingress links, while at the same time offering enhanced load balancing capabilities. Increasing the prediction accuracy is shown to have the potential to further improve bandwidth efficiency by up to 79%.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 82-90
Proactive multi-tenant cache management for virtualized ISP networks
The content delivery market has mainly been dominated by large Content Delivery Networks (CDNs) such as Akamai and Limelight. However, CDN traffic exerts a lot of pressure on Internet Service Provider (ISP) networks. Recently, ISPs have begun deploying so-called Telco CDNs, which have many advantages, such as reduced ISP network bandwidth utilization and improved Quality of Service (QoS) by bringing content closer to the end-user. Virtualization of storage and networking resources can enable the ISP to simultaneously lease its Telco CDN infrastructure to multiple third parties, opening up new business models and revenue streams. In this paper, we propose a proactive cache management system for ISP-operated multitenant Telco CDNs. The associated algorithm optimizes content placement and server selection across tenants and users, based on predicted content popularity and the geographical distribution of requests. Based on a Video-on-Demand (VoD) request trace of a leading European telecom operator, the presented algorithm is shown to reduce bandwidth usage by 17% compared to the traditional Least Recently Used (LRU) caching strategy, both inside the network and on the ingress links, while at the same time offering enhanced load balancing capabilities. Increasing the prediction accuracy is shown to have the potential to further improve bandwidth efficiency by up to 79%.
- 8 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 60 (4) , 707-714
Subjective Quality Assessment of Longer Duration Video Sequences Delivered Over HTTP Adaptive Streaming to Tablet Devices
HTTP adaptive streaming facilitates video streaming to mobile devices connected through heterogeneous networks without the need for a dedicated streaming infrastructure. By splitting different encoded versions of the same video into small segments, clients can continuously decide which segments to download based on available network resources and device characteristics. These encoded versions can, for example, differ in terms of bitrate and spatial or temporal resolution. However, as a result of dynamically selecting video segments, perceived video quality can fluctuate during playback which will impact end-users' quality of experience. Subjective studies have already been conducted to assess the influence of video delivery using HTTP Adaptive Streaming to mobile devices. Nevertheless, existing studies are limited to the evaluation of short video sequences in controlled environments. Research has already shown that video duration and assessment environment influence quality perception. Therefore, in this article, we go beyond the traditional ways for subjective quality evaluation by conducting novel experiments on tablet devices in more ecologically valid testing environments using longer duration video sequences. As such, we want to mimic realistic viewing behavior as much as possible. Our results show that both video content and the range of quality switches significantly influence end-users' rating behavior. In general, quality level switches are only perceived in high motion sequences or in case switching occurs between high and low quality video segments. Moreover, we also found that video stallings should be avoided during playback at all times.
- 8 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 60 (4) , 707-714
Subjective Quality Assessment of Longer Duration Video Sequences Delivered Over HTTP Adaptive Streaming to Tablet Devices
HTTP adaptive streaming facilitates video streaming to mobile devices connected through heterogeneous networks without the need for a dedicated streaming infrastructure. By splitting different encoded versions of the same video into small segments, clients can continuously decide which segments to download based on available network resources and device characteristics. These encoded versions can, for example, differ in terms of bitrate and spatial or temporal resolution. However, as a result of dynamically selecting video segments, perceived video quality can fluctuate during playback which will impact end-users' quality of experience. Subjective studies have already been conducted to assess the influence of video delivery using HTTP Adaptive Streaming to mobile devices. Nevertheless, existing studies are limited to the evaluation of short video sequences in controlled environments. Research has already shown that video duration and assessment environment influence quality perception. Therefore, in this article, we go beyond the traditional ways for subjective quality evaluation by conducting novel experiments on tablet devices in more ecologically valid testing environments using longer duration video sequences. As such, we want to mimic realistic viewing behavior as much as possible. Our results show that both video content and the range of quality switches significantly influence end-users' rating behavior. In general, quality level switches are only perceived in high motion sequences or in case switching occurs between high and low quality video segments. Moreover, we also found that video stallings should be avoided during playback at all times.