Cooperative announcement-based caching for video-on-demand streaming

Recently, video-on-demand (VoD) streaming services like Netflix and Hulu have gained a lot of popularity. This has led to a strong increase in bandwidth capacity requirements in the network. To reduce this network load, the design of appropriate caching strategies is of utmost importance. Based on the fact that, typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently, cache replacement strategies have been developed that take advantage of this temporal structure in the video. In this paper, two caching strategies are proposed that additionally take advantage of the phenomenon of binge watching, where users stream multiple consecutive episodes of the same series, reported by recent user behavior studies to become the everyday behavior. Taking into account this information allows us to predict future segment requests, even before the video playout has started. Two strategies are proposed, both with a different level of coordination between the caches in the network. Using a VoD request trace based on binge watching user characteristics, the presented algorithms have been thoroughly evaluated in multiple network topologies with different characteristics, showing their general applicability. It was shown that in a realistic scenario, the proposed election-based caching strategy can outperform the state-of-the-art by 20% in terms of cache hit ratio while using 4% less network bandwidth

Flexpop: A popularity-based caching strategy for multimedia applications in information-centric networking

Information-Centric Networking (ICN) is the dominant architecture for the future Internet. In ICN, the content items are stored temporarily in network nodes such as routers. When the memory of routers becomes full and there is no room for a new arriving content, the stored contents are evicted to cope with the limited cache size of the routers. Therefore, it is crucial to develop an effective caching strategy for keeping popular contents for a longer period of time. This study proposes a new caching strategy, named Flexible Popularity-based Caching (FlexPop) for storing popular contents. The FlexPop comprises two mechanisms, i.e., Content Placement Mechanism (CPM), which is responsible for content caching, and Content Eviction Mechanism (CEM) that deals with content eviction when the router cache is full and there is no space for the new incoming content. Both mechanisms are validated using Fuzzy Set Theory, following the Design Research Methodology (DRM) to manifest that the research is rigorous and repeatable under comparable conditions. The performance of FlexPop is evaluated through simulations and the results are compared with those of the Leave Copy Everywhere (LCE), ProbCache, and Most Popular Content (MPC) strategies. The results show that the FlexPop strategy outperforms LCE, ProbCache, and MPC with respect to cache hit rate, redundancy, content retrieval delay, memory utilization, and stretch ratio, which are regarded as extremely important metrics (in various studies) for the evaluation of ICN caching. The outcomes exhibited in this study are noteworthy in terms of making FlexPop acceptable to users as they can verify the performance of ICN before selecting the right caching strategy. Thus FlexPop has potential in the use of ICN for the future Internet such as in deployment of the IoT technology

ICNにおけるストリーミングコンテンツ配信のインネットワークキャッシング方式

早大学位記番号:新7734早稲田大

Named Data Networking in Vehicular Ad hoc Networks: State-of-the-Art and Challenges

International audienceInformation-Centric Networking (ICN) has been proposed as one of the future Internet architectures. It is poised to address the challenges faced by today's Internet that include, but not limited to, scalability, addressing, security, and privacy. Furthermore, it also aims at meeting the requirements for new emerging Internet applications. To realize ICN, Named Data Networking (NDN) is one of the recent implementations of ICN that provides a suitable communication approach due to its clean slate design and simple communication model. There are a plethora of applications realized through ICN in different domains where data is the focal point of communication. One such domain is Intelligent Transportation System (ITS) realized through Vehicular Ad hoc NETwork (VANET) where vehicles exchange information and content with each other and with the infrastructure. To date, excellent research results have been yielded in the VANET domain aiming at safe, reliable, and infotainment-rich driving experience. However, due to the dynamic topologies, host-centric model, and ephemeral nature of vehicular communication, various challenges are faced by VANET that hinder the realization of successful vehicular networks and adversely affect the data dissemination, content delivery, and user experiences. To fill these gaps, NDN has been extensively used as underlying communication paradigm for VANET. Inspired by the extensive research results in NDN-based VANET, in this paper, we provide a detailed and systematic review of NDN-driven VANET. More precisely, we investigate the role of NDN in VANET and discuss the feasibility of NDN architecture in VANET environment. Subsequently, we cover in detail, NDN-based naming, routing and forwarding, caching, mobility, and security mechanism for VANET. Furthermore, we discuss the existing standards, solutions, and simulation tools used in NDN-based VANET. Finally, we also identify open challenges and issues faced by NDN-driven VANET and highlight future research directions that should be addressed by the research community

Fast-Start Video Delivery in Future Internet Architectures with Intra-domain Caching

