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

Bandwidth Slicing for Socially-Aware D2D caching in SDN-Enabled Networks

IEEE ACCESS 2018年 6卷 50910-50926页

作者： Wang, Bowen Sun, Yanjing Cao, Qi Li, Song Sun, Zhi China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Jiangsu Peoples R China Xian Univ Sci & Technol Sch Commun & Informat Engn Xian 710054 Shaanxi Peoples R China SUNY Buffalo Dept Elect Engn Buffalo NY 14260 USA

The explosive growth of mobile data traffic poses challenge to the network architecture design. caching popular contents on device level instead of infrastructure level, termed as distributed caching, can potentially alleviate the traffic load. As an emerging technology to decouple the control plane from the physical network topology, software-defined networking (SDN) promises to build a flexible, scalable, and programmable framework by enabling centralized network control and management. In this paper, assuming that user can leverage social networking and share contents via device-to-device (D2D) communications, we propose a SDN-enabled socially aware D2D caching scheme, in which Internet service providers split bandwidth into distinct slices and dynamically allocate these slices to content providers (CPs) for controlling traffic flows. Then, the CPs can provide share contents with content requesters for further traffic offloading. To improve the spectrum efficiency, we conceive this caching scheme with the architecture of hierarchical matching game. In this way, the combinatorial problem can be solved in two-stage. In the first stage, we propose a dynamic bandwidth allocation algorithm to allocate distinct bandwidth slices for differentiated quality-of-service requirements. In the second stage, we formulate the content sharing problem as a many-to-many matching game with externalities. To solve this complex matching problem, we design a novel distributed algorithm with faster converge speed. A joint solution is thus provided to solve the content sharing and power allocation problems iteratively by exploiting non-orthogonal multiple access. We conduct extensive simulations to demonstrate that our proposed schemes provide a better tradeoff between performance and complexity than other benchmarks.

关键词： Software-defined networking social network non-orthogonal multiple access device-to-device communications distributed caching hierarchical matching

来源：评论

学校读者我要写书评

暂无评论

D2C: Dynamic Decision caching Mechanism for Provisioning Safety-as-a-Service in Road Transportation

引用

IEEE SYSTEMS JOURNAL 2022年第2期16卷 3331-3338页

作者： Roy, Chandana Misra, Sudip Maiti, Jhareswar Univ Luxembourg Space Syst Engn Res Grp L-1855 Luxembourg Luxembourg Indian Inst Technol Kharagpur Dept Comp Sci Kharagpur W Bengal India Indian Inst Technol Kharagpur Dept Ind & Syst Engn Engn Kharagpur W Bengal India

In this article, we propose a dynamic decision caching mechanism (D2C), for provisioning customized safety-related decision to the end users. The end users may be vehicle owners, drivers, or any government organization. Typically, in a safety-as-a-service (Safe-aaS), these end users select certain parameters from the web portal. Based on these selected decision parameters, the decision is provided to them. We consider road transportation as the application scenario of Safe-aaS and design the caching mechanism. In a practical scenario, certain decision parameters such as weather conditions and permissible weight of a vehicle, do not fluctuate with time. Therefore, continuous data transmission, processing, and decision generation consume unnecessary power. The caching of similar decision parameters, which vary slowly with time, is one of the possible solutions. Additionally, the sensor nodes are energy-constrained in nature, hence we take into account these characteristics, delay in delivery of decisions to the end users, and state of end users to propose the dynamic and distributed cache access mechanism. We consider that the edge devices are enabled with cache memory, which results in minimizing the cache access time. Extensive simulation-based analysis of our proposed system, D2C demonstrates that the energy consumption is reduced by 16-53% and cache hit percentage is improved by 28-31%, compared to the existing caching schemes Roy et al. (2018), Abdelhamid et al. (2015), Abdelhamid et al. (2015).

关键词： Cache memory Vehicle dynamics Virtualization Portals Meteorology Vehicles Systems architecture Decision virtualization distributed caching road transportation safety-as-a-service (Safe-aaS) vehicular nodes

来源：评论

学校读者我要写书评

暂无评论

Cache-aware scheduling of scientific workflows in a multisite cloud

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2021年 122卷 172-186页

作者： Heidsieck, Gaetan de Oliveira, Daniel Pacitti, Esther Pradal, Christophe Tardieu, Francois Valduriez, Patrick Univ Montpellier LIRMM CNRS INRIA Montpellier France Fluminense Fed Univ Comp Sci Niteroi RJ Brazil CIRAD UMR AGAP Inst F-34398 Montpellier France Univ Montpellier Inst Agro INRAE LEPSE Montpellier France

