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

distributed caching in Wireless Cellular Networks Incorporating Parallel Processing

IEEE INTERNET COMPUTING 2018年第1期22卷 52-61页

作者： Sun, Yue Zhu, Ziming Fan, Zhong China Telecom Beijing Peoples R China Toshiba Res Europe Cambridge England Keele Univ Keele Staffs England

distributed caching is a promising technique for reducing redundant data traffic and user content access delay in telecommunications systems. This article explores caching technologies with a focus on the processing of content requests in today's hierarchical wireless cellular networks. The authors observed that, as the number of caches at different layers of the network increases, the disadvantage of the hierarchical architecture in terms of processing delay gradually emerges. They introduce a parallel-processing strategy in order to improve the efficiency of cache servers. Theoretical analysis and numerical simulations show the potential of the proposed scheme in terms of reducing both the content access delay and redundant data traffic in the core network. The authors also carry out cost assessments for the proposed scheme. Future research on related technologies is discussed at the end of this article.

关键词： Cache Storage Cellular Radio Mobile Computing Parallel Processing Telecommunication Traffic distributed caching Redundant Data Traffic User Content Access Delay Telecommunications Systems caching Technologies Content Requests Hierarchical Architecture Processing Delay Parallel Processing Strategy Cache Servers Hierarchical Wireless Cellular Networks Cache Memory distributed Computing Internet Parallel Processing Wireless Communication Cellular Networks Computer Architecture distributed caching Content Access Delay Parallel Processing Networks

来源：评论

学校读者我要写书评

暂无评论

distributed caching Algorithms in the Realm of Layered Video Streaming

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2019年第4期18卷 757-770页

作者： Poularaki, Konstantinos Iosifidis, George Argyriou, Antonios Koutsopoulos, Iordanis Tassiulas, Leandros Yale Univ Dept Elect Engn Yale Inst Network Sci New Haven CT 06520 USA Trinity Coll Dublin Sch Comp Sci & Stat Dublin 2 Ireland Univ Thessaly Dept Elect & Comp Engn Filellinon 38221 Volos Greece Athens Univ Econ & Business Dept Informat Athina 10434 Greece

distributed caching architectures have been proposed for bringing content close to requesters, and the key problem is to design caching algorithms for reducing content delivery delay, which determines to an extent the user Quality of Experience (QoE). This problem obtains an interesting new twist with the advent of advanced layered-video encoding techniques such as Scalable Video Coding. In this paper, we show that the problem of finding the caching configuration of video encoding layers that minimizes delivery delay for a network operator is NP-Hard, and we establish a pseudopolynomial-time optimal solution by using a connection with the multiple-choice knapsack problem. Next, we design caching algorithms for multiple network operators that cooperate by pooling together their co-located caches, in an effort to aid each other, so as to avoid large delays due to fetching content from distant servers. We derive an approximate solution to this cooperative caching problem by using a technique that partitions the cache capacity into amounts dedicated to own and other operators' caching needs. Trace-driven evaluations demonstrate up to 25 percent reduction in delay over existing caching schemes. As a side benefit, our algorithms achieve smoother playback for video streaming applications, with fewer playback stalls and higher decoded quality.

关键词： distributed caching cooperation layered-video encoding

来源：评论

学校读者我要写书评

暂无评论

distributed caching in information-centric cellular networks with full duplex communication

引用

IET COMMUNICATIONS 2019年第2期13卷 223-231页

作者： Liu, Ming Mao, Yuming Leng, Supeng Univ Elect Sci & Technol China Sch Informat & Commun Engn Xiyuan Ave Chengdu Sichuan Peoples R China

Current approaches to information-centric network (ICN) implementation employ the edge storage of network infrastructures to minimise the latency of information retrieval. However, the edge storage of infrastructures is finite. distributed content caching assisted by mobile devices becomes a potential solution to content publishing services. Nevertheless, under the conventional half-duplex-based ICN, extra memory is occupied and the delay is increased. Fortunately, full duplex (FD) communications can improve the spectrum efficiency of wireless networks, and reduce the access delay by more flexible content caching. In this study, the authors propose a novel FD-based ICN (FD-ICN) framework, where content caching is not only implemented in network infrastructures but also in mobile devices. Content cached by mobile devices can be delivered in a FD amplify and forward way without extra BS memory occupation and delay. To maximise the network utility of the FD-ICN, they formulate the caching strategy and FD radio resource allocation as a joint optimisation problem. A joint caching strategy and FD radio resource allocation algorithm are proposed. Simulation results show their FD-ICN framework can achieve superior system utility compared to the conventional ICN. Moreover, the proposed algorithm exhibits higher utility with similar converge rate compared to the heuristic algorithm.

关键词： cellular radio cache storage Internet optimisation resource allocation amplify and forward communication multiplexing distributed caching information-centric cellular networks information-centric network implementation information retrieval distributed content caching mobile devices content publishing services conventional half-duplex base station wireless networks flexible content caching network infrastructures network utility joint caching strategy FD radio resource allocation algorithm full duplex communication ICNFD-ICN framework half-duplex-based ICN access delay reduction FD amplify and forward

