30,051 research outputs found
Adaptive TTL-Based Caching for Content Delivery
Content Delivery Networks (CDNs) deliver a majority of the user-requested
content on the Internet, including web pages, videos, and software downloads. A
CDN server caches and serves the content requested by users. Designing caching
algorithms that automatically adapt to the heterogeneity, burstiness, and
non-stationary nature of real-world content requests is a major challenge and
is the focus of our work. While there is much work on caching algorithms for
stationary request traffic, the work on non-stationary request traffic is very
limited. Consequently, most prior models are inaccurate for production CDN
traffic that is non-stationary.
We propose two TTL-based caching algorithms and provide provable guarantees
for content request traffic that is bursty and non-stationary. The first
algorithm called d-TTL dynamically adapts a TTL parameter using a stochastic
approximation approach. Given a feasible target hit rate, we show that the hit
rate of d-TTL converges to its target value for a general class of bursty
traffic that allows Markov dependence over time and non-stationary arrivals.
The second algorithm called f-TTL uses two caches, each with its own TTL. The
first-level cache adaptively filters out non-stationary traffic, while the
second-level cache stores frequently-accessed stationary traffic. Given
feasible targets for both the hit rate and the expected cache size, f-TTL
asymptotically achieves both targets. We implement d-TTL and f-TTL and evaluate
both algorithms using an extensive nine-day trace consisting of 500 million
requests from a production CDN server. We show that both d-TTL and f-TTL
converge to their hit rate targets with an error of about 1.3%. But, f-TTL
requires a significantly smaller cache size than d-TTL to achieve the same hit
rate, since it effectively filters out the non-stationary traffic for
rarely-accessed objects
COGNITO â The graphics and content delivery module
The poster presents the two main components for the graphics and content delivery module of COGNITO system. One Augmented reality player is presented as well as one editor of multimedia content to be used in the player (augmented information)
Adaptive Replication in Distributed Content Delivery Networks
We address the problem of content replication in large distributed content
delivery networks, composed of a data center assisted by many small servers
with limited capabilities and located at the edge of the network. The objective
is to optimize the placement of contents on the servers to offload as much as
possible the data center. We model the system constituted by the small servers
as a loss network, each loss corresponding to a request to the data center.
Based on large system / storage behavior, we obtain an asymptotic formula for
the optimal replication of contents and propose adaptive schemes related to
those encountered in cache networks but reacting here to loss events, and
faster algorithms generating virtual events at higher rate while keeping the
same target replication. We show through simulations that our adaptive schemes
outperform significantly standard replication strategies both in terms of loss
rates and adaptation speed.Comment: 10 pages, 5 figure
Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery
In-network caching is an appealing solution to cope with the increasing
bandwidth demand of video, audio and data transfer over the Internet.
Nonetheless, an increasing share of content delivery services adopt encryption
through HTTPS, which is not compatible with traditional ISP-managed approaches
like transparent and proxy caching. This raises the need for solutions
involving both Internet Service Providers (ISP) and Content Providers (CP): by
design, the solution should preserve business-critical CP information (e.g.,
content popularity, user preferences) on the one hand, while allowing for a
deeper integration of caches in the ISP architecture (e.g., in 5G femto-cells)
on the other hand.
In this paper we address this issue by considering a content-oblivious
ISP-operated cache. The ISP allocates the cache storage to various content
providers so as to maximize the bandwidth savings provided by the cache: the
main novelty lies in the fact that, to protect business-critical information,
ISPs only need to measure the aggregated miss rates of the individual CPs and
do not need to be aware of the objects that are requested, as in classic
caching. We propose a cache allocation algorithm based on a perturbed
stochastic subgradient method, and prove that the algorithm converges close to
the allocation that maximizes the overall cache hit rate. We use extensive
simulations to validate the algorithm and to assess its convergence rate under
stationary and non-stationary content popularity. Our results (i) testify the
feasibility of content-oblivious caches and (ii) show that the proposed
algorithm can achieve within 10\% from the global optimum in our evaluation
Design of a middleware for QoS-aware distribution transparent content delivery
Developers of distributed multimedia applications face a diversity of multimedia formats, streaming platforms and streaming protocols. Furthermore, support for end-to-end quality-of-service (QoS) is a crucial factor for the development of future distributed multimedia systems. This paper discusses the architecture, design and implementation of a QoS-aware middleware platform for content delivery. The platform supports the development of distributed multimedia applications and can deliver content with QoS guarantees. QoS support is offered by means of an agent infrastructure for QoS negotiation and enforcement. Properties of content are represented using a generic content representation model described using the OMG Meta Object Facility (MOF) model. A content delivery framework manages stream paths for content delivery despite differences in streaming protocols and content encoding. The integration of the QoS support, content representation and content delivery framework results in a QoS-aware middleware that enables representation transparent and location transparent delivery of content
Content delivery and challenges in education hybrid students
Traditionally, taught postgraduate programmes placed students in well-defined categories such as 'distance learning' and 'on-campus' or 'part-time' and 'full-time'. The practical reality is that postgraduate students rarely fall into such simple, diametric roles and can be more suitably generalised under the concept of the 'hybrid student'. Hybrid students are dynamic, with changing
requirements in relation to their education. They expect flexibility and the ability to make changes relating to module participation level, study mechanism and lecture attendance, in order to suit personal preference and circumstance. This paper briefly introduces the concept of the hybrid student and how the concept has been handled within the School of Electronic Engineering at DCU.
Following this, some discussion is provided in relation to a number of the content delivery technologies used in programmes facilitating these students: HTML, PowerPoint, Moodle, DocBook and Wiki. Finally, some of the general challenges, which have been encountered in supporting such
diverse students, are briefly discussed
DOH: A Content Delivery Peer-to-Peer Network
Many SMEs and non-proÂŻt organizations suÂźer when their Web
servers become unavailable due to °ash crowd eŸects when their web site
becomes popular. One of the solutions to the °ash-crowd problem is to place
the web site on a scalable CDN (Content Delivery Network) that replicates
the content and distributes the load in order to improve its response time.
In this paper, we present our approach to building a scalable Web Hosting
environment as a CDN on top of a structured peer-to-peer system of collaborative
web-servers integrated to share the load and to improve the overall
system performance, scalability, availability and robustness. Unlike clusterbased
solutions, it can run on heterogeneous hardware, over geographically
dispersed areas. To validate and evaluate our approach, we have developed a
system prototype called DOH (DKS Organized Hosting) that is a CDN implemented
on top of the DKS (Distributed K-nary Search) structured P2P
system with DHT (Distributed Hash table) functionality [9]. The prototype
is implemented in Java, using the DKS middleware, the Jetty web-server, and
a modiÂŻed JavaFTP server. The proposed design of CDN has been evaluated
by simulation and by evaluation experiments on the prototype
- âŠ