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

13th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

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

ISBN: (纸本)9781538647295

This paper proposes a novel popular services pushing and caching scheme by using converged overlay networks (CON). 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. Node-selecting and dynamic programming algorithm is adopted to maximize the equivalent throughput. Analytical and numerical results demonstrate that the proposed scheme is very effective.

关键词： Converged overlay networks distributed caching Offloading Popular services pushing and caching

来源：评论

学校读者我要写书评

暂无评论

Mobility-Embedded and Social-Aware distributed caching for D2D Content Sharing 9

Mobility-Embedded and Social-Aware Distributed Caching for D...

引用

9th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zhang, Wei Wu, Dan Chen, Xiaoming Qu, Junyue Cai, Yueming PLA Army Engn Univ Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9781538620625

It has attracted much attention recently that cache enabled users exploit device-to-device (D2D) communications to allow content sharing between them, resulting in higher spectral efficiency and lower energy consumption. However, due to the various interests of users, it is helpful for a user to cache the desired contents of its neighboring users by predicting their interests. Moreover, due to the mobility of users, content sharing becomes an opportunistic behavior. In this paper, considering the mobility and different interests of users, we propose a mobility-embedded and social-aware distributed caching scheme, where contents are divided into partitions and cached in the form of partition. We prove that the problem is a monotone submodular function over one matroid and multiple knapsack constraints and propose a greedy algorithm to solve it. Simulation results show that our scheme gains significant cache benefits.

关键词： D2D content sharing distributed caching mobility social relationship content partition

来源：评论

学校读者我要写书评

暂无评论

Multi-Level distributed caching on the Blockchain for Storage Optimisation 4

Multi-Level Distributed Caching on the Blockchain for Storag...

引用

4th IEEE International Conference on Blockchain and Cryptocurrency (IEEE ICBC)

作者： Heo, Jun Wook Dorri, All Jurdak, Raja Queensland Univ Technol Sch Comp Sci Brisbane Qld Australia

ISBN: (纸本)9781665495387

Blockchain has attracted considerable attention as a solution to the challenges of privacy, security and decentralisation for many applications. However, these characteristics of the blockchain result in ever growing ledger size, which is one of the major barriers to blockchain adoption in large-scale networks such as the Internet of Things (IoT). In this paper, we propose Multi-Level distributed caching (MLDC) for blockchain storage optimisation which reduces data replication based on data access pattern. MLDC divides nodes into storage classes (SCs) by their node availability, and assigns each SC a different Access Frequency (AF) to remove data from the local storage. Over time, each node only stores frequently accessed data, so MLDC can reduce the total storage cost by 83% compared to conventional blockchain systems, while maintaining blockchain consistency and data availability with a slight increase in network overhead and data query delay.

关键词： Blockchain Internet of Things (IoT) Storage optimisation distributed caching

来源：评论

学校读者我要写书评

暂无评论

Information Flow Graph for distributed caching without Newcomers over a Broadcast Medium 24

Information Flow Graph for Distributed Caching without Newco...

引用

24th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)

作者： Zimmermann, Sandra Schwenteck, Paul Meissner, Willi Vielhaus, Christian Cabrera, Juan A. Fitzek, Frank H. P. Reisslein, Martin Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Ctr Tactile Internet Human Loop CeTI Dresden Germany Arizona State Univ Elect Comp & Energy Engn Tempe AZ USA

ISBN: (纸本)9798350331653

The trade-offs between storage and repair traffic for replacing failed storage nodes with new nodes (newcomers) in data centers with an omniscient controller are well understood. However, in edge storage settings, newcomers are not readily available, necessitating resilient data storage (caching) without newcomers. Edge storage nodes can often communicate via a broadcast wireless medium, which can be exploited to reduce the transmitted repair traffic via network coding. Repairs for resilient distributed caching without newcomers over a broadcast medium with Random Linear Network Coding (RLNC), which does not require an omniscient controller, have not been previously studied. We develop an information-theoretic model to characterize the theoretically achievable trade-offs between stored data and transmitted repair data in the RLNC broadcast setting without newcomers. Specifically, we formulate an Information Flow Graph (IFG) model and identify all cuts in the resulting IFG. We validate the theoretical IFG model with simulations that demonstrate that the practically achievable trade-offs are close to the theoretical trade-offs.

关键词： Broadcast distributed caching Random Linear Network Coding (RLNC) Resilience

来源：评论

学校读者我要写书评

暂无评论

A distributed caching Approach for Improved Data Availability in Rural Wireless Mesh Networks

A Distributed Caching Approach for Improved Data Availabilit...

引用

International Conference on Computational Science and Computational Intelligence (CSIC)

作者： Ajayi, Ayomide Edwards, Christopher Roedig, Utz Univ Lancaster Sch Comp & Commun Infolab 21 Lancaster LA1 4WA England

ISBN: (纸本)9781509055104

The performance of wireless mesh networks (WMNs) deployed for Internet access in rural settings is affected by several factors. Typically, deployments in African domains use cheap and computationally constrained devices with challenges such as power fluctuations, gateway congestion, VSAT communications asymmetry and low bandwidth, which affects throughput under dynamic scenarios. caching methods can offer improvement for content availability to ensure a reliable quality of experience (QoE) for rural dwellers. Primarily, we integrate a modified multicast technique and overhearing for object caching and cache dissemination. We proposed a distributed Overheard-object caching Approach (DOCA) and evaluated the performance employing simulations. The outcome shows significant improvements over the random-path-cache-request (RPCR) strategy with increased data availability and reduced communication cost regarding response time for the outlined rural scenarios. Moreover, the optimization of gateway load helps to conserve network resources such as bandwidth and nodal energy considerably.

