Replica placement in ring based content delivery networks

Hybrid CDN-P2P architecture is a combination of pure Content Distribution Networks (CDNs) and Peer-to-Peer (P2P) networks. This architecture relies on CDN and P2P complementary advantages. This paper discusses Replica Placement Algorithms (RPAs) in hybrid CDN-P2P architecture. There are two constraints in the used model; one is the server storage capacity constraint and another is an upper bound for the number of replicas for each content. RPA has been considered as a constraint p-median problem. Constraint p-median problem belongs to the NP-hard problems. Therefore, some kinds of heuristic algorithms are used to solve this problem. Heuristic algorithms' results are compared with Constraint P-Median (CPM) problem that presented by Sun. The formulations take into account both the transmitting and storage costs. The simulation results show that in hybrid CDN-P2P architecture, the greedy algorithm has the lowest cost among heuristic. It is showed that replication cost of hybrid CDN-P2P networks is lower than CDNs.

Recently, large-volume contents distributed by a content delivery network (CDN) on the Internet increase the load of content delivery servers and networks, which may degrade the quality of service. To overcome this problem, some mirror servers providing the same content are located on a network, and a request is navigated to one of the mirror servers. It is important to locate the mirror servers on the appropriate place in a network, as it affects the performance of the CDN. In this paper, we address the server location problem, which determines the location of the mirror servers satisfying the following two constraints: the number of the paths to the servers in a link is small, and the number of the nodes whose nearest mirror server is the same is small. The former constraint corresponds to the alleviation of the network load, and the latter constraint corresponds to the alleviation of the server load. First, we prove that this new server location problem is NP-complete. Next, we present a heuristic algorithm and evaluate it by applying to some actual network topologies. The results show that the algorithm can determine a good server location.

Content delivery networks (CDNs) provide an efficient support for serving http and streaming media content white minimizing the network impact of content delivery as well as overcoming the server overload problem. For serving the large documents and media files, there is an additional problem of the original content distribution across the CDN edge servers. We propose an algorithm, called ALM-fastreplica, for optimizing replication of large files across the edge servers in CDNs. The original file is partitioned into k subfiles, and each subfile is replicated via a correspondingly constructed multicast tree. Nodes from the different multicast trees use additional cross-nodes connections to exchange their corresponding subfiles such that each node eventually receives an entire file. This new replication method significantly reduces file replication time, up to 5-15 times compared to the traditional unicast (or point-to-point) schema. Since a single node failure in the multicast tree during the file distribution may impact the file delivery to a significant number of nodes, it is important to design an algorithm which is able to deal with node failures. We augment ALM-FastReplica with an efficient reliability mechanism, that can deal with node failures by making local repair decisions within a particular replication group of nodes. Under the proposed algorithm, the load of the failed node is shared among the nodes of the corresponding replication group, making the performance degradation gradual.

Internet delivery infrastructures are traditionally optimized for low-latency traffic, such as the Web traffic. However, in recent years we are witnessing a massive growth of throughput-oriented applications, such as video streaming. These applications introduce new tradeoffs and design choices for content delivery networks (CDNs). In this paper, we focus on understanding two key design choices: (1) What is the impact of the number of CDN's peering points and server locations on its aggregate throughput and operating costs? (2) How much can ISP-CDNs benefit from using path selection to maximize its aggregate throughput compared to other CDNs who only have control at the edge? Answering these questions is challenging because content distribution involves a complex ecosystem consisting of many parties (clients, CDNs, ISPs) and depends on various settings which differ across places and over time. We introduce a simple model to illustrate and quantify the essential tradeoffs in CDN designs. Using extensive analysis over a variety of network topologies (with varying numbers of CDN peering points and server locations), operating cost models, and client video streaming traces, we observe that: (1) Doubling the number of peering points roughly doubles the aggregate throughput over a wide range of values and network topologies. In contrast, optimal path selection improves the CDN aggregate throughput by less than 70\%, and in many cases by as little as a few percents. (2) Keeping the number of peering points constant, but reducing the number of location (data centers) at which the CDN is deployed can significantly reduce operating costs.

