22 research outputs found

    Proactive multi-tenant cache management for virtualized ISP networks

    Get PDF
    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 multi-tenant 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%

    Towards multi-tenant cache management for ISP networks

    Get PDF
    The decreasing cost of storage and the advent of virtualization technology can allow Internet Service Providers (ISPs) to deploy multi-tenant caching infrastructures and lease them to content producers and Content Delivery Networks (CDNs). Serving content requests directly from the ISP network does not only reduce the delivery time, but also allows the ISP to optimize the network resources by controlling the placement and routing of content items. In this paper, we introduce a multi-tenant cache management approach that significantly reduces the bandwidth utilization of ISPs networks by pro-actively allocating caching space, leased by content producers and/or CDNs, and intelligently routing content to the end users. Using real content request traces, we show that the optimal solution to this problem can increase the cache hit ratio by 70.64% while reducing the bandwidth usage by 57.17% on average, compared to a commonly used reactive cache management scheme. These results provide a benchmark for the development of novel multi-tenant cache management strategies

    Towards multi-tenant cache management for ISP networks

    Get PDF
    The decreasing cost of storage and the advent of virtualization technology can allow Internet Service Providers (ISPs) to deploy multi-tenant caching infrastructures and lease them to content producers and Content Delivery Networks (CDNs). Serving content requests directly from the ISP network does not only reduce the delivery time, but also allows the ISP to optimize the network resources by controlling the placement and routing of content items. In this paper, we introduce a multitenant cache management approach that significantly reduces the bandwidth utilization of ISPs networks by pro-actively allocating caching space, leased by content producers and/or CDNs, and intelligently routing content to the end users. Using real content request traces, we show that the optimal solution to this problem can increase the cache hit ratio by 70.64% while reducing the bandwidth usage by 57.17% on average, compared to a commonly used reactive cache management scheme. These results provide a benchmark for the development of novel multi-tenant cache management strategies

    Optimal content delivery with network coding

    Get PDF
    We present a unified linear program formulation for optimal content delivery in content delivery networks (CDNs), taking into account various costs and constraints associated with content dissemination from the origin server to storage nodes, data storage, and the eventual fetching of content from storage nodes by end users. Our formulation can be used to achieve a variety of performance goals and system behavior, including the bounding of fetch delay, load balancing, and robustness against node and arc failures. Simulation results suggest that our formulation performs significantly better than the traditional minimum k-median formulation for the delivery of multiple content, even under modest circumstances (small network, few objects, low storage budget, low dissemination costs)

    Distributed Selfish Coaching

    Full text link
    Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node's resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage at each node. Motivated by content networking applications -- including web caching, CDNs, and P2P -- this paper extends our previous work on the on-line version of the problem, which was conducted under a game-theoretic framework, and limited to object replication. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache management policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that on-line cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. To appear in a substantial manner, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the "outlier" characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. Our framework utilizes a simple control-theoretic approach to dynamically parameterize the cache management scheme. We show performance evaluation results that quantify the benefits from instantiating such a framework, which could be substantial under skewed demand profiles.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067); EU IST (CASCADAS and E-NEXT); Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230

    Content-aware resource allocation model for IPTV delivery networks

    Get PDF
    Nowadays, with the evolution of digital video broadcasting, as well as, the advent of high speed broadband networks, a new era of TV services has emerged known as IPTV. IPTV is a system that employs the high speed broadband networks to deliver TV services to the subscribers. From the service provider viewpoint, the challenge in IPTV systems is how to build delivery networks that exploits the resources efficiently and reduces the service cost, as well. However, designing such delivery networks affected by many factors including choosing the suitable network architecture, load balancing, resources waste, and cost reduction. Furthermore, IPTV contents characteristics, particularly; size, popularity, and interactivity play an important role in balancing the load and avoiding the resources waste for delivery networks. In this paper, we investigate the problem of resource allocation for IPTV delivery networks over the recent architecture, peer-service area architecture. The Genetic Algorithm as an optimization tool has been used to find the optimal provisioning parameters including storage, bandwidth, and CPU consumption. The experiments have been conducted on two data sets with different popularity distributions. The experiments have been conducted on two popularity distributions. The experimental results showed the impact of content status on the resource allocation process

    Balance content allocation scheme for peer-service area CDN architecture for IPTV services

    Get PDF
    One of the main problems in IPTV technology is how to manage the huge amount of multimedia contents efficiently to meet the demands of users especially for Video on Demand (VoD) services.Content Distribution Networks (CDN) are used to solve this problem but the problem of load imbalance among servers still exists due to the dynamic changes in contents and user interests in an IPTV environment.In the VoD context, many content storage management architecture models are proposed: single point, hierarchal, distributed, and service peer area architectures.In the this paper we choose peer-service area architecture for CDN to study the load imbalance problem and try to handle it by modifying peer-service area architecture and proposing a balanced content allocation scheme that solves the load imbalance problem by replicating the contents based on their popularity.Experimental results show that this proposed allocation scheme can maintain the load balancing among servers and avoid over/under utilization of servers
    corecore