检索结果-内蒙古大学图书馆

Real-time stock transaction data distribution mechanism based on distributed network caching

INTERNET TECHNOLOGY LETTERS 2021年第1期4卷

作者： Bai, Wenjing Jilin Agr Sci & Technol Sch Econ & Management Jilin Jilin Peoples R China Jilin Econ & Technol Dev Zone Jilin Jilin Peoples R China

Stock transaction data transmission has extremely strong requirements for real-time transmission. However, the volume of stock trading data continues to increase. The traditional end-to-end transmission mechanism has become difficult to meet the real-time requirements of stock trading. In this paper, we propose an efficient stock transaction data transmission mechanism based on distributed network caching. By introducing elastic storage space at the edge, enabling intelligent transaction data push in the cloud, and introducing passive caching at the client, it effectively solves the real-time requirement of stock transaction data transmission.

关键词： distributed caching edge computing realtime transmission smart city stock transaction

来源：评论

学校读者我要写书评

暂无评论

GCache: Neighborhood-Guided Graph caching in a distributed Environment

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2019年第11期30卷 2463-2477页

作者： Yuan, Ye Lian, Xiang Chen, Lei Wang, Guoren Yu, Jeffrey Xu Wang, Yishu Ma, Yuliang Beijing Inst Technol Sch Comp Sci & Technol Beijing 100091 Peoples R China Kent State Univ Dept Comp Sci Kent OH 44242 USA HKUST CSE Hong Kong Peoples R China Chinese Univ Hong Kong Syst Engn & Engn Management Hong Kong Peoples R China Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China

distributed graph systems are becoming extremely popular due to their flexibility, scalability, and robustness in big graph processing. In order to improve the performance of the distributed graph systems, caching is a very effective technique to achieve fast response and reduce the communication cost. Existing works include online and offline caching algorithms. Online caching algorithms (such as least recently used (LRU) and most recently used (MRU)) are lightweight and flexible, however, neglect the topological properties of big graphs. Offline caching algorithms (such as node pre-ordered) consider the graph topology, but are very expensive and heavy. In this paper, we propose a novel caching mechanism, GraphCache (GCache), for big distributed graphs. GCache consists of an offline phase and an online phase, which inherits the advantages of online and offline caching algorithms. Specifically, the offline phase provides a caching model based on the bipartite graph clustering and give efficient algorithms to solve it. The online phase caches and schedules the graph clusters output from the offline phase, based on the LRU and MRU strategies. GCache can be seamlessly integrated into the state-of-the-art graph processing systems, e.g., Giraph. Finally, our experimental results demonstrate the feasibility of our proposed caching techniques in speeding up graph algorithms over distributed big graphs.

关键词： Clustering algorithms Computational modeling Bipartite graph Schedules Partitioning algorithms Scalability Robustness distributed caching large graph

来源：评论

学校读者我要写书评

暂无评论

Spectrum Efficiency Maximization Using Primal-Dual Adaptive Algorithm for distributed Mobile Devices caching Over Edge Computing Networks 51

Spectrum Efficiency Maximization Using Primal-Dual Adaptive ...

引用

51st Annual Conference on Information Sciences and Systems (CISS)

作者： Zhang, Xi Zhu, Qixuan Texas A&M Univ Dept Elect & Comp Engn Networking & Informat Syst Lab College Stn TX 77843 USA

ISBN: (纸本)9781509047802

The information-centric network techniques enable the in-network caching mechanism to cache the popular data contents in the mobile devices. Even though each mobile device's caching memory can be limited, caching in mobile devices offers the great potential of caching capability because of the massive mobile devices. Using caching in mobile devices, a mobile user can obtain its requested files from other mobile users through device-to-device (D2D) communication instead of the remote data-source provider, which significantly reduces the duplicate data traffics in the core network and through base stations. In this paper, we use the distributed mobile devices caching, where we randomly distribute and store the popular data contents in mobile devices of a cellular network. To avoid the interference among D2D communications, we partition the entire wireless cell into several squarelets and only activate the D2D connections within each squarelet. Then, we derive the expected number of mobile users in a squarelet and develop a primal-dual adaptive algorithm to maximize the overall spectrum efficiency for these mobile users with unknown wireless channel conditions. To evaluate the performance of our proposed adaptive algorithm, we compare our obtained spectrum efficiency with the spectrum efficiency under the optimal situation where all wireless channel conditions are given. Our proposed algorithm can guarantee the smallest ratio for the obtained spectrum efficiency under these two situations, showing the performance lower bound of our proposed adaptive algorithm.