Content delivery networks (CDN) have been widely used to provide reduced delay and packet loss, fault tolerance, and improved scalability for Web content delivery. Additional benefits are provided for video streaming when one designs a streaming media CDN (SM-CDN) for either conventional single description (SD) or multiple description (MD) coding. Specifically, when precise network conditions and topology are known, simulations show that an MD-SM-CDN can provide 20 to 40% reduction in distortion over a conventional SD-SM-CDN, even when the underlying CDN is not designed with MD streaming in mind. This paper examines the performance of an MD-SM-CDN as a function of different network topologies and loss conditions, and compares it with a conventional SD-SM-CDN. This examination provides insight into an MD-SM-CDN's performance when knowledge of network topology and conditions is imprecise or uncertain. Our simulations indicate that an MD-SM-CDN can provide improved performance over a conventional SD-SM-CDN over a wide range of network topologies and loss conditions.

We analyze competition between Internet Service Providers (ISPs) where consumers demand heterogeneous content within two Quality-of-Service (QoS) regimes, Net Neutrality and Paid Prioritization, and show that paid prioritization increases the static efficiency compared to a neutral network. We also consider paid prioritization intermediated by Content Delivery Networks (CDNs). While the use of CDNs is welfare neutral, it results in higher consumer prices for internet access. Regarding incentives to invest in network capacity we show that discriminatory regimes lead to higher incentives than the neutral regime as long as capacity is scarce, while investment is highest in the presence of CDNs.

Broadband network technologies have improved the bandwidth of the edge of the Internet but its core is still a bottleneck for large file transfers. Content Delivery Networks (CDNs), built at the edge of the Internet, are able to reduce the workload of network backbones but their scalability and network reach is often limited, especially in case of QoS-bound delivery services. By using the emerging CDN internetworking, a CDN can dynamically exploit resources of other cooperating CDNs to face peak loads and temporary malfunctions without violating QoS levels negotiated with content providers. This paper proposes an architectural schema and an algorithm to minimize transfer time of large files taking into account the SLA constraints agreed between the CDN in charge of content delivery and the content provider, while respecting the maximum budget that the CDN can pay to peer CDNs to ensure its revenue. The experimental analysis confirms the benefits of applying the proposed algorithm in CDN internetworking to enforce SLA guarantees of CDN services.

SummaryIn today's dynamic video landscape, an end user needs services to be delivered to any devices anytime with less delay over the Internet. Now users' expectation has changed; they want faster time‐to‐market, cost reduction, and the ability to adjust according to the evolving requirements, which are a limit for the traditional server‐based approach. The explosive growth of the internet multimedia application needs a new approach to content delivery to overcome the limitations of server‐based techniques. Cloud‐based content delivery networks (CCDNs) have recently started to emerge where contents are cached from the cloud storage and delivered through the distribution service to meet quality of services (QoS) of requested services. In this paper, we dealt with CCDN deployment problem and proposed a new eigenvalue‐based edge infrastructure for a network service provider to serve the users with a variation on proximity interest concerning operational cost and user QoS satisfaction. The edge infrastructure designing is a two‐step process: (a) ideal location search for placing edge server and (b) edge server placement and capacity provisioning. The performance of the proposed approach is appraised via modeling and simulation. Performance evaluation outcomes are exhibited to manifest the effectiveness and competitiveness of our approach when compared with existing algorithms.

Cloud providers give storage access and efficient content placement and delivery services to content providers by optimizing cloud-based content delivery. The cost-efficient model should not only consider the content delivery cost but also the storage cost associated with the cloud network. In this article, a novel cloud-based content delivery model is proposed that uses shared storage models for cost optimization in content delivery. Shared storages are placed in different areas of the content delivery network and an efficient replica placement strategy is employed using optimization techniques. Different content delivery schemes are used in proposed model for different situations and overall content delivery cost is optimized. Experimental results show better performance and lesser cost in terms of storage, traffic and latency and also satisfy Quality-of-Service (QoS) and Quality-of-Experience (QoE) in content delivery using PSO when compared to ACO and GA.

Over the last years, the content delivery network (CDN) market has been witnessing globally an increase in the development of cloud-based CDNs, as they constitute a viable and cost-effective alternative to traditional commercial CDNs. Towards that direction, Social-Aware Virtual Network Embedding (SAViNE) for wireless content delivery within the OpenLab project aims at establishing, assessing, and prototyping a novel framework for deploying a CDN over the wireless cloud. Specifically, the goal of SAViNE is to provide experimental validation of the efficiency of social network analysis (SNA) - inspired surrogate server placement strategies, devised for fostering content delivery. The proposed framework has been integrated with the OpenLab experimental facilities, providing a run-time environment for CDN deployment, operation, and performance evaluation over the wireless environment. The framework’s feasibility and scalability is experimentally validated. The study is complemented with repeatability evaluation of experimental measurements, related to the resulting CDN’s operational efficiency.