Many scientific experiments today are performed using scientific workflows, which become more and more data-intensive. We consider the efficient execution of such workflows in a multisite cloud, leveraging heterogeneous resources available at multiple geo-distributed data centers. Since it is common for workflow users to reuse code or data from previous workflows, a promising approach for efficient workflow execution is to cache intermediate data in order to avoid re-executing entire workflows. However, caching intermediate data and scheduling workflows to exploit such caching in a multisite cloud is complex. In particular, workflow scheduling must be cache-aware, in order to decide whether reusing cache data or re-executing workflows entirely. In this paper, we propose a solution for cache-aware scheduling of scientific workflows in a multisite cloud. Our solution includes a distributed and parallel architecture and new algorithms for adaptive caching, cache site selection, and dynamic workflow scheduling. We implemented our solution in the OpenAlea workflow system, together with cache-aware distributed scheduling algorithms. Our experimental evaluation in a three-site cloud with a real application in plant phenotyping shows that our solution can yield major performance gains, reducing total time up to 42% with 60% of the same input data for each new execution. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Multisite cloud distributed caching Scientific workflow Workflow system Workflow scheduling

来源：评论

学校读者我要写书评

暂无评论

Using Evolutive Summary Counters for Efficient Cooperative caching in Search Engines

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2012年第4期23卷 776-784页

作者： Dominguez-Sal, David Aguilar-Saborit, Josep Surdeanu, Mihai Lluis Larriba-Pey, Josep Univ Politecn Cataluna DAMA UPC Comp Architecture Dept Barcelona Spain Microsoft Corp Dana Point CA 92629 USA Stanford Univ Stanford Nat Language Proc Grp Stanford CA 94305 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

We propose and analyze a distributed cooperative caching strategy based on the Evolutive Summary Counters (ESC), a new data structure that stores an approximated record of the data accesses in each computing node of a search engine. The ESC capture the frequency of accesses to the elements of a data collection, and the evolution of the access patterns for each node in a network of computers. The ESC can be efficiently summarized into what we call ESC-summaries to obtain approximate statistics of the document entries accessed by each computing node. We use the ESC-summaries to introduce two algorithms that manage our distributed caching strategy, one for the distribution of the cache contents, ESC-placement, and another one for the search of documents in the distributed cache, ESC-search. While the former improves the hit rate of the system and keeps a large ratio of data accesses local, the latter reduces the network traffic by restricting the number of nodes queried to find a document. We show that our cooperative caching approach outperforms state-of-the-art models in both hit rate, throughput, and location recall for multiple scenarios, i.e., different query distributions and systems with varying degrees of complexity.

关键词： distributed systems distributed caching resource intensive applications count filter

来源：评论

学校读者我要写书评

暂无评论

An expiration age-based document placement scheme for cooperative Web caching

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2004年第5期16卷 585-600页

作者： Ramaswamy, L Liu, L Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

The sharing of caches among proxies is an important technique to reduce Web traffic, alleviate network bottlenecks, and improve response time of document requests. Most existing work on cooperative caching has been focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper, we propose a new document placement scheme which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively among the caches that already have a copy of this document. We refer to this new document placement scheme as the Expiration Age-based scheme (EA scheme for short). The EA scheme effectively reduces the replication of documents across the cache group, while ensuring that a copy of the document always resides in a cache where it is likely to stay for the longest time. We report our study on the potentials and limits of the EA scheme using both analytic modeling and trace-based simulation. The analytical model compares and contrasts the existing (ad hoc) placement scheme of cooperative proxy caches with our new EA scheme and indicates that the EA scheme improves the effectiveness of aggregate disk usage, thereby increasing the average time duration for which documents stay in the cache. The trace-based simulations show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies.

关键词： cooperative Web caching document placement distributed caching

来源：评论

学校读者我要写书评

暂无评论

Large-scale multimedia content delivery over optical networks for interactive TV services

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2006年第8期22卷 1018-1024页

作者： Czyrnek, Miroslaw Kusmierek, Ewa Mazurek, Cezary Stroinski, Maciej Poznan Supercomp & Networking Ctr PL-61704 Poznan Poland

iTVP is a system built for delivery of live TV programming, video-on-demand and audio-on-demand with interactive access over IP networks. It has a nationwide range and is designed to provide service to a high number of concurrent users. Hence, scalability is one of the most important issues. In this paper we described how scalability is achieved in a two-level hierarchical architecture of the delivery system. We present the principles of content caching mechanisms and the management of the resulting distributed content repository. The system is implemented and currently operates in a test installation. Although the range of the test system operations is limited, as far as the number of users and the size of the content repository is concerned, the experience gained with iTVP so far provides an insight into the expected prototype performance. We present a system performance evaluation and describe the experience gained during the iGrid demonstration. (c) 2006 Elsevier B.V. All rights reserved.

关键词： content distribution network distributed caching multimedia delivery

来源：评论

学校读者我要写书评

暂无评论

Mode Selection for Energy Efficient Content Delivery in Cellular Networks

引用

IEEE COMMUNICATIONS LETTERS 2016年第4期20卷 728-731页

作者： Xu, Yanli Wang, Shuaiqun Shanghai Maritime Univ Coll Informat Engn Shanghai Peoples R China