关键词： distributed caching device-to-device (D2D) communication information-centric networks spectrum efficiency maximization primal-dual adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

A survey on deploying mobile deep learning applications:A systemic and technical perspective

引用

Digital Communications and Networks 2022年第1期8卷 1-17页

作者： Yingchun Wang Jingyi Wang Weizhan Zhang Yufeng Zhan Song Guo Qinghua Zheng Xuanyu Wang a MOEKLINNS Lab School of Computer Science and TechnologyXi'an Jiaotong UniversityShaanxi710049China Department of Computing The Hong Kong Polytechnic UniversityHK999077China

With the rapid development of mobile devices and deep learning,mobile smart applications using deep learning technology have sprung *** satisfies multiple needs of users,network operators and service providers,and rapidly becomes a main research *** recent years,deep learning has achieved tremendous success in image processing,natural language processing,language analysis and other research *** the task performance has been greatly improved,the resources required to run these models have increased *** poses a major challenge for deploying such applications on resource-restricted mobile *** intelligence needs faster mobile processors,more storage space,smaller but more accurate models,and even the assistance of other network *** help the readers establish a global concept of the entire research direction concisely,we classify the latest works in this field into two categories,which are local optimization on mobile devices and distributed optimization based on the computational position of machine learning *** also list a few typical scenarios to make readers realize the importance and indispensability of mobile deep learning ***,we conjecture what the future may hold for deploying deep learning applications on mobile devices research,which may help to stimulate new ideas.

关键词： Deep learning Mobile computing distributed offloading distributed caching

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Matching With Peer Effect for Low-Latency and High-Reliable caching in Social IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第1期6卷 1193-1209页

作者： Wang, Bowen Sun, Yanjing Li, Song Cao, Qi China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Jiangsu Peoples R China

The Internet of Things (IoT) is expected to bring great benefits to users, operators, and manufactures in different application scenarios. Given that smart objects which can exploit their own social networks and share contents via device-to-device (D2D) communications, the combined social IoT promises to collect information as well as to provide services more efficiently. This application scenario requires lower latency and higher reliability, and then we adopt D2D-based caching to reduce the downloading latency while guaranteeing the reliable delivery. To achieve this joint optimization objective, we conceive the interdependence with the framework of hierarchical bipartite graph. In this way, this combinatorial problem can be decoupled into a content sharing problem and a resource allocation problem. To solve the first one, we propose a content sharing-oriented matching algorithm with projecting social characters onto physical links. To solve the second one, we formulate this resource allocation problem as equivalent to a many-to-one matching game with peer effect. We then design a novel distributed algorithm with rotation-swap, which can converge to a stable state with limited number of iterations. Formulating the convergence procedure as another NP-hard problem, we further design a coloring-based heuristic algorithm to find a near-optimal solution. We conduct extensive simulations to demonstrate that our proposed schemes can achieve a better tradeoff between performance and complexity than other benchmarks.

关键词： Device-to-device (D2D) communications distributed caching hierarchical stable matching peer effect social Internet of Things (IoT)

来源：评论

学校读者我要写书评

暂无评论

Partial video sequence caching scheme for VOD systems with heterogeneous clients

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 1998年第1期45卷 44-51页

作者： Chiu, MYM Yeung, KHA City Univ Hong Kong Yau Yat Chen Peoples R China

Video on demand (VOD) is one of the keg applications in the information era, A hinge factor to its widespread use is the huge bandwidth required to transmit digitized video to a large group of clients with widely varying requirements, This paper addresses issues of heterogeneous clients bg proposing a program caching scheme called the partial video sequence (PVS) caching scheme. The PVS caching scheme decomposes video sequences into a number of parts by using a scalable video compression algorithm, Video parts are selected to be cached in local video servers based on the amount of bandwidth that mould be demanded from the distribution network and central video server if it was only kept in the central video server, In this paper, we also show that the PVS caching scheme is suitable for handling vastly varying client requirements.

关键词： distributed caching heterogeneous clients image transmission information retrieval multimedia communications video on demand

来源：评论

学校读者我要写书评

暂无评论

Optimizing Content caching to Maximize the Density of Successful Receptions in Device-to-Device Networking

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第10期64卷 4365-4380页

作者： Malak, Derya Al-Shalash, Mazin Andrews, Jeffrey G. Univ Texas Austin WNCG Austin TX 78701 USA Huawei Technol Plano TX 75075 USA