Vehicular applications in smart cities, such as assisted and autonomous driving, require sophisticated data processing, low latency, and high throughput data transmission. Edge Computing is a leading approach designed to meet those application requirements. By deploying Edge servers at the network's edge, close to the vehicles, such applications can be successfully delivered while adhering to low-latency and high-throughput requirements. However, optimal placement of Edge servers is challenging since it necessitates a trade-off between quality of service and deployment cost. Latency can be reduced by placing as many Edge servers as feasible close to the vehicles, however, this results in significant deployment costs. This work addresses the problem of optimal Edge server placement. It solves this problem using integer linear programming, considering the relation between delay and cost, as well as the capacity of Edge servers in realistic road traffic scenarios. The proposed generic methodology is designed to reduce the cost of deploying Edge servers by combining the achievement of the desired latency threshold with workload balancing between Edge servers. We evaluate the efficiency of the proposed solution mathematically and through simulations based on open data from real vehicles traffic on roadways of Bordeaux, France. The obtained results demonstrate that our solution outperforms existing Edge server placement approaches, especially on workload balancing.

Multicast routing from a set of data centers in elastic optical networks

Internet content caching for multimedia services has received much attention mainly in the field of large-scale wired networking as a primary solution to save network resources and improve quality of service (QoS). Rapidly increasing consumption of multimedia content in mobile networks brings a challenge of how to efficiently deliver content in local wireless access networks. Cache embedment in wireless mesh environment is an intriguing attempt to enhance the QoS and service capacity, leading to the question of how to design an efficient content delivery network considering the inherent characteristics of the wireless environment. We propose and investigate an efficient cache placement strategy in novel two-tier wireless content delivery networks, which utilize separate channels for content dissemination and content service. Such a two-tier network system model helps to achieve much better content delivery performance with a greatly reduced system design complexity compared to single-tier network system models. Further, we incorporate a delay cost due to contention, which is mainly responsible for performance in shared-medium wireless networks, as a key metric for cache placement under the system model. After formally formulating the cache placement problem, we propose a cross-layer heuristic algorithm and demonstrate its performance compared with an optimal solution by integer linear programming. Simulation results show significant performance improvements by our strategy compared to the performance of existing representative strategies in terms of service delay, packet delivery ratio, and the amount of delivered packets within a given delay deadline.

Today’s content delivery networks (CDNs) use large sets of globally distributed servers, advanced routing techniques, and dynamic server selection to provide users with low delay, reliable access to Web, and streaming content. These strategies allow CDNs to extend their reach and performance into large numbers of networks around the globe. However, nearly 20% of Internet users reside in China, where local regulations and network policies make it challenging for global CDNs to serve foreign content from servers in China and limit the effectiveness of their traditional strategies for low-latency content delivery. Recently, a number of China-specific CDNs have partnered with global CDNs to provide service in the country. However, little is known about how CDNs in China are implemented, nor their impact on performance. In this paper, we are the first to investigate the impact of China’s unique policy and networking environment on CDN implementations and deployments. We find that deployments inside China exhibit different client-mapping behavior than global ones, namely, through static server selection for clients given a customer site, and through region-specific clients partitioning and mapping rather than using live network information. We also show that ignoring these properties can significantly impact server selection quality. Our results can be useful for optimization of CDNs in China.

The development of Network Function Virtualization (NFV) and Software Defined Networks (SDN) standards is an opportunity for Mobile Network Operators (MNOs) to deploy Content Delivery Network (CDN) functionalities into the mobile network edge, such as Base Stations (BSs). In this paper, we investigated the content placement problem for the BS-based wireless CDN system. We call the storage resources implemented on BSs as storage helpers. Due to the limited helper storage capacity and the limited user population served per BS, helpers exhibit low hit ratio comparing to traditional CDN edge servers serving a wide area. Then, cooperation is a suitable means to enhance the performance of the wireless CDN system. We propose that BSs close to each other cooperate in replicating content and replying user requests. We formulate the optimum content placement problem to minimize the traffic pressure on mobile network gateways, and show the problem complexity is NP-Hard. We then transform the problem into a multiple-Maximum Weighted Independent Set problem, and propose a heuristic algorithm. The evaluation shows that the hit ratio is improved by our algorithm comparing to the traditional Least Frequently Used (LFU) policy without cooperation.