Device-to-device (D2D) content delivery may improve resource efficiency for future content-centric cellular network due to the character of proximal transmission. However, when to use D2D technique can bring this performance improvement is still not clear. This letter investigates factors impacting on content delivery and proposes a criteria for delivery mode (cellular mode and D2D mode) selection. With this criteria, a more energy efficient delivery mode can be selected adaptively according to transmitter deployment, delivery coverage, channel quality, and quality-of-service (QoS) requirement. Simulation results show that compared with random mode selection scheme, the proposed mode selection strategy can reduce energy consumption for successful content delivery under different cases (e.g., up to 50% energy reduction for a successful content delivery). In addition, results on relationships among influencing factors and delivery efficiency match our theoretical analysis.

关键词： D2D communication content delivery mode selection energy efficiency distributed caching

来源：评论

学校读者我要写书评

暂无评论

Dynamic bandwidth allocation algorithms for local storage based VoD delivery: Comparison between single and dual receiver configurations

引用

OPTICS COMMUNICATIONS 2015年 336卷 40-46页

作者： Abeywickrama, Sandu Wong, Elaine Univ Melbourne Natl ICT Australia Dept Elect & Elect Engn Melbourne Vic 3010 Australia

The benefits of using distributed caching servers to optimize the traditional video-on-demand delivery haw been extensively discussed in literature. In our previous work, we introduced a dual-receiver based dynamic bandwidth allocation algorithm to improve video-on-demand services using a local storage placed within the access network. The main drawback of this algorithm lies in the additional power consumption at the optical network unit that arises from using two receivers. In this paper, we present two novel single-receiver based dynamic bandwidth allocation algorithms to further optimize local storage aided video-on-demand over passive optical networks. The quality-of-service and power performances of the algorithms are critically analyzed using packet level simulations and formulation of power consumption models. We show that the energy-efficiency of a local storage based video-on-demand scheme can be increased without compromising the quality-of-service by the use of single receiver algorithms. Further, we compare the two newly introduced algorithms against dual-receiver based and without local storage schemes to find the most appropriate bandwidth allocation algorithm for local storage based video-on-demand delivery over passive optical networks. Crown Copyright (C) 2014 Published by Elsevier B.V. All rights reserved.

关键词： Video-on-demand distributed caching Quality-of-service Dynamic bandwidth allocation

来源：评论

学校读者我要写书评

暂无评论

Storage Capacity of Opportunistic Information Dissemination Systems

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2022年第10期21卷 3773-3788页

作者： Rizzo, Gianluca Palma, Noelia Perez Marsan, Marco Ajmone Mancuso, Vincenzo HES SO Valais CH-3960 Sierre Switzerland UNIFG I-71122 Foggia Italy IMDEA Networks Inst Madrid 28918 Spain Univ Carlos III Madrid Getafe 28903 Spain Politecn Torino I-10129 Turin Italy

Floating Content (FC) is a paradigm for localized infrastructure-less content dissemination, that aims at sharing information among nodes within a restricted geographical area by relying only on opportunistic content exchanges. FC provides the basis for the probabilistic spatial storage of shared information in a completely decentralized fashion, usually without support from dedicated infrastructure. One of the key open issues in FC is the characterization of its performance limits as functions of the system parameters, accounting for its reliance on volatile wireless exchanges and on limited user resources. This paper takes a first step towards tackling this issue, by elaborating a model for the storage capacity of FC, i.e., for the maximum amount of information that can be stored through the FC paradigm. The storage capacity of FC, and of similar probabilistic content dissemination systems, is evaluated with a powerful information theoretical approach, based on a mean field model of opportunistic information exchange. In addition, an extremely simple explicit approximate expression for storage capacity is derived. The numerical results generated by our analytical models are compared to the predictions of realistic simulations under different setups, proving the accuracy of our analytical approaches, and characterizing the properties of the FC storage capacity.

关键词： Analytical models Peer-to-peer computing Probabilistic logic Numerical models Capacity planning Statistics Sociology Floating content distributed caching opportunistic communications proactive caching

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop Cooperative caching in Social IoT Using Matching Theory

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2018年第4期17卷 2127-2145页

作者： Wang, Li Wu, Huaqing Han, Zhu Zhang, Ping Poor, H. Vincent Minist Educ Key Lab Universal Wireless Commun Beijing Peoples R China Beijing Univ Posts & Telecommun Sch Elect Engn Beijing Key Lab Work Safety Intelligent Monitorin Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Univ Houston Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 02447 South Korea Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

It is envisioned that the Internet of Things (IoT) will provide promising opportunities to users, manufacturers, and service providers with a wide applicability in many fields. By employing social networking and device-to-device (D2D) communications in the IoT, the resulting social IoT can potentially provide services more effectively and efficiently. This paper focuses on content sharing among smart objects (devices) in the social IoT with D2D-based cooperative coded caching. Generally, complete content items or coded fragments are allowed to be delivered via multi-hop cooperative D2D communications. First, aiming at maximizing the overall success rate of multi-hop-based content sharing, the interplay between coding parameter optimization and wireless resource allocation is investigated by considering both physical and social characteristics. Moreover, a Roth and Vande Vate-based distributed scheme is proposed to solve the dynamic matching problem between the content helpers and content requesters. Numerical results demonstrate that the proposed scheme can achieve a good tradeoff between system performance and computational complexity.

关键词： Device-to-device communications social internet of things distributed caching cooperative content sharing distributed matching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：