Device-to-device (D2D) communication is a promising approach to optimize the utilization of air interface resources in 5G networks, since it allows decentralized opportunistic short-range communication. For D2D to be useful, mobile nodes must possess content that other mobiles want. Thus, intelligent caching techniques are essential for D2D. In this paper, we use results from stochastic geometry to derive the probability of successful content delivery in the presence of interference and noise. We employ a general transmission strategy, where multiple files are cached at the users and different files can be transmitted simultaneously throughout the network. We then formulate an optimization problem, and find the caching distribution that maximizes the density of successful receptions (DSR) under a simple transmission strategy, where a single file is transmitted at a time throughout the network. We model file requests by a Zipf distribution with exponent gamma(r), which results in an optimal caching distribution that is also a Zipf distribution with exponent gamma(c), which is related to gamma(r) through a simple expression involving the path loss exponent. We solve the optimal content placement problem for more general demand profiles under Rayleigh, Ricean, and Nakagami small-scale fading distributions. Our results suggest that it is required to flatten the request distribution to optimize the caching performance. We also develop strategies to optimize content caching for the more general case with multiple files, and bound the DSR for that scenario.

关键词： distributed caching device-to-device communications content distribution coverage stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

Large scale multiple sequence alignment with simultaneous phylogeny inference

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2006年第12期66卷 1534-1545页

作者： Parmentier, Gilles Trystram, Denis Zola, Jaroslaw Lab ID IMAG F-38330 Montbonnot St Martin France Ecole Normale Super Lyon Lab LBMC F-69364 Lyon 07 France

Multiple sequence alignment (MSA) and phylogenetic tree reconstruction are one of the most important problems in the computational biology. While both these problems are of great practical significance, in most cases they are very computationally demanding. In this paper we propose a new approach to the MSA problem which simultaneously infers an underlying phylogenetic tree. To process large data sets we provide parallel implementation of our method, which is based on the distributed caching of intermediate results. Finally, we show a parallel server designed for grid environments, and we report results of experiments performed with actual biological data, e.g. 1000 ribosomal RNA sequences. (C) 2006 Elsevier Inc. All rights reserved.

关键词： multiple sequence alignment phylogenctic tree parallel processing distributed caching

来源：评论

学校读者我要写书评

暂无评论

Private Information Retrieval From a Cellular Network With caching at the Edge

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2019年第7期67卷 4900-4912页

作者： Kumar, Siddhartha Graell i Amat, Alexandre Rosnes, Eirik Senigagliesi, Linda Simula UiB N-5020 Bergen Norway Chalmers Univ Technol Dept Elect Engn SE-41296 Gothenburg Sweden Univ Politecn Marche Dipartimento Ingn Informaz I-60131 Ancona Italy

We consider the problem of downloading content from a cellular network that is cached at the wireless edge while achieving privacy. In particular, we consider private information retrieval (PIR) of content from a library of files, i.e., the user wishes to download a file and does not want the network to learn any information about which file she is interested in. To reduce the backhaul usage, content is cached at the wireless edge in a number of small-cell base stations (SBSs) using maximum distance separable codes. We propose a PIR scheme based on generalized Reed-Solomon codes for this scenario that achieves privacy against a number of spy SBSs that collaborate. The proposed PIR scheme is an extension of a scheme by Kumar et al. to the case of multiple code rates, suitable for the scenario where files have different popularities. We derive the backhaul rate and optimize the content placement to minimize it. We prove that uniform content placement is optimal, i.e., all files that are cached should be stored using the same code rate. This is in contrast to the case where no PIR is required. Furthermore, we show numerically that popular content placement is optimal for some scenarios.

关键词： Colluding servers distributed caching generalized Reed-Solomon codes private information retrieval subcodes

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2018年第1期17卷 56-70页

作者： Malak, Derya Al-Shalash, Mazin Andrews, Jeffrey G. Univ Texas Austin Wireless Networking & Commun Grp Austin TX 78701 USA MIT Res Lab Elect Cambridge MA 02139 USA Huawei Technol Plano TX 75075 USA Univ Texas Austin Wireless Networking & Commun Grp Austin TX 78701 USA

We study optimal geographic content placement for device-to-device (D2D) networks in which each file's popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process and have limited communication range and finite storage. Inspired by the Matern hard-core (type II) point process that captures pairwise interactions between nodes, we devise a novel spatially correlated caching strategy called hard-core placement (HCP) such that the 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. We derive and optimize the exclusion radii to maximize the hit probability, which is the probability that a given D2D node can find a desired file at another node's cache within its communication range. Contrasting it with independent content placement, which is used in most prior work, our HCP strategy often yields a significantly higher cache hit probability. We further demonstrate that the HCP strategy is effective for small cache sizes and a small communication radius, which are likely conditions for D2D.

关键词： distributed caching device-to-device communications hard-core placement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：