Mobility-aware coded caching in D2D communication networks

In this paper, we consider a cache-enable device-to-device (D2D) communication network with user mobility and design a mobility-aware coded caching scheme to exploit multicasting opportunities for reducing network traffic. In addition to the static cache memory that can be used to reap coded caching gains, we assign a dynamic cache memory to mobile users such that users who never meet can still exchange contents via relaying. We consider content exchange as an information flow among dynamic cache memories of mobile users and leverage network coding to reduce network traffic. Specifically, we transfer our storage and broadcast problem into a network coding problem. By solving the formulated network coding problem, we obtain a dynamic content replacement and broadcast strategy. Numerical results verify that our algorithm significantly outperforms the random and greedy algorithms in terms of the amount of broadcasting data, and the standard Ford–Fulkerson algorithm in terms of the successful decoding ratio.     

Asymptotic optimality of the static frequency caching in the presence of correlated requests

It is well known that the static caching algorithm that keeps the most frequently requested documents in the cache is optimal in case when documents are of the same size and requests are independent and identically distributed. However, it is hard to develop explicit and provably optimal caching algorithms when requests are statistically correlated. In this paper, we show that keeping the most frequently requested documents in the cache is still optimal for large cache sizes even if the requests are strongly correlated.     

土地监察移动数据库技术及其应用

近年来,基于移动数据库的移动GIS技术发展呈加速趋势,并在越来越多领域的应用中取得成功.在土地监察工作中采用移动GIS手段,有利于实现实时、快速执行土地违法勘察、执法动态监察等工作,为建立完善的土地管理长效机制提供技术支持,保障人民群众的利益和社会的稳定.本文先介绍移动数据库的原理和架构,然后结合土地监察实际需求,重点探讨移动数据库在土地监察中需要解决的数据同步、数据复制与缓存和数据安全存储等关键技术问题.     

基于层次简化的三维场景快速绘制方法

实时三维场景快速绘制是实现漫游和仿真的基础,提出了一种基于分层简化和碰撞检测的快速渲染算法．该算法先采用八叉树的分层简化三维场景模型,然后用包围盒实现视景的实时碰撞检测,最后采用基于场景剔除的图像缓存技术．从实验结果分析,此方法在效率和显示效果上是可行的．     

UAV caching in 6G networks: A Survey on models,techniques, and applications

The rapid development road map of 6G networks has posed a new set of challenges to both industrial and academic sectors. On the one hand, it needs more disruptive technologies and solutions for addressing the threefold issues including enhanced mobile broadband, massive machine-type communications, and ultra-reliable and low-latency communications. On the other hand, the ever-massive number of mobile users and Internet of Things devices conveys the huge volume of traffic throughout the 6G networks. In this context, caching is one of the most feasible technologies and solutions that does not require any system architecture changes nor costly investments, while significantly improve the system performance, i.e., quality of service and resource efficiency. Ground caching models deployed at macro base stations, small-cell base stations, and mobile devices have been successfully studied and currently extended to the air done by unmanned aerial vehicles (UAVs) to deal with the challenges of 6G networks. This paper provides a comprehensive survey of UAV caching models, techniques, and applications in 6G networks. In particular, we first investigate the entire picture of caching models moving from the ground to the air as well as the related surveys on UAV communications. Then, we introduce a typical UAV caching system and describe how it works in connection with all types of the transceivers, end users, and applications and services (A&Ss). After that, we present the recent advancements and analyses of the UAV caching models and common system performance metrics. Furthermore, the UAV caching with assisted techniques, UAV caching-enabled mechanisms, and UAV caching A&Ss are discussed to demonstrate the role of UAV caching system in 6G networks. Finally, we highlight the ongoing challenges and potential research directions toward UAV caching in 6G networks.     

An Umbrella Converse for Data Exchange: Applied to Caching,Computing, and Shuffling

