54 research outputs found
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
We consider caching in cellular networks in which each base station is
equipped with a cache that can store a limited number of files. The popularity
of the files is known and the goal is to place files in the caches such that
the probability that a user at an arbitrary location in the plane will find the
file that she requires in one of the covering caches is maximized.
We develop distributed asynchronous algorithms for deciding which contents to
store in which cache. Such cooperative algorithms require communication only
between caches with overlapping coverage areas and can operate in asynchronous
manner. The development of the algorithms is principally based on an
observation that the problem can be viewed as a potential game. Our basic
algorithm is derived from the best response dynamics. We demonstrate that the
complexity of each best response step is independent of the number of files,
linear in the cache capacity and linear in the maximum number of base stations
that cover a certain area. Then, we show that the overall algorithm complexity
for a discrete cache placement is polynomial in both network size and catalog
size. In practical examples, the algorithm converges in just a few iterations.
Also, in most cases of interest, the basic algorithm finds the best Nash
equilibrium corresponding to the global optimum. We provide two extensions of
our basic algorithm based on stochastic and deterministic simulated annealing
which find the global optimum.
Finally, we demonstrate the hit probability evolution on real and synthetic
networks numerically and show that our distributed caching algorithm performs
significantly better than storing the most popular content, probabilistic
content placement policy and Multi-LRU caching policies.Comment: 24 pages, 9 figures, presented at SIGMETRICS'1
Performance of spatial Multi-LRU caching under traffic with temporal locality
International audienceIn this work a novel family of decentralised caching policies for wireless networks is introduced, referred to as spatial multi-LRU. These improve cache-hit probability by exploiting multi-coverage. Two variations are proposed, the multi-LRU-One and-All, which differ in the number of replicas inserted in the covering edge-caches. The evaluation is done under spatial traffic that exhibits temporal locality, with varying content catalogue and dependent demands. The performance metric is hit probability and the policies are compared to (1) the single-LRU and (2) an upper bound for all centralised policies with periodic popularity updates. Numerical results show the multi-LRU policies outperform both comparison policies. The reason is their passive adaptability to popularity changes. Between the-One and-All variation, which one is preferable strongly depends on the available storage space and on traffic characteristics. The performance also depends on the popularity shape
Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles
We focus on a dense cellular network, in which a limited-size cache is
available at every Base Station (BS). In order to optimize the overall
performance of the system in such scenario, where a significant fraction of the
users is covered by several BSs, a tight coordination among nearby caches is
needed. To this end, this pape introduces a class of simple and fully
distributed caching policies, which require neither direct communication among
BSs, nor a priori knowledge of content popularity. Furthermore, we propose a
novel approximate analytical methodology to assess the performance of
interacting caches under such policies. Our approach builds upon the well known
characteristic time approximation and provides predictions that are
surprisingly accurate (hardly distinguishable from the simulations) in most of
the scenarios. Both synthetic and trace-driven results show that the our
caching policies achieve excellent performance (in some cases provably
optimal). They outperform state-of-the-art dynamic policies for interacting
caches, and, in some cases, also the greedy content placement, which is known
to be the best performing polynomial algorithm under static and perfectly-known
content popularity profiles
Mobile Map Browsers: Anticipated User Interaction for Data Pre-fetching
When browsing a graphical display of geospatial data on mobile devices, users typically change the displayed maps by panning, zooming in and out, or rotating the device. Limited storage space on mobile devices and slow wireless communications, however, impede the performance of these operations. To overcome the bottleneck that all map data to be displayed on the mobile device need to be downloaded on demand, this thesis investigates how anticipated user interactions affect intelligent pre-fetching so that an on-demand download session is extended incrementally. User interaction is defined as a set of map operations that each have corresponding effects on the spatial dataset required to generate the display. By anticipating user interaction based on past behavior and intuition on when waiting for data is acceptable, it is possible to device a set of strategies to better prepare the device with data for future use. Users that engage with interactive map displays for a variety of tasks, whether it be navigation, information browsing, or data collection, experience a dynamic display to accomplish their goal. With vehicular navigation, the display might update itself as a result of a GPS data stream reflecting movement through space. This movement is not random, especially as is the case of moving vehicles and, therefore, this thesis suggests that mobile map data could be pre-fetched in order to improve usability. Pre-fetching memory-demanding spatial data can benefit usability in several ways, but in particular it can (1) reduce latency when downloading data over wireless connections and (2) better prepare a device for situations where wireless internet connectivity is weak or intermittent. This thesis investigates mobile map caching and devises an algorithm for pre-fetching data on behalf of the application user. Two primary models are compared: isotropic (direction-independent) and anisotropic (direction-dependent) pre-fetching. A prefetching simulation is parameterized with many trajectories that vary in complexity (a metric of direction change within the trajectory) and it is shown that, although anisotropic pre-fetching typically results in a better pre-fetching accuracy, it is not ideal for all scenarios. This thesis suggests a combination of models to accommodate the significant variation in moving object trajectories. In addition, other methods for pre-fetching spatial data are proposed for future research
Recommended from our members
Modeling and analyzing device-to-device content distribution in cellular networks
Device-to-device (D2D) communication is a promising approach to optimize the utilization of air interface resources in 5G networks, since it allows decentralized proximity-based communication. To obtain caching gains through D2D, mobile nodes must possess content that other mobiles want. Thus, devising intelligent cache placement techniques are essential for D2D. The goal of this dissertation is to provide randomized spatial models for content distribution in cellular networks by capturing the locality of the content, and additionally, to provide dynamic content placement algorithms exploiting the node configurations.
First, a randomized content caching scheme for D2D networks in the cellular context is proposed. Modeling the locations of the devices as a homogeneous Poisson Point Process (PPP), the probability of successful content delivery in the presence of interference and noise is derived. With some idealized modeling aspects, i.e., given that (i) only a fraction of users to be randomly scheduled at a given time, and (ii) the request distribution does not change over time, it has been shown that the performance of caching can be optimized by smoothing out the request distribution, where the smoothness of the caching distribution is mainly determined by the path loss exponent, and holds under Rayleigh, Ricean and Nakagami fading models.
Second, to take the randomized caching model a step further, a spatially correlated content caching scenario is contemplated. Inspired by the Matérn hard-core point process of type II, which is a first-order pairwise interaction model, D2D nodes caching the same file are never closer to each other than the exclusion radius. The exclusion radius plays the role of a substitute for caching probability. The optimal exclusion radii that maximize the hit probability can be determined by using the request distribution and cache memory size. Unlike independent content placement, which is oblivious to the geographic locations of the nodes, the new strategy can be effective for proximity-based communication even when the cache size is small.
Third, an auction-aided Matérn carrier sense multiple access (CSMA) policy that considers the joint analysis of scheduling and caching is studied. The auction scheme is distributed. Given a cache configuration, i.e., the set of cached files in each user at a given snapshot, each D2D receiver determines the value of its request, by bidding on the set of potential transmitters in its communication range. The values of the receiver bids are reported to the potential transmitter, which computes the cumulated sum of these variables taken on all users in its cell. The potential transmitter then reports the value of the bid sum to other potential transmitters in its contention range. Given the accumulated bids of all potential transmitters, the contention range and the medium access probability, a fraction of the potential transmitters are jointly scheduled, determined by the auction policy, in order to optimize the throughput. Later, a Gibbs sampling-based cache update strategy is proposed to iteratively optimize the hit rate by taking the scheduling scheme into account.
In this dissertation, a variety of distributed algorithms for D2D content caching are proposed. Our results indicate that the geographic locality and the network parameters have a significant role in determining and optimizing the placement strategy. Exploiting the user interactions and spatial diversity, and incentivizing cooperation among D2D nodes are crucial in realizing the full potential of caching. Furthermore, from a network point of view, the scheduling and the caching phases are closely linked to each other. Hence, understanding the interaction between these two phases helps develop novel dynamic caching strategies capturing the temporal and spatial locality of the demand.Electrical and Computer Engineerin
Caching Policies for Delay Minimization in Small Cell Networks with Joint Transmissions
International audienceIn 5G and beyond network architectures, operators and content providers base their content distribution strategies on Heterogeneous Networks, where macro and small(er) cells are combined to offer better Quality of Service (QoS) to wireless users. On top of such networks, edge caching and Coordinated Multi-Point (CoMP) transmissions are used to further improve performance. The problem of optimally utilizing the cache space in dense and heterogeneous cell networks has been extensively studied under the name of "FemtoCaching." However, related literature usually assumes relatively simple physical layer (PHY) setups and known or stationary content popularity. In this paper, we address these issues by proposing a class of fully distributed and dynamic caching algorithms that take advantage of CoMP capabilities towards minimizing PHY-aware metrics, such as end-to-end (E2E) delay. Our policies outperform existing dynamic solutions that are PHY-unaware, under both synthetic and real (non-stationary) request processes, and converge to efficient centralized solutions, in static setups
- …