Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/16509
Title: Schedulers for MPEG-DASH compliant multi-view video over LTE
Authors: Savona, Gilbert
Debono, Carl James
Keywords: Long-Term Evolution (Telecommunications)
Quality of service (Computer networks)
Streaming video
MPEG (Video coding standard)
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Savona, G., & Debono, C. J. (2016). Schedulers for MPEG-DASH compliant multi-view video over LTE. International Conference on Telecommunications and Multimedia (TEMU), Heraklion. 1-6.
Abstract: Higher data rates offered by Long Term Evolution (LTE) networks, better displays, and core architectures on mobile devices, provide the technology for transmission of multiview video (MVV) services. The high bandwidth required could be somewhat alleviated through high efficiency video coding, but this does not guarantee that quality of service (QoS) thresholds are met. To help with the varying network conditions of cellular environments, adaptive bitrate (ABR) solutions in an Over-The-Top (OTT) fashion provide a possible solution. This paper focuses on the medium access control (MAC) scheduler for transmission of MVV content over an LTE network. MPEG-DASH's features are considered as the basis of the ABR solution. Simulation results show reduced packet losses and increased numbers in concurrent users, compared to a non-ABR solution. Moreover, to improve the video quality, each main view was prioritized through the Evolved Packet System (EPS) bearer to better protect this content and its decodability.
URI: https://www.um.edu.mt/library/oar//handle/123456789/16509
Appears in Collections:Scholarly Works - FacICTCCE

Files in This Item:
File Description SizeFormat 
Conference paper - Schedulers for MPEG-DASH compliant multi-view video over LTE.pdf
  Restricted Access
Schedulers for MPEG-DASH compliant multi-view video over LTE840.56 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.