2,067 research outputs found

    Progressive Caching System for Video Streaming Services Over Content Centric Network

    Get PDF
    This paper presents a metafile-based progressive caching system over the content-centric networking (CCN) tree that supports seamless video streaming services with a high network utilization. In the proposed caching system, each CCN node uses a metafile made by a scalable caching algorithm for efficient and fast chunk caching management, and the reserved area of the CCN interest/data packet headers is used to deliver caching information among the CCN nodes. Based on this caching information, the proposed caching system determines the caching range of video data to minimize the required peak bandwidth for each link. The proposed caching system is implemented using the NS-3 based named data networking simulator. Furthermore, a real cellular wireless network testbed is realized with C/C++, open sources such as CCNx and Ubuntu MME, and a Raspberry PIs to examine the performance of the proposed caching system. The experiment results demonstrate the performance improvement achieved by the proposed caching system.11Ysciescopu

    Pricing and Resource Allocation via Game Theory for a Small-Cell Video Caching System

    Full text link
    Evidence indicates that downloading on-demand videos accounts for a dramatic increase in data traffic over cellular networks. Caching popular videos in the storage of small-cell base stations (SBS), namely, small-cell caching, is an efficient technology for reducing the transmission latency whilst mitigating the redundant transmissions of popular videos over back-haul channels. In this paper, we consider a commercialized small-cell caching system consisting of a network service provider (NSP), several video retailers (VR), and mobile users (MU). The NSP leases its SBSs to the VRs for the purpose of making profits, and the VRs, after storing popular videos in the rented SBSs, can provide faster local video transmissions to the MUs, thereby gaining more profits. We conceive this system within the framework of Stackelberg game by treating the SBSs as a specific type of resources. We first model the MUs and SBSs as two independent Poisson point processes, and develop, via stochastic geometry theory, the probability of the specific event that an MU obtains the video of its choice directly from the memory of an SBS. Then, based on the probability derived, we formulate a Stackelberg game to jointly maximize the average profit of both the NSP and the VRs. Also, we investigate the Stackelberg equilibrium by solving a non-convex optimization problem. With the aid of this game theoretic framework, we shed light on the relationship between four important factors: the optimal pricing of leasing an SBS, the SBSs allocation among the VRs, the storage size of the SBSs, and the popularity distribution of the VRs. Monte-Carlo simulations show that our stochastic geometry-based analytical results closely match the empirical ones. Numerical results are also provided for quantifying the proposed game-theoretic framework by showing its efficiency on pricing and resource allocation.Comment: Accepted to appear in IEEE Journal on Selected Areas in Communications, special issue on Video Distribution over Future Interne

    Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off

    Get PDF
    A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with capacity MF bits, and contents can be proactively cached into these caches over a low traffic period; however, without the knowledge of the user demands. During the peak traffic period each user requests a single file from the server. The goal is to minimize the number of bits delivered by the server over the shared link, known as the delivery rate, over all user demand combinations. A novel coded caching scheme for the cache capacity of M= (N-1)/K is proposed. It is shown that the proposed scheme achieves a smaller delivery rate than the existing coded caching schemes in the literature when K > N >= 3. Furthermore, we argue that the delivery rate of the proposed scheme is within a constant multiplicative factor of 2 of the optimal delivery rate for cache capacities 1/K N >= 3.Comment: To appear in IEEE Transactions on Communication