关键词： Data Availability Resource Conservation distributed caching Overhearing and Wireless Transmission

来源：评论

学校读者我要写书评

暂无评论

引用

22nd International Conference on Information Centric Networking

作者： Yoshida, Mikiya Ito, Yusuke Sato, Yurino Koga, Hiroyuki Univ Kitakyushu Kitakyushu Fukuoka Japan Sasebo Coll Natl Inst Technol Sasebo Japan

ISBN: (纸本)9781450392570

To realize low-latency content delivery in Information-Centric Networking, a scheme to cluster domains and retain popular content in each cluster has been proposed, which enables consumers to retrieve content from nearby clusters. However, when the distribution of content popularity changes, all caches of content may not be retained adequately in a cluster, so consumers could not retrieve them from nearby clusters. We therefore propose a dynamic clustering scheme to adjust the cluster size, according to the change of content popularity, considering cache utilization and delivery latency, and evaluated its effectiveness through simulation.

关键词： ICN distributed caching Dynamic Clustering

来源：评论

学校读者我要写书评

暂无评论

distributed caching in Device-to-Device Networks: A Stochastic Geometry Perspective

Distributed Caching in Device-to-Device Networks: A Stochast...

引用

Asilomar Conference on Signals, Systems and Computers

作者： Shankar Krishnan Harpreet S. Dhillon Wireless@VT Department of ECE Virginia Tech Blacksburg VA USA

ISBN: (纸本)9781467385770

Increasing spatio-temporal correlation in the data demand makes it attractive to cache popular content directly on the user devices so that it can be delivered on demand to the neighboring devices through device-to-device (D2D) communications. Due to the limited storage capacity, each device can only cache a part of the popular content resulting in a distributed caching network. With device locations modeled as a Poisson Point Process (PPP), we assume that the file of interest for a typical device is partitioned into several file portions with each device caching one of the portions randomly. Two equivalent viewpoints for the analysis of coverage probability and average delay in a distributed caching network are discussed for varying cache probabilities and device activity factors.

关键词： distributed caching D2D network Stochastic geometry Poisson point process Coverage probability Delay

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a Fully distributed caching Algorithm on an NDN System

Design and Implementation of a Fully Distributed Caching Alg...

引用

作者： Dowd, Abigail Texas A&M University

ICN (Information Centric Networking) is a new method of storing and accessing data on the internet which focuses on the content itself rather than the IP (Internet Protocol) address where the content is stored. ICN enables both in-network caching and name-based data retrieval. This allows for better usage of edge cloud resources, giving the user a faster response time as some data requests and services may be handled locally. NDN (Named Data Networking) is a specific type of ICN which locates and delivers content based on the associated data name rather than using the source or destination host addresses. For NDN to be most beneficial, we need to implement efficient caching algorithms that consider the needs of many users in a network. To address this need, we have developed a caching algorithm for an NDN network in a tree topology. It is fully distributed and makes storage and eviction decisions at each router based on the number of hops needed to retrieve the data and the popularity of the data at that router. The total number of hops taken by all data during the testing period determined the algorithm’s true cost. We tested our algorithm using an NDN testbed and compared its true cost with another commonly used algorithm, LRU (Least Recently Used), under the same conditions. Our cost-based policy incurred a lower true cost in all test cases, with average savings ranging from 9% to 19% depending on cache size and popularity distribution. The cost policy performed particularly well in comparison to LRU when the cache size was small.

关键词： named data networking NDN information-centric networking ICN caching distributed caching Thesis

来源：评论

学校读者我要写书评

暂无评论

Adaptive schemes for distributed web caching

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2005年第12期65卷 1483-1496页

作者： Bakiras, S Loukopoulos, T Papadias, D Ahmad, I Hong Kong Univ Sci & Technol Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA

In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maxinium benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual Configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy. (c) 2005 Elsevier Inc. All rights reserved.

关键词： distributed caching web proxies cache digests squid

来源：评论

学校读者我要写书评

暂无评论

distributed Cooperative caching in Unreliable Edge Environments 41

Distributed Cooperative Caching in Unreliable Edge Environme...

引用

41st IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Liu, Yu Mao, Yingling Shang, Xiaojun Liu, Zhenhua Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA

ISBN: (纸本)9781665458221

caching popular contents at the network edge is promising to reduce the retrieval latency, the network congestion, and the number of requests to the remote content provider during peak hours. In general, edge caching resource is costly and highly limited. Nevertheless, it is possible to provide cost-effective caching services using unreliable resources, which are resources reserved for other applications but have not been fully used or resources on vulnerable servers. In this paper, we consider the problem of caching popular contents over unreliable resources as a less expensive solution to limited edge caching capacity. In particular, to address the unreliability of edge resources, erasure coding is leveraged to increase the availability of cached contents. We formulate the problem as a discrete optimization problem and prove it is NP-hard. We start with two special cases of the problem and provide optimal algorithms for them. We then design an algorithm for the general version of the proposed problem and provide a provable performance guarantee. Real-world data-driven simulations demonstrate that the proposed algorithms significantly outperform popular baselines, and the rewards for the general version of the problem are near-optimal.

关键词： Edge caching Unreliable Edge Resources distributed caching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：