DOCSLIB.ORG

Peer-To-Peer Streaming of Layered Video: Efficiency, Fairness And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Peer-To-Peer Streaming of Layered Video: Efficiency, Fairness And Peer-to-Peer Streaming of Layered Video: Efficiency, Fairness and Incentive Hao Huy, Yang Guo∗, and Yong Liuy yElectrical & Computer Engineering, Polytechnic Institute of NYU, Brooklyn, NY 11201 ∗ Corporate Research, Thomson, Princeton, NJ 08540 Abstract—Recent advance in scalable video coding (SVC) To adopt SVC into P2P streaming, two key design questions makes it possible for users to receive the same video with need to be answered: 1) layer subscription: how many layers different qualities. To adopt SVC in P2P streaming, two key each peer should receive; and 2) layer scheduling: how to design questions need to be answered: 1) layer subscription: how many layers each peer should receive? 2) layer scheduling: deliver to peers the layers they subscribed. From the system how to deliver to peers the layers they subscribed? From the point of view, the most efficient solution is to maximize the system point of view, the most efficient solution is to maximize aggregate video quality perceived by all peers, i.e, to optimize the aggregate video quality on all peers, i.e., the social welfare. the social welfare. From individual peer point of view, the From individual peer point of view, the solution should be fair. solution should be fair. However, in P2P streaming, due to Fairness in P2P streaming should additionally take into account peer contributions to make the solution incentive-compatible. In the dual server-consumer role of individual peers, the notion this paper, we develop utility maximization models to understand of fairness is much more subtle than that in traditional server- the interplay between efficiency, fairness and incentive in layered client systems, where clients are only considered as resource P2P streaming. We show that taxation mechanisms can be devised consumers. A solution allocating the same video quality to all to strike the right balance between social welfare and individual peers regardless of their contributions would not be considered peers’ welfare. We develop practical taxation-based P2P layered streaming designs, including layer subscription strategy, chunk as fair, and therefore would not provide incentives for peers to scheduling policy, and mesh topology adaptation. Through exten- contribute. A good layered P2P streaming solution has to strike sive trace-driven simulations, we demonstrate that the proposed the right balance between efficiency, fairness and incentive. designs can effectively drive layered P2P streaming systems to In this paper, we develop analytical models and practical converge to the desired operating points in a distributed fashion. streaming algorithms to understand and control the interplay between efficiency, fairness and incentive in layered P2P streaming. Specifically, we develop network-coding based util- I. INTRODUCTION ity maximization models to obtain the most efficient layered P2P live video streaming has recently emerged as a cost- streaming solution. The choice of peer utility function reflects efficient IPTV solution on the Internet. It has attracted sub- the target fairness among peers when they are considered only stantial attentions in research community and industry. Several as video consumers. To incorporate contribution-awareness, widely deployed commercial P2P live streaming systems [1]– we adopt taxation as a peer-incentive mechanism and augment [3] routinely attract hundreds of thousands of users to watch the utility maximization models to make the solution incentive- live video broadcast online. Extensive research [4]–[9] has compatible. studied various aspects of system design, ranging from P2P Taxation based incentive mechanism [14], [15] offers a overlay construction, data sharing strategy, adoption of ad- flexible framework that allows the tradeoff between users’ vanced video coding, to the application of network coding personal fairness/welfare and the system-wide social welfare technique. In-depth measurement [10]–[12] study further al- (see Fig. 1). Let ud be the upload bandwidth contributed by lows us to observe the working systems in the field. user d. Under a tax rate 0 ≤ t ≤ 1, the target received t PN The success of P2P computing hinges on the underlying video rate of user d is rd = (1 − t)ud + N i=1 ui, where principle that participants shall contribute their resources (in N is the total number of peers in the system. The received terms of bandwidth, storage space, or computational power) rate consists of two parts: a fraction of its own contribution, while enjoying the service. Most existing P2P streaming and a fair share from the pool of taxed bandwidth. The tax systems assume the cooperation of peers and deliver the same rate t adjusts the balance between individual peers’ welfare video quality to all peers. Recent advance in scalable video and the social welfare. As t approaches zero, the received coding (SVC) [13] makes it possible for users to receive video rate approach the contributed rate, mimicking the ‘tit- the same video with different qualities. SVC encodes video for-tat’ strategy. As t approaches one, the received video rate into correlated layers. The base layer can be independently is the same for all peers, thus achieve the social optimum as decoded, while higher layers are decodable only if layers described in Section II. beneath have been decoded. The video quality perceived by a Our contribution can be summarized as follows: user increases as the number of decoded layers increases. • We develop utility maximization models to study the 2 number of received substreams. The number of trees joined by a peer is dynamically adjusted to reflect the entitled video Service Substream differentiated Trading quality determined by the taxation policy. We analytically peer selection t study the tradeoff between efficiency, fairness and incentive in P2P streaming with SVC coding in general topology. We employ mesh-based designs to implement taxation in P2P t layered streaming. Single rate SVC/MDC p2p II. MODELING LAYERED P2P STREAMING p2p streaming streaming In this section, we develop analytical models to study the interplay between the efficiency, fairness and incentive in layered P2P streaming. Fig. 1. Social welfare vs. personal welfare. interplay between efficiency, fairness and incentive in lay- A. Maximizing Efficiency ered P2P streaming. The models enable us to numerically When peers are cooperative, they are willing to contribute investigate the impact of peering strategies and chunk their upload bandwidth without any incentive. The design scheduling polices on the fundamental trade-offs between objective of the system is to maximize the aggregate video the three. quality on all peers. With layered coding, the perceived video • We adopt taxation mechanism to adjust the balance quality on a peer is an increasing function of the number between the social welfare and individual peer welfare. of video layers received. PSNR (Peak Signal-to-Noise Ratio) We develop practical taxation-based P2P layered stream- is the standard objective metric to evaluate the quality of ing designs, including layer subscription strategy, chunk a compressed video and thus can be adopted as the utility scheduling policy, and mesh topology adaptation. function in layered video streaming. PSNR of a video coded • Through extensive trace driven simulations, we demon- at rate rc can be approximated by a logarithmic function strate that the proposed layered streaming designs can β log(rc) [20], where β is a constant related to the video effectively drive P2P streaming systems to the desired feature. This approximation is also valid in the SVC case [13]. operating points in a distributed fashion. Let rd be the total rate of received video layers on peer The remaining of the paper is organized as follows. We d. If the aggregate uploading capacity of the server and briefly go through related work in the following section. all peers is U, the aggregate receiving rate on all peers is Utility-maximization models and numerical studies are pre- PN naturally bounded by d=1 rd ≤ U. Since log(·) is a concave sented in Section II. Taxation-based layered streaming designs function, the aggregate utility can be maximized when all peers are presented in Section III. The performance of the proposed U receive video at the same rate, i.e., rd = N . For single-layer designs are evaluated in Section IV. The paper is concluded video streaming, it was shown in [21] that, if peers are fully in Section V. connected, a two-hop relay streaming can achieve this optimal rate. The solution for layered video streaming naturally follows A. Related Work if we let all peers subscribe to the same number of video layers U The majority of existing P2P live streaming systems ignore allowed by the rate N and deliver each layer to all peers the fairness requirement and focus solely on maximizing the using the two-hop relay scheme. However, it is unrealistic to social welfare. For instance, [5] studies how to fully utilize have fully connected mesh in a large-scale streaming system. available upload bandwidth so as to maximize the video rate For arbitrary streaming topology, the utility maximization in that can be streamed. SVC stream is also employed to improve layered streaming deserves more study. the social welfare further in face of peer churn and fluctuation 1) Network Coding Model: We consider a SVC system of available bandwidth. Recently, [16] proposes a 3-stage where the source server encodes a video stream into L layers scheduling mechanism to achieve high throughput and low with nested dependency. Layer l can be decoded if all the video quality jitter. Fairness issue is studied in [9], [17], [18]. layers below l are received. A peer can subscribe up to k, [17] proposes a service differentiated peer selection mecha- k ≤ L, layers. The server multicasts each layer to all peers nism for P2P media streaming systems. Higher contribution subscribed to it. There are L simultaneous multicast sessions, peers are offered more flexibility and choice in selecting peers, one for each layer, in the P2P overlay network.
Load more

