71,390 research outputs found
Joint Pushing and Caching with a Finite Receiver Buffer: Optimal Policies and Throughput Analysis
Pushing and caching hold the promise of significantly increasing the
throughput of content-centric wireless networks. However, the throughput gain
of these techniques is limited by the buffer size of the receiver. To overcome
this, this paper presents a Joint Pushing and Caching (JPC) method that jointly
determines the contents to be pushed to, and to be removed from, the receiver
buffer in each timeslot. An offline and two online JPC policies are proposed
respectively based on noncausal, statistical, and causal content Request Delay
Information (RDI), which predicts a user's request time for certain content. It
is shown that the effective throughput of JPC is increased with the receiver
buffer size and the pushing channel capacity. Furthermore, the causal feedback
of user requests is found to greatly enhance the performance of online JPC
without inducing much signalling overhead in practice.Comment: 6 pages, 4 figure
Is the Web ready for HTTP/2 Server Push?
HTTP/2 supersedes HTTP/1.1 to tackle the performance challenges of the modern
Web. A highly anticipated feature is Server Push, enabling servers to send data
without explicit client requests, thus potentially saving time. Although
guidelines on how to use Server Push emerged, measurements have shown that it
can easily be used in a suboptimal way and hurt instead of improving
performance. We thus tackle the question if the current Web can make better use
of Server Push. First, we enable real-world websites to be replayed in a
testbed to study the effects of different Server Push strategies. Using this,
we next revisit proposed guidelines to grasp their performance impact. Finally,
based on our results, we propose a novel strategy using an alternative server
scheduler that enables to interleave resources. This improves the visual
progress for some websites, with minor modifications to the deployment. Still,
our results highlight the limits of Server Push: a deep understanding of web
engineering is required to make optimal use of it, and not every site will
benefit.Comment: More information available at https://push.netray.i
GreenDelivery: Proactive Content Caching and Push with Energy-Harvesting-based Small Cells
The explosive growth of mobile multimedia traffic calls for scalable wireless
access with high quality of service and low energy cost. Motivated by the
emerging energy harvesting communications, and the trend of caching multimedia
contents at the access edge and user terminals, we propose a paradigm-shift
framework, namely GreenDelivery, enabling efficient content delivery with
energy harvesting based small cells. To resolve the two-dimensional randomness
of energy harvesting and content request arrivals, proactive caching and push
are jointly optimized, with respect to the content popularity distribution and
battery states. We thus develop a novel way of understanding the interplay
between content and energy over time and space. Case studies are provided to
show the substantial reduction of macro BS activities, and thus the related
energy consumption from the power grid is reduced. Research issues of the
proposed GreenDelivery framework are also discussed.Comment: 15 pages, 5 figures, accepted by IEEE Communications Magazin
Proactive Caching for Energy-Efficiency in Wireless Networks: A Markov Decision Process Approach
Content caching in wireless networks provides a substantial opportunity to
trade off low cost memory storage with energy consumption, yet finding the
optimal causal policy with low computational complexity remains a challenge.
This paper models the Joint Pushing and Caching (JPC) problem as a Markov
Decision Process (MDP) and provides a solution to determine the optimal
randomized policy. A novel approach to decouple the influence from buffer
occupancy and user requests is proposed to turn the high-dimensional
optimization problem into three low-dimensional ones. Furthermore, a
non-iterative algorithm to solve one of the sub-problems is presented,
exploiting a structural property we found as \textit{generalized monotonicity},
and hence significantly reduces the computational complexity. The result
attains close performance in comparison with theoretical bounds from
non-practical policies, while benefiting from higher time efficiency than the
unadapted MDP solution.Comment: 6 pages, 6 figures, submitted to IEEE International Conference on
Communications 201
Optimal Content Placement for En-Route Web Caching
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally that the file-placement solution output by our algorithm outperforms existing en-route caching policies. The optimal placement of web files can be implemented with a reasonable level of cache coordination and management overhead for en-route caching; and importantly, it can be achieved with or without using data prefetching
CliqueStream: an efficient and fault-resilient live streaming network on a clustered peer-to-peer overlay
Several overlay-based live multimedia streaming platforms have been proposed
in the recent peer-to-peer streaming literature. In most of the cases, the
overlay neighbors are chosen randomly for robustness of the overlay. However,
this causes nodes that are distant in terms of proximity in the underlying
physical network to become neighbors, and thus data travels unnecessary
distances before reaching the destination. For efficiency of bulk data
transmission like multimedia streaming, the overlay neighborhood should
resemble the proximity in the underlying network. In this paper, we exploit the
proximity and redundancy properties of a recently proposed clique-based
clustered overlay network, named eQuus, to build efficient as well as robust
overlays for multimedia stream dissemination. To combine the efficiency of
content pushing over tree structured overlays and the robustness of data-driven
mesh overlays, higher capacity stable nodes are organized in tree structure to
carry the long haul traffic and less stable nodes with intermittent presence
are organized in localized meshes. The overlay construction and fault-recovery
procedures are explained in details. Simulation study demonstrates the good
locality properties of the platform. The outage time and control overhead
induced by the failure recovery mechanism are minimal as demonstrated by the
analysis.Comment: 10 page
Requirements analysis of the VoD application using the tools in TRADE
This report contains a specification of requirements for a video-on-demand (VoD) application developed at Belgacom, used as a trial application in the 2RARE project. The specification contains three parts: an informal specification in natural language; a semiformal specification consisting of a number of diagrams intended to illustrate the informal specification; and a formal specification that makes the requiremants on the desired software system precise. The informal specification is structured in such a way that it resembles official specification documents conforming to standards such as that of IEEE or ESA. The semiformal specification uses some of the tools in from a requirements engineering toolkit called TRADE (Toolkit for Requirements And Design Engineering). The purpose of TRADE is to combine the best ideas in current structured and object-oriented analysis and design methods within a traditional systems engineering framework. In the case of the VoD system, the systems engineering framework is useful because it provides techniques for allocation and flowdown of system functions to components. TRADE consists of semiformal techniques taken from structured and object-oriented analysis as well as a formal specification langyage, which provides constructs that correspond to the semiformal constructs. The formal specification used in TRADE is LCM (Language for Conceptual Modeling), which is a syntactically sugared version of order-sorted dynamic logic with equality. The purpose of this report is to illustrate and validate the TRADE/LCM approach in the specification of distributed, communication-intensive systems
- …