Authentication, Authorization and Accounting Framework for Multicast Content Delivery

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.

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.

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.

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.

A content distribution network (CDN) is a system to improve the delivery of content to the end users on the Internet, in which popular content may be cached or replicated at a number of servers, placed closer to some client populations. The design of a CDN consists of defining which content should be replicated at each server, the number of servers, where they should be placed in the network, which server a client’s requests should be sent to, and how server responses should be routed to the clients. CDNs were originally designed for traditional web files. However, given the increase in streaming media content on the Internet, the development of efficient CDN design methods that take into account the special characteristics of media objects, is of great interest. These characteristics include sustained high bandwidth requirements and faster response time by multicast delivery. The main goal of this paper is to propose an algorithm for designing a streaming media CDN with the efficient byte hit ratio and fast response time. We propose the segment-based dynamic caching mechanism with the pheromone that is defined a kind of lifetime of each segment. We evaluate this algorithm in simulations using CDNsim.KeywordsCDNsegment based cachingpheromone

Modern websites use Content Delivery Networks (CDNs) to speed up the delivery of static content. However, we show that DNS-based selection of CDN servers can be refined to fully deliver on the speedup of CDNs. We propose DNS-Proxy (dp), a client-side process that shares load-balancing functionality with CDNs by choosing from among resolved CDN servers based on last mile network performance. Our measurement study of CDN infrastructure deployed by five major CDN providers shows that dp reduces webpage load time by 29% on average. If dp has already resolved the domain, the reduction in webpage load time is as much as 40%. Finally, dp reduces the load time of individual static Web objects by as much as 43%. We argue that dp enables a more effective use of existing content delivery infrastructure and represents a complementary strategy to a continual increase of geographic content availability.

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.

The presence of bottlenecks in the Internet reduces the performance of content delivery in typical client-server applications such as Web browsing and media streaming. Caching and server farm architectures have been a good solution to this problem since the World Wide Web became very popular, but now they are not enough to support new e-business solutions. Content delivery networks (CDNs) distribute content by placing it on several surrogate servers across the Internet and try to overcome these bottlenecks. In CDN scenarios a good request routing algorithm selects the best surrogate for a client's request; it makes its decision using metrics received by the network and the surrogate. Typical metrics are network latency, hop count, available Internet bandwidth, and surrogate load. We analyze the impact of different request routing algorithms on the delivery performance of CDNs. A new request routing algorithm, called WSE (worst surrogate exclusion), is proposed. Worst surrogate exclusion excludes those surrogates that provide the client with low performance and prevents surrogates overloading. Simulation results show that WSE can reduce users average response time and efficaciously exploit the CDN's capacity.

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.

Content delivery over Internet is optimized for low use perceived latency by designing specialized Content Distribution Network (CDN). Content servers are connected through a content switch the distributes client requests among them to achieve load balancing across the servers. The content switch is located one-hop away from the servers. Server load balancing is one factor in achieveing low user perceived latency and improving operational efficiency. Traffic engineering is another factor that is generally and integrated with serverload balancing for CDN optimization. In this thesis we propose a request routing algorithm for a CDN that was designed to integrate server selection and traffic engineering functions in the request routing system. The CDN employs MPLS in the network for traffic engineering. The proposed algorithm optimizes content delivery for user perceived latency by achieving server load balancing and network traffic loan manaement among alternative paths. It also improves operational efficiency of the CDN by eliminating bottleneck paths and increasing utilization of underutilized servers and paths.

Mobile and wireless technology has revolutionized people’s lives by enabling data delivery anytime, anywhere, liberating the users from the restrictions of wired networks. In addition broadband communications permit high speed data connections. Since multimedia content delivered on-line requires reasonably high data rates and today’s wireless networks (3G, Wi-Fi, WiMAX etc) can support the quality requirements of media streaming delivery, while mobile devices handheld or not (Pocket PC, smart phones, laptop pc etc) are able to accommodate a variety of content formats, content delivery has become an indisputable trend. This paper presents such a content delivery network, the ENAMORADO architecture, which is the outcome of the work carried out in the IST project ENAMORADO (Enabling Nomadic Agents in a Multimedia Oriented Architecture of Distributed Objects). The ENAMORADO architecture covers the full content delivery chain from the media producers to the end users incorporating the content production, annotation, aggregation, adaptation and delivery. The paper describes the reference architecture of the infrastructure as well as the testbed used in the components integration and validation process. In addition further system evaluation results are presented.

Content Delivery Networks (CDNs) have emerged as a dominant mechanism to deliver content over the Internet. Despite their importance, to our best knowledge, large-scale analysis of CDN cache performance is lacking in prior literature. A CDN serves many content publishers simultaneously and thus has unique workload characteristics; it typically deals with extremely large content volume and high content diversity from multiple content publishers. CDNs also have unique performance metrics; other than hit ratio, CDNs also need to minimize network and disk load on cache servers. In this paper, we present measurement and analysis of caching workload at a large commercial CDN. Using detailed logs from four geographically distributed CDN cache servers, we analyze over 600 million content requests accounting for more than 1.3 petabytes worth of traffic. We analyze CDN workload from a wide range of perspectives, including request composition, size, popularity, and temporal dynamics. Using real-world logs, we also evaluate cache replacement algorithms, including two enhancements designed based on our CDN workload analysis: N-hit and content-aware caching. The results show that these enhancements achieve substantial performance gains in terms of cache hit ratio, disk load, and origin traffic volume.

With the development of computer networks, the amount of network information continues to grow. To facilitate the transfer of the increasing information, a content distribution network (CDN) is developed by adding an intermediate layer on the existing network. Technically, Caching strategy of CDN is the most important mechanism, which heavily impacts the CDN performance. On the other hand, considering the cost of operating CDN, some strategies have been proposed, aiming to save the CDN cost in terms of, e.g., power energy. This paper makes a brief review on the recent developments of CDN in terms of its caching strategy and operation cost, and discusses some potential development directions of CDN.

The Internet architecture, based on end-to-end connections, had difficulties to efficiently deliver the always increasing number of contents. Content Delivery Networks (CDN) have been deployed to improve the delivery. Recent research works propose a new networking architecture, much more adapted to the current Internet usage (end-users just care about the contents they want and not about the endpoints that provide them). The Content-Centric Networking (CCN) aims at replacing the IP paradigm. CCN has been investigated by the research community for few years, and some demonstrators have proved its feasibility. However, less works have addressed the CDN use-case so far. In this paper, we show that the current CCN design, which does not allow negative reply, is not suitable for interconnection with the CDN service. We then propose the use of two new tables in the CCN nodes that are interconnected to the CDN servers, in order to detect possible misses in the CDN servers and subsequently forward the requests for missing contents toward the original servers instead of the CDN surrogates. The evaluations we have performed highlight that the integration of both new tables does not incur an increase of the memory requirement and thus a cost in the node. The proposed solution is thus a viable solution to make CCN network work in close cooperation with CDN networks, each one keeping its specific business models and functions: transport for CCN, storage for CDN.

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.