Recommended publications
  • Fairness in Wireless Networks - Issues, Measures and Challenges Huaizhou SHI, R
    1 Fairness in Wireless Networks - Issues, Measures and Challenges Huaizhou SHI, R. Venkatesha Prasad, Ertan Onur, I.G.M.M. Niemegeers WMC, Telecommunications, Delft University of Technology fh.z.shi, R.R.VenkateshaPrasad, E.Onur, [email protected] Abstract—Fairness is an important and interdisciplinary topic employed in many fields. This article discusses fairness issues in wireless networks. First, we address various issues in the study on fairness. In general, we formulate the issues in fairness research through the three core questions. Finding answers them leads us to various nuances of fairness studies. Existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks. Relationship between fairness, utility and resource allocation are also discussed. At the end of this article, we provide properties of fairness and an example fairness management process. We also state some challenges that point to further work on fairness in wireless networks. Indeed research on fairness is entangled with various other aspects such as performance, utility, optimization and throughput at the network as well as individual (or node) level. While consolidating various contributions in the literature, this article tries to explain the nuances of all these aspects clearly Fig. 1. A simple illustration of a wireless network consisting of five wireless in the domain of wireless networking. nodes and six wireless links where the objective of the nodes is to access the Index Terms—Fairness, Utility, Resource allocation, Wireless Internet services over Node C which acts as the gateway. networks, Jain’s index, Entropy, Max-min, Min-max, Propor- tional fairness QoS requirements of the nodes should be fairly satisfied, Energy consumption should be the same when the load is I.
    [Show full text]
  • A Fair Share for All: TCP-Inspired Adaptation Logic for Qoe Fairness
    1 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 16, NO. 2, JUNE 2019 475 A Fair Share for All: TCP-Inspired Adaptation Logic for QoE Fairness Among Heterogeneous HTTP Adaptive Video Streaming Clients Michael Seufert , Nikolas Wehner , and Pedro Casas Abstract—This paper presents a novel adaptation logic for due to the high number of requests, high bit rates of the video HTTP adaptive streaming (HAS), which achieves not only a content and strict real-time requirements of the video playback. high quality of experience (QoE) but also high QoE fairness Still, the delivered streaming service has to meet the expecta- among independent and heterogeneous clients. The algorithm forces video clients to adapt the requested quality level based tions of the end users. To understand and eventually improve on the current network conditions and their individual bit rate Internet services like video streaming, application providers requirements, such that the overall quality levels selected by all and Internet service providers use the concept of Quality of currently active streaming clients are fairly distributed, i.e., they Experience (QoE) to quantify the subjective experience and do not diverge too much. The design of the algorithm is inspired satisfaction of their customers with the network and the ser- by the well-known transmission control protocol (TCP) conges- tion control, and drives heterogeneous clients to independently vice. For video streaming, the most severe QoE degradations converge on similar quality levels without the need for commu- were the waiting time until the start of the playback (initial nicating with each other and/or with a centralized controller in delay) and interruptions of the playback (stalling) [1]–[3].
    [Show full text]
  • A Fair Share for All: Novel Adaptation Logic for Qoe Fairness of HTTP Adaptive Video Streaming
    1 A Fair Share for All: Novel Adaptation Logic for QoE Fairness of HTTP Adaptive Video Streaming Michael Seufert∗, Nikolas Wehner∗, Pedro Casas∗, Florian Wamser† ∗AIT Austrian Institute of Technology GmbH, Vienna, Austria †University of Wurzburg,¨ Wurzburg,¨ Germany michael.seufert.fl@ait.ac.at, [email protected], [email protected], fl[email protected] Abstract—This paper presents a novel adaptation logic for HTTP over TCP, recently also over QUIC) to promote a simple HTTP adaptive streaming (HAS), which achieves not only a service implementation and high availability. It is implemented high Quality of Experience (QoE) but also high QoE fairness in many commercial solutions and was standardized as MPEG among independent and heterogeneous clients. The algorithm forces video clients to adapt the requested quality level based Dynamic Adaptive Streaming over HTTP (DASH) [4]. on the current network conditions and their individual bit rate To enable adaptation of the video streaming to the current requirements, such that the overall quality levels selected by network conditions, the HAS server stores the video content all currently active streaming clients are fairly distributed, i.e., encoded in different representations, i.e., in different bit rates. they do not diverge too much. The design of the algorithm The representations are split into segments (also referred to is inspired by the well-known Transmission Control Protocol (TCP) congestion control, and drives heterogeneous clients to as chunks) and corresponding segments of different represen- independently converge on similar quality levels without the need tations contain the same frames, such that the bit rate can for communicating with each other and/or with a centralized be seamlessly switched at each segment boundary.
    [Show full text]
  • An Early Congestion Feedback and Rate Adjustment Schemes for Many-To-One Communication in Cloud-Based Data Center Networks
    Photon Netw Commun DOI 10.1007/s11107-015-0526-y An early congestion feedback and rate adjustment schemes for many-to-one communication in cloud-based data center networks Prasanthi Sreekumari1 · Jae-il Jung1 · Meejeong Lee2 Received: 25 September 2014 / Accepted: 18 June 2015 © Springer Science+Business Media New York 2015 Abstract Cloud data centers are playing an important role tion feedback and window adjusting schemes of DCTCP to for providing many online services such as web search, cloud mitigate the TCP Incast problem. Through detailed QualNet computing and back-end computations such as MapReduce experiments, we show that NewDCTCP significantly out- and BigTable. In data center network, there are three basic performs DCTCP and TCP in terms of goodput and latency. requirements for the data center transport protocol such as The experimental results also demonstrate that NewDCTCP high throughput, low latency and high burst tolerance. Unfor- flows provide better link efficiency and fairness with respect tunately, conventional TCP protocols are unable to meet the to DCTCP. requirements of data center transport protocol. One of the main practical issues of great importance is TCP Incast to Keywords Cloud computing · Data center networks · TCP occur many-to-one communication sessions in data centers, Incast in which TCP experiences sharp degradation of throughput and higher delay. This important issue in data center networks has already attracted the researchers because of the devel- 1 Introduction opment of cloud computing. Recently, few solutions have been proposed for improving the performance of TCP in data Cloud computing is emerging as an attractive Internet service center networks.
    [Show full text]
  • A Fair Share for All: Novel Adaptation Logic for Qoe Fairness of HTTP Adaptive Video Streaming
    A Fair Share for All: Novel Adaptation Logic for QoE Fairness of HTTP Adaptive Video Streaming Michael Seufert∗, Nikolas Wehner∗, Pedro Casas∗, Florian Wamser† ∗AIT Austrian Institute of Technology GmbH, Vienna, Austria † University of Wurzburg,¨ Wurzburg,¨ Germany michael.seufert.fl@ait.ac.at, [email protected], [email protected], fl[email protected] Abstract—This paper presents a novel adaptation logic for HTTP over TCP, recently also over QUIC) to promote a simple HTTP adaptive streaming (HAS), which achieves not only a service implementation and high availability. It is implemented high Quality of Experience (QoE) but also high QoE fairness in many commercial solutions and was standardized as MPEG among independent and heterogeneous clients. The algorithm forces video clients to adapt the requested quality level based Dynamic Adaptive Streaming over HTTP (DASH) [4]. on the current network conditions and their individual bit rate To enable adaptation of the video streaming to the current requirements, such that the overall quality levels selected by network conditions, the HAS server stores the video content all currently active streaming clients are fairly distributed, i.e., encoded in different representations, i.e., in different bit rates. they do not diverge too much. The design of the algorithm The representations are split into segments (also referred to is inspired by the well-known Transmission Control Protocol (TCP) congestion control, and drives heterogeneous clients to as chunks) and corresponding segments of different represen- independently converge on similar quality levels without the need tations contain the same frames, such that the bit rate can for communicating with each other and/or with a centralized be seamlessly switched at each segment boundary.
    [Show full text]
  • A New Qoe Fairness Index for Qoe Management
    Quality and User Experience (2018) 3:4 https://doi.org/10.1007/s41233-018-0017-x RESEARCH ARTICLE A new QoE fairness index for QoE management Tobias Hoßfeld1,5 · Lea Skorin‑Kapov2 · Poul E. Heegaard3 · Martín Varela4 Received: 7 December 2016 © The Author(s) 2018. This article is an open access publication Abstract The user-centric management of networks and services focuses on the Quality of Experience (QoE) as perceived by the end user. In general, the goal is to maximize (or at least ensure an acceptable) QoE, while ensuring fairness among users, e.g., in terms of resource allocation and scheduling in shared systems. A problem arising in this context is that the notions of fairness commonly applied in the QoS domain do not translate well to the QoE domain. We have recently proposed a QoE fairness index F, which solves these issues. In this paper, we provide a detailed rationale for it, along with a thorough com- parison of the proposed index and its properties against the most widely used QoS fairness indices, showing its advantages. We furthermore explore the potential uses of the index, in the context of QoE management and describe future research lines on this topic. Keywords Quality of experience (QoE) · Quality of service (QoS) · Fairness · Fairness index Introduction the QoE of diferent services is often diferent given the same network conditions; i.e., the way in which QoS can Quality of Experience (QoE) is “the degree of delight or be mapped to QoE is service-specifc. For example, voice annoyance of the user of an application or service” [26].
    [Show full text]
  • Fairness in Radio Resource Management for Wireless Networks
    EURASIP Journal on Wireless Communications and Networking Fairness in Radio Resource Management for Wireless Networks Guest Editors: Mohamed Hossam Ahmed, Alagan Anpalagan, Kwang-Cheng Chen, Zhu Han, and Ekram Hossain Fairness in Radio Resource Management for Wireless Networks EURASIP Journal on Wireless Communications and Networking Fairness in Radio Resource Management for Wireless Networks Guest Editors: Mohamed Hossam Ahmed, Alagan Anpalagan, Kwang-Cheng Chen, Zhu Han, and Ekram Hossain Copyright © 2009 Hindawi Publishing Corporation. All rights reserved. This is a special issue published in volume 2009 of “EURASIP Journal on Wireless Communications and Networking.” All articles are open access articles distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Editor-in-Chief Luc Vandendorpe, Universite´ catholique de Louvain, Belgium Associate Editors Thushara Abhayapala, Australia Christian Hartmann, Germany Sayandev Mukherjee, USA Mohamed H. Ahmed, Canada Stefan Kaiser, Germany Kameswara Rao Namuduri, USA Farid Ahmed, USA George K. Karagiannidis, Greece AmiyaNayak,Canada Carles Anton-Haro,´ Spain Chi Chung Ko, Singapore Claude Oestges, Belgium Anthony C. Boucouvalas, Greece Visa Koivunen, Finland A. Pandharipande, The Netherlands Lin Cai, Canada Nicholas Kolokotronis, Greece Phillip Regalia, France Yuh-Shyan Chen, Taiwan Richard Kozick, USA A. Lee Swindlehurst, USA Pascal Chevalier, France Sangarapillai Lambotharan, UK George S. Tombras, Greece Chia-Chin Chong, South Korea Vincent Lau, Hong Kong Lang Tong, USA Soura Dasgupta, USA DavidI.Laurenson,UK Athanasios Vasilakos, Greece Ibrahim Develi, Turkey Tho Le-Ngoc, Canada Ping Wang, Canada Petar M. Djuric,´ USA Wei Li, USA Weidong Xiang, USA Mischa Dohler, Spain Tongtong Li, USA Yang Xiao, USA Abraham O.
    [Show full text]
  • CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming (Extended Version)
    CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming (Extended Version) Bastian Alt+,∗, Trevor Ballard+,z, Ralf Steinmetzz, Heinz Koeppl∗, Amr Rizkz ∗Bioinspired Communication Systems Lab (BCS), {bastian.alt | heinz.koeppl}@bcs.tu-darmstadt.de zMultimedia Communications Lab (KOM), [email protected], {amr.rizk | rst}@kom.tu-darmstadt.de, Technische Universität Darmstadt, Germany Abstract—Recent advances in quality adaptation algorithms The problem of video quality adaptation is aggravated in leave adaptive bitrate (ABR) streaming architectures at a cross- Future Internet architectures such as Named Data Networking roads: When determining the sustainable video quality one may (NDN). In NDN, content is requested by name rather than either rely on the information gathered at the client vantage point or on server and network assistance. The fundamental problem location, and each node within the network will either return here is to determine how valuable either information is for the the requested content or forward the request. Routers are adaptation decision. This problem becomes particularly hard in equipped with caches to hold frequently-requested content, future Internet settings such as Named Data Networking (NDN) thereby reducing the round-trip-time (RTT) of the request where the notion of a network connection does not exist. while simultaneously saving other network links from redun- In this paper, we provide a fresh view on ABR quality adap- tation for QoE maximization, which we formalize as a decision dant content requests. Several attempts to make DASH-style problem under uncertainty, and for which we contribute a sparse streaming possible over NDN exist, e.g., [2], for which the Bayesian contextual bandit algorithm denoted CBA.
    [Show full text]
  • A Methodology for Resource Management in Heterogeneous Wireless Networks
    SuperBS: A Methodology for Resource Management in Heterogeneous Wireless Networks Ilias Tsompanidis Ahmed H. Zahran Cormac J. Sreenan Computer Science Department Electronics and Electrical Communications Department Computer Science Department University College Cork Cairo University University College Cork Cork, Ireland Cairo, Egypt Cork, Ireland Email: [email protected] Email: [email protected] Email: [email protected] Abstract—Resource management in heterogeneous wireless heuristics however, provide sub-optimal solutions that are not networks has been approached from various angles by the guaranteed to perfectly adhere to the policy. research community. The complexity of the network and the heterogeneity of clients make the conclusive comparison of the Deriving from our work in URM, this paper introduces a various resource allocations challenging. This work introduces process for comparing the performance of resource manage- superBS, an approach defining a theoretical optimal resource ment algorithms (RMA) for heterogeneous wireless networks. allocation that adheres to the required resource management The idea of superBS is presented, a single virtual Base Station policies and can be used as a reference f o r the performance (BS) that supersedes all available BSs in the real network. The of considered algorithms, mitigating the heterogeneity of the superBS theoretically serves all clients at once, considering system. T w o applications that leverage superBS are developed, an a number of parameters affecting the performance of the implementation of a heuristic resource management algorithm, and the enhancement of a popular fairness metric with support multi-BS network. It provides an upper limit to the total f o r clients of different classes and traffic demands.
    [Show full text]
  • A Scalable User Fairness Model for Adaptive Video Streaming Over SDN-Assisted Future Networks
    A Scalable User Fairness Model for Adaptive Video Streaming over SDN-Assisted Future Networks Mu Mu∗, Matthew Broadbent†, Arsham Farshad†, Nicholas Hart†, David Hutchison†, Qiang Ni†, Nicholas Race† ∗ The University of Northampton, Northampton, NN2 6JD, United Kingdom [email protected] † Lancaster University, Lancaster, LA1 4WA, United Kingdom [email protected] Abstract The growing demand for online distribution of high quality and high throughput content is dominating today’s Internet infrastructure. This includes both production and user-generated media. Among the myriad of media distribution mechanisms, HTTP adaptive streaming (HAS) is becoming a popular choice for multi-screen and multi-bitrate media services over heterogeneous networks. HAS applications often compete for network resources without any coordination between each other. This leads to Quality of Experience (QoE) fluctuations on delivered content, and unfairness between end users. Meanwhile, new network protocols, technologies and architectures, such as Software Defined Networking (SDN), are being developed for the future Internet. The programmability, flexibility and openness of these emerging developments can greatly assist the distribution of video over the Internet. This is driven by the increasing consumer demands and QoE requirements. This paper introduces a novel user-level fairness model UFair and its hierarchical variant UFairHA, which orchestrate HAS media streams using emerging network architectures and incorporate three fairness metrics (video quality, switching impact and cost efficiency) to achieve user-level fairness in video distribution. The UFairHA has also been implemented in a purpose- built SDN testbed using open technologies including OpenFlow. Experimental results demonstrate the performance and feasibility of our design for video distribution over future networks.
    [Show full text]
  • New Bandwidth Allocation Methods to Provide Quality-Of-Experience Fairness for Video Streaming Services
    New Bandwidth Allocation Methods to Provide Quality-of-Experience Fairness for Video Streaming Services by Mahdi Hemmati Thesis submitted in partial fulfillment of the requirements for the Ph.D. degree in Electrical and Computer Engineering School of Electrical Engineering and Computer Science Faculty of Engineering University of Ottawa c Mahdi Hemmati, Ottawa, Canada, 2017 Abstract Video streaming over the best-effort networks is a challenging problem due to the time- varying and uncertain characteristics of the links. When multiple video streams are present in a network, they share and compete for the common bandwidth. In such a setting, a bandwidth allocation algorithm is required to distribute the available resources among the streams in a fair and efficient way. Specifically, it is desired to establish fairness across end-users' Quality of Experience (QoE). In this research, we propose three novel methods to provide QoE-fair network band- width allocation among multiple video streaming sessions. First, we formulate the problem of bandwidth allocation for video flows in the context of Network Utility Maximization (NUM) framework, using sigmoidal utility functions, rather than conventional but unreal- istic concave functions. An approximation algorithm for Sigmoidal Programming (SP) is utilized to solve the resulting nonconvex optimization problem, called NUM-SP. Simulation results indicate improvements of at least 60% in average utility/QoE and 45% in fairness, while using slightly less network resources, compared to two representative methods. Subsequently, we take a collaborative decision-theoretic approach to the problem of rate adaptation among multiple video streaming sessions, and design a multi-objective foresighted optimization model for network resource allocation.
    [Show full text]
  • Adaptive Radio Resource Management for Ofdma-Based Macro- and Femtocell Networks
    Departament de Teoria del Senyal i Comunicacions UNIVERSITAT POLITÈCNICA DE CATALUNYA Ph.D. Thesis ADAPTIVE RADIO RESOURCE MANAGEMENT FOR OFDMA-BASED MACRO- AND FEMTOCELL NETWORKS Thesis by Emanuel Bezerra Rodrigues In Partial Fulfillment of the Requirements for the Degree of Doctor from the Universitat Polit`ecnica de Catalunya Advisor: Prof. Fernando Casadevall Palacio Departament de Teoria del Senyal i Comunicacions (TSC) Universitat Polit`ecnica de Catalunya (UPC) Barcelona, May 28, 2011 With love to my wife Gladia, and to our little baby. Abstract User and cellular operator requirements and expectations have been continuously evolving, and con- sequently, advanced radio access technologies have emerged. The International Mobile Telecommu- nications - Advanced (IMT-Advanced) specifications for mobile broadband Fourth Generation (4G) networks state, among other requirements, that enhanced peak data rates of 100 Mbps and 1 Gbps for high and low mobility should be provided. In order to achieve this challenging performance, Or- thogonal Frequency Division Multiple Access (OFDMA) has been chosen as the access technology, and femtocells have been considered for improving indoor coverage. In order to fully explore the flexibility of these technologies and use the scarce radio resources in the most efficient way possible, intelligent and adaptive Radio Resource Management (RRM) techniques are crucial. There are many open RRM problems in wireless networks in general, and OFDMA-based cellular systems in particular. One of such problems is the fundamental trade-off that exists between efficiency in the resource usage and fairness in the resource distribution among network players. Several opportunistic RRM algorithms, which dynamically allocate the resources to the network players that present the highest efficiency indicator with regard to these resources, have been proposed to maximize the efficiency in the resource usage.
    [Show full text]