Current TCP/IP based network is suffering from the tremendous usage of IP. Recently, content centric network (CCN) is proposed as an alternative of the future network architecture. In CCN, data itself, which is authenticated and secured, is a name and can be directly requested at the network level instead of using IP and DNS. Moreover, routers in CCN have caching abilities. Then end users can obtain the data from routers instead of remote server if the content has been stored in the routers, thus the overall network performance could be improved by reducing the transmission hops. Orthogonally, video plays a more and more important role nowadays and dominates the network traffic. Response time of each video request greatly affects the quality of user experience (QoE), users may even abandon the requested video service if they have to wait for long time before the video playback. Hence how to provide fast-start video delivery in CCN is critical. In this paper, we target to provide users fast-start video delivery in CCN. Specifically, we design a new caching policy for popularity-aware video caching in topology-aware CCN. And we propose to encode the video using scalable video coding (SVC) for fast-start video delivery and cache each video layer separately following the designed caching policies. Given an assigned weight by users, the tradeoff between the waiting time and received video quality is studied. Simulations are conducted to verify the performances and the results show that the proposed scheme outperforms state-of-the-art schemes significantly in typical scenarios

Mobile edge computing in wireless communication networks: design and optimization

This dissertation studies the design and optimization of applying mobile edge computing (MEC) in three kinds of advanced wireless networks, which is motivated by three non-trivial but not thoroughly studied topics in the existing MEC-related literature. First, we study the application of MEC in wireless powered cooperation-assisted systems. The technology of wireless power transfer (WPT) used at the access point (AP) is capable of providing sustainable energy supply for resource-limited user equipment (UEs) to support computation offloading, but also introduces the double-near-far effect into wireless powered communication networks (WPCNs). By leveraging cooperation among near-far users, the system performance can be highly improved through effectively suppressing the double-near-far effect in WPCNs. Then, we consider the application of MEC in the unmanned aerial vehicle (UAV)-assisted relaying systems to make better use of the flexible features of UAV as well as its computing resources. The adopted UAV not only acts as an MEC server to help compute UEs' offloaded tasks but also a relay to forward UEs' offloaded tasks to the AP, thus such kind of cooperation between the UAV and the AP can take the advantages of both sides so as to improve the system performance. Last, heterogeneous cellular networks (HetNets) with the coexistence of MEC and central cloud computing (CCC) are studied to show the complementary and promotional effects between MEC and CCC. The small base stations (SBSs) empowered by edge clouds offer limited edge computing services for UEs, whereas the macro base station (MBS) provides high-performance CCC services for UEs via restricted multiple-input multiple-output (MIMO) backhauls to their associated SBSs. With further considering the case with massive MIMO backhauls, the system performance can be further improved while significantly reducing the computational complexity. In the aforementioned three advanced MEC systems, we mainly focus on minimizing the energy consumption of the systems subject to proper latency constraints, due to the fact that energy consumption and latency are regarded as two important metrics for measuring the performance of MEC-related works. Effective optimization algorithms are proposed to solve the corresponding energy minimization problems, which are further validated by numerical results

Mathematical analysis of scheduling policies in peer-to-peer video streaming networks

Las redes de pares son comunidades virtuales autogestionadas, desarrolladas en la capa de aplicación sobre la infraestructura de Internet, donde los usuarios (denominados pares) comparten recursos (ancho de banda, memoria, procesamiento) para alcanzar un fin común. La distribución de video representa la aplicación más desafiante, dadas las limitaciones de ancho de banda. Existen básicamente tres servicios de video. El más simple es la descarga, donde un conjunto de servidores posee el contenido original, y los usuarios deben descargar completamente este contenido previo a su reproducción. Un segundo servicio se denomina video bajo demanda, donde los pares se unen a una red virtual siempre que inicien una solicitud de un contenido de video, e inician una descarga progresiva en línea. El último servicio es video en vivo, donde el contenido de video es generado, distribuido y visualizado simultáneamente. En esta tesis se estudian aspectos de diseño para la distribución de video en vivo y bajo demanda. Se presenta un análisis matemático de estabilidad y capacidad de arquitecturas de distribución bajo demanda híbridas, asistidas por pares. Los pares inician descargas concurrentes de múltiples contenidos, y se desconectan cuando lo desean. Se predice la evolución esperada del sistema asumiendo proceso Poisson de arribos y egresos exponenciales, mediante un modelo determinístico de fluidos. Un sub-modelo de descargas secuenciales (no simultáneas) es globalmente y estructuralmente estable, independientemente de los parámetros de la red. Mediante la Ley de Little se determina el tiempo medio de residencia de usuarios en un sistema bajo demanda secuencial estacionario. Se demuestra teóricamente que la filosofía híbrida de cooperación entre pares siempre desempeña mejor que la tecnología pura basada en cliente-servidor