来源：评论

学校读者我要写书评

暂无评论

distributed caching with centralized control

引用

COMPUTER COMMUNICATIONS 2001年第2期24卷 256-268页

作者： Paul, S Fei, Z Edgix Corp New York NY 10036 USA Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

The benefits of using caches for reducing traffic in backbone trunk links and for improving web access times are well-known. However, there are some known problems with traditional web caching, namely,maintaining freshness of web objects, balancing load among a number of caches and providing protection against cache failure. This paper investigates in detail the advantages and disadvantages of a distributed architecture of caches which are coordinated through a central controller. In particular, the performance of a set of independent caches is compared against the performance of a set of coordinated distributed caches using extensive simulation. The conclusion is that a distributed architecture of coordinated caches consistently provides a better hit ratio, improves response time, provides better freshness, achieves load balancing, and increases the overall traffic handling capacity of a network while paying a small price in terms of additional control traffic. In particular, we have observed up to 40% improvement in hit ratio, 70% improvement in response time, 60% improvement in freshness and 25% improvement in traffic handling capacity of a network with caches. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： centralized control hit ratio traffic on backbone distributed caching

来源：评论

学校读者我要写书评

暂无评论

distributed caching in Converged Networks: A Deep Reinforcement Learning Approach

引用

IEEE TRANSACTIONS ON BROADCASTING 2021年第1期67卷 201-211页

作者： Xiong, Jian Fang, Yuzhe Cheng, Peng Shi, Zhiping Zhang, Wei Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Natl Key Lab Sci & Technol Commun Shanghai 200240 Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China

Content caching is an effective technique to alleviate the burden on backhaul links and reduce the traffic in cellular networks. In converged networks, broadcasting networks can push non-real-time popular services to different types of terminals during off-peak hours, while cellular networks are deployed to meet personalized needs. However, the storage capacity of terminals are usually limited. In this context, we study on the converged networks to push and cache the popular services in the router nodes close to the terminators. In this scheme, the most popular services are transmitted by the broadcasting base station and cached in the router nodes in a distributed cache network. Then, users can access the cached services in a more energy efficient manner. Due to the limited storage capacity of the router node, we assume that the user can access the cached services within two hops. Then, we formulate the service scheduling problem as a Markov Decision Process, aiming to maximize equivalent throughput (ET). Due to the large state space involved in the distributed cache network, it is quite challenging to obtain a tractable solution by the classical optimization algorithms. To handle this problem, a deep reinforcement learning based framework is proposed to tackle this problem. The simulation results show that the proposed algorithms are very effective;and they outperform the conventional one in term of the ET, especially when the users in the network subject to Poisson point process distribution.

关键词： Reinforcement learning Throughput Base stations Broadcasting Optimization Cellular networks Wireless networks Converged networks distributed caching reinforcement learning traffic offloading

来源：评论

学校读者我要写书评

暂无评论

distributed caching over heterogeneous mobile networks

引用

QUEUEING SYSTEMS 2012年第3-4期72卷 279-309页

作者： Ioannidis, Stratis Massoulie, Laurent Chaintreau, Augustin Technicolor Palo Alto CA USA Technicolor Paris France Columbia Univ New York NY USA

Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is typically limited;therefore, identifying which content a user should store in her cache is a fundamental problem in the operation of any such content distribution system. In this work we propose Psephos, a novel mechanism for determining the caching policy of each mobile user. Psephos is fully distributed: users compute their own policies individually, in the absence of a central authority. Moreover, it is designed for a heterogeneous environment, in which demand for content, access to resources, and mobility characteristics may vary across different users. Most importantly, the caching policies computed by our mechanism are optimal: we show that Psephos maximizes the system's social welfare. To the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner.

关键词： distributed caching Heterogeneity Mobile networks Content distribution

来源：评论

学校读者我要写书评

暂无评论

distributed caching Enabled Peak Traffic Reduction in Ultra-Dense IoT Networks

引用

IEEE COMMUNICATIONS LETTERS 2018年第6期22卷 1252-1255页

作者： Sharma, Shree Krishna Wang, Xianbin Western Univ Dept Elect & Comp Engn London ON N6A 5B9 Canada

The proliferation of massive machine-type communications devices and their random and intermittent transmissions have brought the new challenge of sporadic access-network congestion in ultra-dense Internet of Things (IoT) networks. To address this issue, we propose an innovative approach of peak traffic reduction within the access network by utilizing distributed cache of IoT devices to coordinate their sporadic transmissions. The proposed technique is realized by employing a novel uplink transmission scheduling based on delay adaptation, in which distributed IoT devices adjust their transmission timings by utilizing embedded caching. An optimization problem is formulated for the minimization of peak data rate demand subject to delay tolerance levels, and is solved for the 3GPP-based traffic models by employing a gradient descent-based algorithm. Our results show that the proposed scheme can significantly reduce the peak data traffic in ultra-dense IoT networks.