The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Shuffling, Coded Computing, etc. The goal in such problems is to design communication schemes which accomplish the desired data exchange between the nodes with the optimal (minimum) amount of communication load. In this work, we present a converse to such a general data exchange problem. The expression of the converse depends only on the number of bits to be moved between different subsets of nodes, and does not assume anything further specific about the parameters in the problem. Specific problem formulations, such as those in Coded Caching, Coded Data Shuffling, and Coded Distributed Computing, can be seen as instances of this generic data exchange problem. Applying our generic converse, we can efficiently recover known important converses in these formulations. Further, for a generic coded caching problem with heterogeneous cache sizes at the clients with or without a central server, we obtain a new general converse, which subsumes some existing results. Finally we relate a “centralized” version of our bound to the known generalized independence number bound in index coding and discuss our bound’s tightness in this context.     

The persistent‐access‐caching algorithm

Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching systems is designing document placement/replacement algorithms for updating the collection of cached documents. The main design objectives of such a policy are the high cache hit ratio, ease of implementation, low complexity and adaptability to the fluctuations in access patterns. These objectives are essentially satisfied by the widely used heuristic called the least‐recently‐used (LRU) cache replacement rule. However, in the context of the independent reference model, the LRU policy can significantly underperform the optimal least‐frequently‐used (LFU) algorithm that, on the other hand, has higher implementation complexity and lower adaptability to changes in access frequencies. To alleviate this problem, we introduce a new LRU‐based rule, termed the persistent‐access‐caching (PAC), which essentially preserves all of the desirable attributes of the LRU scheme. For this new heuristic, under the independent reference model and generalized Zipf's law request probabilities, we prove that, for large cache sizes, its performance is arbitrarily close to the optimal LFU algorithm. Furthermore, this near‐optimality of the PAC algorithm is achieved at the expense of a negligible additional complexity for large cache sizes when compared to the ordinary LRU policy, since the PAC algorithm makes the replacement decisions based on the references collected during the preceding interval of fixed length. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Predicting Web Users' Next Access Based on Log Data

This article considers models that describe how people browse the Web. We restrict our attention to navigation patterns within a single site, and base our study on standard Web server access logs. Given a visitor's previous activities on the site, we propose models that predict their next page request. If the prediction is reasonably accurate, we might consider “prefetching” the page before the visitor requests it. A more conservative use for such predictions would be to simply update the freshness records in a proxy or network cache, eliminating unnecessary If-Modified-Since requests. Using data from the Web site for the Computing and Mathematical Sciences Research Division of Lucent Technologies (cm.bell-labs.com) we first evaluate the predictive performance of low-order Markov models. We next consider mixtures of first-order Markov models, achieving a kind of clustering of Web pages in the site. This approach is shown to perform well, while significantly reducing the space required to store the model. Finally, we explore a Bayesian approach using a Dirichlet prior on the collection of links available to a user at each stage in their travels through the site. We show that the posterior probabilities derived under this model are fairly close to the cross-validation estimates of the probability of success.     

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

We consider the least‐recently‐used cache replacement rule with a Zipf‐type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independent‐request model and then extend this derivation to a general dependent‐request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous‐time proof was given through some assumptions based on a continuous‐time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete‐time basis; thus, it is preferable to make assumptions, if any, directly in the discrete‐time setting. We consider a general dependent‐request model and give a direct discrete‐time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

基于FPGA高速数据采集与存储系统的设计

对高速数据采集系统进行了研究,基于其采集速率的问题,提出了一种基于FPGA的高速数据采集系统。利用FPGA实现对12bit的A/D转换器ADC12D800的控制,使用其1.6Gsps双沿采样工作模式完成对400MHz以下高频信号的数据采集。通过设计数据存储方式来降低数据传输速率,使数据经USB传至PC机来实现高频信号地实时采集与存储。实验结果表明它可以实时、高效地完成数据采集,可以应用到雷达、通信、电子对抗等领域。