关键词： distributed caching peak traffic transmission scheduling delay adaptation ultra-dense IoT MTC

来源：评论

学校读者我要写书评

暂无评论

distributed caching Mechanism for Popular Services Distribution in Converged Overlay Networks

引用

IEEE TRANSACTIONS ON BROADCASTING 2020年第1期66卷 66-77页

作者： Zhang, Wei Xiong, Jian Gui, Lin Liu, Bo Qiu, Meikang Shi, Zhiping Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China La Trobe Univ Dept Engn Bundoora Vic 3086 Australia Columbia Univ Dept Elect Engn New York NY 10027 USA Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China

With the proliferation of portable devices, the exponential growth of the global mobile traffic brings great challenges to the traditional communication networks and the traditional wireless communication technologies. In this context, converged networks and cache-based data offloading have drawn more and more attention based on the strong correlation of services. This paper proposes a novel popular services pushing and caching scheme by using converged overlay networks. The most popular services are pushed by terrestrial broadcasting networks. And they are cached in ${n}$ router-nodes with limited cache sizes. Each router-node only interconnects with its neighbor nodes. Users are served through the router's WiFi link. If the services requested are cached in the routers, the user can be immediately responded;otherwise, the requests can be responded through the link from cellular stations to the router. In the proposed scheme, the cache size of the router, the maximum number of requests each router can serve, and the whole-time delay are limited. Three node-selecting and dynamic programming algorithms are adopted to maximize the equivalent throughput. Analytical and numerical results demonstrate that the proposed scheme is very effective.

关键词： Wireless fidelity Wireless communication Overlay networks Heuristic algorithms Broadcasting Cellular networks Relays Converged overlay networks distributed caching offloading popular services pushing and caching

来源：评论

学校读者我要写书评

暂无评论

distributed caching in 5G Networks: An Alternating Direction Method of Multipliers Approach 16

Distributed Caching in 5<i>G</i> Networks: An Alternating Di...

引用

16th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Abboud, Azary Bastug, Ejder Hamidouche, Kenza Debbah, Merouane Supelec Large Networks & Syst Grp LANEAS F-91192 Gif Sur Yvette France Supelec Automat & Control Dept F-91192 Gif Sur Yvette France Huawei France R&D Math & Algorithm Sci Lab Paris France

ISBN: (纸本)9781479919314

We consider the problem of distributed caching in next generation mobile cellular networks (a.k.a., 5G) where densely-deployed small base stations (SBSs) are able to store and deliver users' content accordingly. In particular, we formulate the optimal cache allocation policy as a convex optimization problem where a subset of SBSs have their own i) local cost function which captures backhaul consumption aspects in terms of bandwidth and i i) a set of local network parameters and storage constraints. Given the fact that no coordination involves between SBSs, we then solve this problem distributively using the Alternating Direction Method of Multipliers (ADMM) approach. The proposed ADMM-based algorithm relies on the application of random Gauss-Seidel iterations on the Douglas-Rachford splitting operator, which results in a low-complexity and easy-to-implement solution for SBSs. We examine the convergence of our proposed algorithm via numerical simulations with different parameters of interest such as storage capacity distribution of SBSs, content catalogue size, demand intensity and demand shape. Our numerical results show that the proposed algorithm performs well in terms of convergence and requires less iterations as the number of contents in the catalogue increases.

关键词： 5G distributed caching optimal cache allocation ADMM distributed convex optimization wireless networks

来源：评论

学校读者我要写书评

暂无评论

distributed caching strategy

Distributed caching strategy

引用

Conference on Intelligent Computing - Theory and Applications VI

作者： Kim, Keum J. Santos, Eunice E. Santos, Eugene, Jr. Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA Virginia Polytech Inst & State Univ Comp Sci Dept Blacksburg VA 24061 USA

ISBN: (纸本)9780819471529

When compared to biological experiments, using computational protein models can save time and effort in identifying native conformations of proteins. Nonetheless, given the sheer size of the conformation space, identifying the native conformation remains a computationally hard problem - even in simplified models such as hydrophobic-hydrophilic (HP) models. distributed systems have become the focus of protein folding, providing high performance computing power to accommodate the conformation space. To use a distributed system efficiently (with limited resources), an appropriate strategy should be designed accordingly. Communication incurs overhead but can provide useful information in distributed systems through careful consideration. Our study focuses on understanding the behavior of distributed systems and developing an efficient communication strategy to save computational effort in order to obtain good solutions. In this paper, we propose a distributed caching strategy, which reuses partial results of computations and transmits the cached and reusable information among neighboring inter-connected processors. In order to validate this idea in a practical setting, we present algorithms to retrieve and restore the cached information and apply them to 2D triangular HP lattice models through coarse-grained parallel genetic algorithms (CPGAs). Our experimental results demonstrate the time savings as well as the limits in caching improvements for our distributed caching strategy.

关键词： protein folding triangular lattice HP model caching stochastic methods distributed systems parallel evolutionary algorithms coarse-grained parallel genetic algorithms migration distributed caching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：