首页 > 最新文献

Future Generation Computer Systems-The International Journal of Escience最新文献

英文 中文
Multilayer multivariate forecasting network for precise resource utilization prediction in edge data centers 面向边缘数据中心资源利用精确预测的多层多元预测网络
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-10 DOI: 10.1016/j.future.2024.107692
Shivani Tripathi , Priyadarshni , Rajiv Misra , T.N. Singh
Efficient resource management and accurate prediction of cloud workloads are vital in modern cloud computing environments, where dynamic and volatile workloads present significant challenges. Traditional forecasting models often fail to fully capture the intricate temporal dependencies and non-linear patterns inherent in cloud data, leading to inefficiencies in resource utilization. To overcome these limitations, this research introduces the MultiLayer Multivariate Resource Predictor (MMRP), a novel deep learning architecture that seamlessly integrates a Multi-Head Attention Transformer model with Convolutional Neural Networks and Bidirectional Long Short-Term Memory units. The proposed model is designed to excel in capturing long-range dependencies and complex patterns, thereby significantly enhancing the accuracy of workload predictions. Extensive, rigorous experimentation using real-world Alibaba and Google cluster traces reveals that the proposed model consistently outperforms existing state-of-the-art models and related cloud resource utilization prediction in both univariate and multivariate time series forecasting tasks. The model demonstrates a remarkable improvement in prediction performance, with an average R squared increase of 5.76% and a Mean Absolute Percentage Error reduction of 84.9% compared to the best-performing baseline models. Furthermore, our model achieves a significant reduction in Root Mean Square Error by approximately 35.34% and decreases Mean Absolute Error by about 39.49% on average. Its scalability and adaptability across various cloud environments underscore the proposed model’s potential to optimize resource allocation, paving the way for more efficient and reliable cloud-based systems.
在现代云计算环境中,高效的资源管理和准确的云工作负载预测至关重要,因为动态和不稳定的工作负载带来了重大挑战。传统的预测模型往往不能完全捕捉云数据中复杂的时间依赖性和非线性模式,导致资源利用效率低下。为了克服这些限制,本研究引入了多层多元资源预测器(MMRP),这是一种新颖的深度学习架构,将多头注意力转换器模型与卷积神经网络和双向长短期记忆单元无缝集成。所提出的模型被设计为在捕获远程依赖关系和复杂模式方面表现出色,从而显著提高了工作负载预测的准确性。使用真实世界的阿里巴巴和谷歌聚类轨迹进行的广泛、严格的实验表明,在单变量和多变量时间序列预测任务中,所提出的模型始终优于现有的最先进模型和相关的云资源利用预测。与表现最好的基线模型相比,该模型在预测性能上有了显著的提高,平均R平方增加了5.76%,平均绝对百分比误差减少了84.9%。此外,我们的模型使均方根误差(Root Mean Square Error)降低了约35.34%,平均绝对误差(Mean Absolute Error)降低了约39.49%。其跨各种云环境的可伸缩性和适应性强调了所建议模型优化资源分配的潜力,为更高效和可靠的基于云的系统铺平了道路。
{"title":"Multilayer multivariate forecasting network for precise resource utilization prediction in edge data centers","authors":"Shivani Tripathi ,&nbsp;Priyadarshni ,&nbsp;Rajiv Misra ,&nbsp;T.N. Singh","doi":"10.1016/j.future.2024.107692","DOIUrl":"10.1016/j.future.2024.107692","url":null,"abstract":"<div><div>Efficient resource management and accurate prediction of cloud workloads are vital in modern cloud computing environments, where dynamic and volatile workloads present significant challenges. Traditional forecasting models often fail to fully capture the intricate temporal dependencies and non-linear patterns inherent in cloud data, leading to inefficiencies in resource utilization. To overcome these limitations, this research introduces the MultiLayer Multivariate Resource Predictor (MMRP), a novel deep learning architecture that seamlessly integrates a Multi-Head Attention Transformer model with Convolutional Neural Networks and Bidirectional Long Short-Term Memory units. The proposed model is designed to excel in capturing long-range dependencies and complex patterns, thereby significantly enhancing the accuracy of workload predictions. Extensive, rigorous experimentation using real-world Alibaba and Google cluster traces reveals that the proposed model consistently outperforms existing state-of-the-art models and related cloud resource utilization prediction in both univariate and multivariate time series forecasting tasks. The model demonstrates a remarkable improvement in prediction performance, with an average R squared increase of 5.76% and a Mean Absolute Percentage Error reduction of 84.9% compared to the best-performing baseline models. Furthermore, our model achieves a significant reduction in Root Mean Square Error by approximately 35.34% and decreases Mean Absolute Error by about 39.49% on average. Its scalability and adaptability across various cloud environments underscore the proposed model’s potential to optimize resource allocation, paving the way for more efficient and reliable cloud-based systems.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107692"},"PeriodicalIF":6.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FedShufde: A privacy preserving framework of federated learning for edge-based smart UAV delivery system
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-10 DOI: 10.1016/j.future.2025.107706
Aiting Yao , Shantanu Pal , Gang Li , Xuejun Li , Zheng Zhang , Frank Jiang , Chengzu Dong , Jia Xu , Xiao Liu
In recent years, there has been a rapid increase in the integration of Internet of Things (IoT) systems into edge computing. This integration offers several advantages over traditional cloud computing, including lower latency and reduced network traffic. In addition, edge computing facilitates the protection of users’ sensitive data by processing it at the edge before transmitting it to the cloud using techniques such as Federated Learning (FL) and Differential Privacy (DP). However, these techniques have limitations, such as the risk of user information being obtained by attackers through the uploaded weights/model parameters in FL and the randomness of DP, which limits data availability. To address these issues, this paper proposes a framework called FedShufde (Federated Learning with a Shuffle Model and Differential Privacy in Edge Computing Environments) to protect user privacy in edge computing-based IoT systems, using an Unmanned Aerial Vehicle (UAV) delivery system as an example. FedShufde uses local differential privacy and the shuffle model to prevent attackers from inferring user privacy from information such as UAV’s location, flight conditions, or delivery address. In addition, the network connection between the UAV and the edge server cannot be obtained by the cloud aggregator, and the shuffle model reduces the communication cost between the edge server and the cloud aggregator. Our experiments on a real-world edge-based smart UAV delivery system using public datasets demonstrate the significant advantages of our proposed framework over baseline strategies.
{"title":"FedShufde: A privacy preserving framework of federated learning for edge-based smart UAV delivery system","authors":"Aiting Yao ,&nbsp;Shantanu Pal ,&nbsp;Gang Li ,&nbsp;Xuejun Li ,&nbsp;Zheng Zhang ,&nbsp;Frank Jiang ,&nbsp;Chengzu Dong ,&nbsp;Jia Xu ,&nbsp;Xiao Liu","doi":"10.1016/j.future.2025.107706","DOIUrl":"10.1016/j.future.2025.107706","url":null,"abstract":"<div><div>In recent years, there has been a rapid increase in the integration of Internet of Things (IoT) systems into edge computing. This integration offers several advantages over traditional cloud computing, including lower latency and reduced network traffic. In addition, edge computing facilitates the protection of users’ sensitive data by processing it at the edge before transmitting it to the cloud using techniques such as Federated Learning (FL) and Differential Privacy (DP). However, these techniques have limitations, such as the risk of user information being obtained by attackers through the uploaded weights/model parameters in FL and the randomness of DP, which limits data availability. To address these issues, this paper proposes a framework called FedShufde (<strong><u>Fed</u></strong>erated Learning with a <strong><u>Shuf</u></strong>fle Model and <strong><u>D</u></strong>ifferential Privacy in <strong><u>E</u></strong>dge Computing Environments) to protect user privacy in edge computing-based IoT systems, using an Unmanned Aerial Vehicle (UAV) delivery system as an example. FedShufde uses local differential privacy and the shuffle model to prevent attackers from inferring user privacy from information such as UAV’s location, flight conditions, or delivery address. In addition, the network connection between the UAV and the edge server cannot be obtained by the cloud aggregator, and the shuffle model reduces the communication cost between the edge server and the cloud aggregator. Our experiments on a real-world edge-based smart UAV delivery system using public datasets demonstrate the significant advantages of our proposed framework over baseline strategies.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107706"},"PeriodicalIF":6.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143167024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
UD-LDP: A Technique for optimally catalyzing user driven Local Differential Privacy UD-LDP:一种最佳催化用户驱动的本地差分隐私的技术
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-09 DOI: 10.1016/j.future.2025.107712
Gnanakumar Thedchanamoorthy , Michael Bewong , Meisam Mohammady , Tanveer Zia , Md Zahidul Islam
Local Differential Privacy (LDP) has emerged as a popular mechanism for crowd-sourced data collection, but enforcing a uniform level of perturbation may hinder the participation of individuals with higher privacy needs, while high privacy levels that satisfy more users can reduce utility. To address this, we propose a cohort-based mechanism that allows participants to choose the privacy level from a predefined set. We investigate optimal cohort configurations and uncover insights about utility convexity, enabling the identification of privacy-utility balanced settings. Our proposed mechanism, called UD-LDP, empowers users, promotes transparency, and facilitates suitable privacy budget selection. We demonstrate the effectiveness of cohortisation through experiments on synthetic and real-world datasets.
局部差分隐私(LDP)已成为一种流行的众包数据收集机制,但强制执行统一的扰动水平可能会阻碍具有更高隐私需求的个人的参与,而满足更多用户的高隐私水平可能会降低效用。为了解决这个问题,我们提出了一种基于队列的机制,允许参与者从预定义的集合中选择隐私级别。我们研究了最优队列配置,并揭示了效用凸性的见解,从而能够识别隐私-效用平衡设置。我们提出的机制,称为UD-LDP,赋予用户权力,提高透明度,并促进适当的隐私预算选择。我们通过对合成数据集和现实世界数据集的实验证明了协同化的有效性。
{"title":"UD-LDP: A Technique for optimally catalyzing user driven Local Differential Privacy","authors":"Gnanakumar Thedchanamoorthy ,&nbsp;Michael Bewong ,&nbsp;Meisam Mohammady ,&nbsp;Tanveer Zia ,&nbsp;Md Zahidul Islam","doi":"10.1016/j.future.2025.107712","DOIUrl":"10.1016/j.future.2025.107712","url":null,"abstract":"<div><div>Local Differential Privacy (LDP) has emerged as a popular mechanism for crowd-sourced data collection, but enforcing a uniform level of perturbation may hinder the participation of individuals with higher privacy needs, while high privacy levels that satisfy more users can reduce utility. To address this, we propose a cohort-based mechanism that allows participants to choose the privacy level from a predefined set. We investigate optimal cohort configurations and uncover insights about utility convexity, enabling the identification of privacy-utility balanced settings. Our proposed mechanism, called UD-LDP, empowers users, promotes transparency, and facilitates suitable privacy budget selection. We demonstrate the effectiveness of cohortisation through experiments on synthetic and real-world datasets.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107712"},"PeriodicalIF":6.2,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Task replication based energy management using random-weighted privacy-preserving distributed algorithm for real-time embedded system
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-06 DOI: 10.1016/j.future.2025.107708
Dr. A. Velliangiri , Dr. Jayaraj Velusamy , Dr. Maheswari M , Dr. R.Leena Rose
Efficient energy management in real-time embedded systems is increasingly challenging due to the growing complexity of distributed tasks and the need for robust privacy preservation. Conventional task mapping and repartitioning techniques have focused on increasing the system reliability, efficiency, and lifespan, but typically incurred a high peak power generation because of Thermal Design Power (TDP) limitations which confines the scalability and applicability. To overcome these problems, the Task Replication-based Energy Management using Random-weighted Privacy-preserving Distributed Algorithm (TR-EM-R-RWPPDA-RTES) is proposed as a new scheme for real-time embedded systems. This architecture integrates Hotspot-Aware Task Mapping (HATM) to optimally load tasks across cores, Dynamic Heterogeneous Earliest Finish Time (DHEFT) scheduling to improve execution timing, and a Reliability-based Random-Weighted Privacy-Preserving Distributed Algorithm (R-RWPPDA) to optimize power consumption. Using these elements, the proposed approach reduces both system energy consumption and system trustworthiness. Comprehensive simulations based on the MiBench benchmark suite, as well as gem5 and McPAT simulators on ARM multicore processors (4, 8, and 16 cores), are also shown to validate the robustness of the proposed method. TR-EM-R-RWPPDA-RTES yields 23.73 %, 36.33 %, and37.84 % peak power consumption reduction with respect to the state-of-the-art solutions, thus providing a robust solution for energy-efficient, robust and reliable real-time embedded systems.
{"title":"Task replication based energy management using random-weighted privacy-preserving distributed algorithm for real-time embedded system","authors":"Dr. A. Velliangiri ,&nbsp;Dr. Jayaraj Velusamy ,&nbsp;Dr. Maheswari M ,&nbsp;Dr. R.Leena Rose","doi":"10.1016/j.future.2025.107708","DOIUrl":"10.1016/j.future.2025.107708","url":null,"abstract":"<div><div>Efficient energy management in real-time embedded systems is increasingly challenging due to the growing complexity of distributed tasks and the need for robust privacy preservation. Conventional task mapping and repartitioning techniques have focused on increasing the system reliability, efficiency, and lifespan, but typically incurred a high peak power generation because of Thermal Design Power (TDP) limitations which confines the scalability and applicability. To overcome these problems, the Task Replication-based Energy Management using Random-weighted Privacy-preserving Distributed Algorithm (TR-EM-R-RWPPDA-RTES) is proposed as a new scheme for real-time embedded systems. This architecture integrates Hotspot-Aware Task Mapping (HATM) to optimally load tasks across cores, Dynamic Heterogeneous Earliest Finish Time (DHEFT) scheduling to improve execution timing, and a Reliability-based Random-Weighted Privacy-Preserving Distributed Algorithm (R-RWPPDA) to optimize power consumption. Using these elements, the proposed approach reduces both system energy consumption and system trustworthiness. Comprehensive simulations based on the MiBench benchmark suite, as well as gem5 and McPAT simulators on ARM multicore processors (4, 8, and 16 cores), are also shown to validate the robustness of the proposed method. TR-EM-R-RWPPDA-RTES yields 23.73 %, 36.33 %, and37.84 % peak power consumption reduction with respect to the state-of-the-art solutions, thus providing a robust solution for energy-efficient, robust and reliable real-time embedded systems.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"167 ","pages":"Article 107708"},"PeriodicalIF":6.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143321949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Remote sensing revolutionizing agriculture: Toward a new frontier 遥感技术革新农业:迈向新前沿
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-06 DOI: 10.1016/j.future.2024.107691
Xiaoding Wang , Haitao Zeng , Xu Yang , Jiwu Shu , Qibin Wu , Youxiong Que , Xuechao Yang , Xun Yi , Ibrahim Khalil , Albert Y. Zomaya
Remote sensing-empowered agriculture is a significant approach that utilizes remote sensing (RS) to improve agricultural production and crop management. In the agricultural sector, RS allows the retrieval of extensive data related to land, vegetation, and crops, providing crucial information for farmers and decision-makers to enhance precision and efficiency in crop cultivation and management. The combination of RS and artificial intelligence (AI) holds tremendous potential for agricultural production. With the integration of AI, remote sensing-empowered agriculture has expanded, and its impact has become increasingly prominent. It is expected to have far-reaching effects on global agriculture, fostering the more efficient, sustainable, and intelligent development. In the agricultural field, this review presents a concise exploration of the principles and usage of RS. It also examines the role of AI in facilitating agricultural RS, summarizes the application of the combination of RS and AI in the field of agriculture, and discusses its effects. Opportunities and challenges arising from the integration of AI and AI in agriculture are also discussed. This review aims to accelerate the entry into a new era for agriculture empowered by RS.
遥感农业是利用遥感技术改善农业生产和作物管理的一种重要方法。在农业部门,RS允许检索与土地、植被和作物有关的大量数据,为农民和决策者提供关键信息,以提高作物种植和管理的精度和效率。RS和人工智能(AI)的结合在农业生产中具有巨大的潜力。随着人工智能的融合,遥感农业得到了扩展,其影响日益突出。预计将对全球农业产生深远影响,促进更高效、可持续、智能的发展。在农业领域,本文简要介绍了遥感技术的原理和应用,探讨了人工智能在促进农业遥感中的作用,总结了遥感与人工智能结合在农业领域的应用,并讨论了其效果。还讨论了人工智能与人工智能在农业领域的融合所带来的机遇和挑战。这一综述旨在加速进入RS赋能的农业新时代。
{"title":"Remote sensing revolutionizing agriculture: Toward a new frontier","authors":"Xiaoding Wang ,&nbsp;Haitao Zeng ,&nbsp;Xu Yang ,&nbsp;Jiwu Shu ,&nbsp;Qibin Wu ,&nbsp;Youxiong Que ,&nbsp;Xuechao Yang ,&nbsp;Xun Yi ,&nbsp;Ibrahim Khalil ,&nbsp;Albert Y. Zomaya","doi":"10.1016/j.future.2024.107691","DOIUrl":"10.1016/j.future.2024.107691","url":null,"abstract":"<div><div>Remote sensing-empowered agriculture is a significant approach that utilizes remote sensing (RS) to improve agricultural production and crop management. In the agricultural sector, RS allows the retrieval of extensive data related to land, vegetation, and crops, providing crucial information for farmers and decision-makers to enhance precision and efficiency in crop cultivation and management. The combination of RS and artificial intelligence (AI) holds tremendous potential for agricultural production. With the integration of AI, remote sensing-empowered agriculture has expanded, and its impact has become increasingly prominent. It is expected to have far-reaching effects on global agriculture, fostering the more efficient, sustainable, and intelligent development. In the agricultural field, this review presents a concise exploration of the principles and usage of RS. It also examines the role of AI in facilitating agricultural RS, summarizes the application of the combination of RS and AI in the field of agriculture, and discusses its effects. Opportunities and challenges arising from the integration of AI and AI in agriculture are also discussed. This review aims to accelerate the entry into a new era for agriculture empowered by RS.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107691"},"PeriodicalIF":6.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142968055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RADiCe: A Risk Analysis Framework for Data Centers RADiCe:数据中心的风险分析框架
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-04 DOI: 10.1016/j.future.2024.107702
Fabian Mastenbroek , Tiziano De Matteis , Vincent van Beek , Alexandru Iosup
Datacenter service providers face engineering and operational challenges involving numerous risk aspects. Bad decisions can result in financial penalties, competitive disadvantage, and unsustainable environmental impact. Risk management is an integral aspect of the design and operation of modern datacenters, but frameworks that allow users to consider various risk trade-offs conveniently are missing. We propose RADiCe, an open-source framework that enables data-driven analysis of IT-related operational risks in sustainable datacenters. RADiCe uses monitoring and environmental data and, via discrete event simulation, assists datacenter experts through systematic evaluation of risk scenarios, visualization, and optimization of risks. Our analyses highlight the increasing risk datacenter operators face due to price surges in electricity and sustainability and demonstrate how RADiCe can evaluate and control such risks by optimizing the topology and operational settings of the datacenter. Eventually, RADiCe can evaluate risk scenarios by a factor 70x–330x faster than others, opening possibilities for interactive risk exploration.
数据中心服务提供商面临着涉及许多风险方面的工程和运营挑战。错误的决策可能导致经济处罚、竞争劣势和不可持续的环境影响。风险管理是现代数据中心设计和操作的一个组成部分,但是缺少允许用户方便地考虑各种风险权衡的框架。我们提出RADiCe,这是一个开源框架,可以对可持续数据中心中与it相关的操作风险进行数据驱动分析。RADiCe利用监测和环境数据,通过离散事件模拟,协助数据中心专家对风险情景进行系统评估、可视化和优化风险。我们的分析强调了数据中心运营商由于电价和可持续性上涨而面临的日益增加的风险,并展示了RADiCe如何通过优化数据中心的拓扑结构和操作设置来评估和控制这些风险。最终,RADiCe能够以比其他工具快70 - 330倍的速度评估风险情景,为交互式风险探索开辟了可能性。
{"title":"RADiCe: A Risk Analysis Framework for Data Centers","authors":"Fabian Mastenbroek ,&nbsp;Tiziano De Matteis ,&nbsp;Vincent van Beek ,&nbsp;Alexandru Iosup","doi":"10.1016/j.future.2024.107702","DOIUrl":"10.1016/j.future.2024.107702","url":null,"abstract":"<div><div>Datacenter service providers face engineering and operational challenges involving numerous risk aspects. Bad decisions can result in financial penalties, competitive disadvantage, and unsustainable environmental impact. Risk management is an integral aspect of the design and operation of modern datacenters, but frameworks that allow users to consider various risk trade-offs conveniently are missing. We propose <span>RADiCe</span>, an open-source framework that enables data-driven analysis of IT-related operational risks in sustainable datacenters. <span>RADiCe</span> uses monitoring and environmental data and, via discrete event simulation, assists datacenter experts through systematic evaluation of risk scenarios, visualization, and optimization of risks. Our analyses highlight the increasing risk datacenter operators face due to price surges in electricity and sustainability and demonstrate how <span>RADiCe</span> can evaluate and control such risks by optimizing the topology and operational settings of the datacenter. Eventually, <span>RADiCe</span> can evaluate risk scenarios by a factor 70x–330x faster than others, opening possibilities for interactive risk exploration.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107702"},"PeriodicalIF":6.2,"publicationDate":"2025-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142968054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Forward-Secure multi-user and verifiable dynamic searchable encryption scheme within a zero-trust environment 零信任环境下的前向安全多用户可验证动态搜索加密方案
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-02 DOI: 10.1016/j.future.2024.107701
Zhihao Xu , Chengliang Tian , Guoyan Zhang , Weizhong Tian , Lidong Han
Privacy-preserving searchable encryption can allow clients to encrypt the data for secure cloud storage, enabling subsequent data retrieval while preserving the privacy of data. In this paper, we initialize the study of constructing a secure dynamic searchable symmetric encryption (DSSE) scheme in a zero-trust environment characterized by the threat model of honest-but-curious data owner (DO) + honest-but-curious data user (DU) + fully malicious cloud server (CS). To tackle these challenges, we introduce a multi-user DSSE scheme that emphasizes verifiability and privacy while integrating forward security. Our contributions include: Employing the oblivious pseudo-random function (OPRF) protocol for secure DO-DU interactions, ensuring the privacy of DO’s keys and DU’s queried keywords from each other, And maintaining the secure separation of data ownership and usage, Utilizing a multiset hash function-based state chain to achieve forward privacy and support DO updates of encrypted cloud data with verifiable query results Proposing a novel hash-based file encryption and authentication approach to protect file privacy and verify query results. additionally, We provide a comprehensive security analysis and experimental evaluation demonstrating the efficacy and efficiency of our approach. these advancements enhance DSSE schemes under a zero-trust environment, Addressing critical challenges of privacy, Verifiability, And operational efficiency
保护隐私的可搜索加密允许客户端为安全的云存储加密数据,从而在保护数据隐私的同时实现后续数据检索。本文首先研究了在以诚实但好奇的数据所有者(DO) +诚实但好奇的数据用户(DU) +完全恶意云服务器(CS)的威胁模型为特征的零信任环境下构建安全的动态可搜索对称加密(DSSE)方案。为了应对这些挑战,我们引入了一个多用户DSSE方案,该方案强调可验证性和隐私性,同时集成了前向安全性。我们的贡献包括:采用遗忘伪随机函数(OPRF)协议进行DO-DU安全交互,保证了DO密钥和DU查询关键字的私密性,保持了数据所有权和使用的安全分离;利用基于多集哈希函数的状态链实现前向隐私,支持查询结果可验证的加密云数据的DO更新。提出一种新颖的基于哈希的文件加密和认证方法,保护文件隐私,验证查询结果。此外,我们提供了全面的安全性分析和实验评估,证明了我们的方法的有效性和效率。这些进步增强了零信任环境下的DSSE方案,解决了隐私、可验证性和运营效率方面的关键挑战
{"title":"Forward-Secure multi-user and verifiable dynamic searchable encryption scheme within a zero-trust environment","authors":"Zhihao Xu ,&nbsp;Chengliang Tian ,&nbsp;Guoyan Zhang ,&nbsp;Weizhong Tian ,&nbsp;Lidong Han","doi":"10.1016/j.future.2024.107701","DOIUrl":"10.1016/j.future.2024.107701","url":null,"abstract":"<div><div>Privacy-preserving searchable encryption can allow clients to encrypt the data for secure cloud storage, enabling subsequent data retrieval while preserving the privacy of data. In this paper, we initialize the study of constructing a secure dynamic searchable symmetric encryption (DSSE) scheme in a zero-trust environment characterized by the threat model of <em>honest-but-curious data owner (DO)</em> + <em>honest-but-curious data user (DU)</em> + <em>fully malicious cloud server (CS)</em>. To tackle these challenges, we introduce a multi-user DSSE scheme that emphasizes verifiability and privacy while integrating forward security. Our contributions include: Employing the oblivious pseudo-random function (OPRF) protocol for secure <em>DO</em>-<em>DU</em> interactions, ensuring the privacy of <em>DO</em>’s keys and <em>DU</em>’s queried keywords from each other, And maintaining the secure separation of data ownership and usage, Utilizing a multiset hash function-based state chain to achieve forward privacy and support <em>DO</em> updates of encrypted cloud data with verifiable query results Proposing a novel hash-based file encryption and authentication approach to protect file privacy and verify query results. additionally, We provide a comprehensive security analysis and experimental evaluation demonstrating the efficacy and efficiency of our approach. these advancements enhance DSSE schemes under a zero-trust environment, Addressing critical challenges of privacy, Verifiability, And operational efficiency</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107701"},"PeriodicalIF":6.2,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142968057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure blockchain-based reputation system for IIoT-enabled retail industry with resistance to sybil attack
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-02 DOI: 10.1016/j.future.2024.107705
Wenjia Zhao , Xu Yang , Saiyu Qi , Junzhe Wei , Xinpei Dong , Xu Yang , Yong Qi
Leveraging the recent surge in the electronic retail industry, retailer reputation has emerged with increasing significance in shaping consumer purchasing decisions. Despite this, the existing reputation platforms remain largely centralized, thereby enabling retailers to exert total control over reputation services, a reality that compromises the authentic portrayal of retailers. In response, we introduce a secure blockchain-based reputation system, named BlockRep, designed explicitly for the Industrial Internet of Things (IIoT) enabled retail industry. By eliminating dependency on trust inherently foundation in established E-retail platforms, BlockRep effectively resists sybil attack while ensuring review anonymity and authenticity, both critical security requirements of reputation systems. Initially, we champion a hybrid framework designed to enhance user interaction with our system. This approach leverages the centralized E-retail platform to facilitate trade services, whilst unfolding upon a blockchain platform that firmly authenticates the legitimacy of individual reviews. The authentication process is thus anchored to the correctness of cryptographic tokens, which are subsequently deposited on the blockchain. Additionally, we introduce a novel concept, ‘tax-endorsed reviews,’ devised to resist sybil attacks, such as injecting fake positive reviews for itself. Consequently, this necessitates the implementation of a four-party collaboration protocol. Finally, the security analysis complemented with our experimental results, definitively showcase the security and efficiency of BlockRep.
{"title":"Secure blockchain-based reputation system for IIoT-enabled retail industry with resistance to sybil attack","authors":"Wenjia Zhao ,&nbsp;Xu Yang ,&nbsp;Saiyu Qi ,&nbsp;Junzhe Wei ,&nbsp;Xinpei Dong ,&nbsp;Xu Yang ,&nbsp;Yong Qi","doi":"10.1016/j.future.2024.107705","DOIUrl":"10.1016/j.future.2024.107705","url":null,"abstract":"<div><div>Leveraging the recent surge in the electronic retail industry, retailer reputation has emerged with increasing significance in shaping consumer purchasing decisions. Despite this, the existing reputation platforms remain largely centralized, thereby enabling retailers to exert total control over reputation services, a reality that compromises the authentic portrayal of retailers. In response, we introduce a secure blockchain-based reputation system, named BlockRep, designed explicitly for the Industrial Internet of Things (IIoT) enabled retail industry. By eliminating dependency on trust inherently foundation in established E-retail platforms, BlockRep effectively resists sybil attack while ensuring review anonymity and authenticity, both critical security requirements of reputation systems. Initially, we champion a hybrid framework designed to enhance user interaction with our system. This approach leverages the centralized E-retail platform to facilitate trade services, whilst unfolding upon a blockchain platform that firmly authenticates the legitimacy of individual reviews. The authentication process is thus anchored to the correctness of cryptographic tokens, which are subsequently deposited on the blockchain. Additionally, we introduce a novel concept, ‘tax-endorsed reviews,’ devised to resist sybil attacks, such as injecting fake positive reviews for itself. Consequently, this necessitates the implementation of a four-party collaboration protocol. Finally, the security analysis complemented with our experimental results, definitively showcase the security and efficiency of BlockRep.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107705"},"PeriodicalIF":6.2,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143167347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Kubernetes-based scheme for efficient resource allocation in containerized workflow 基于kubernetes的容器化工作流资源高效分配方案
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-02 DOI: 10.1016/j.future.2024.107699
Danyang Liu , Yuanqing Xia , Chenggang Shan , Ke Tian , Yufeng Zhan
In the cloud-native era, Kubernetes-based workflow engines simplify the execution of containerized workflows. However, these engines face challenges in dynamic environments with continuous workflow requests and unpredictable resource demand peaks. The traditional resource allocation approach, which relies merely on current workflow load data, also lacks flexibility and foresight, often leading to resource over-allocation or scarcity. To tackle these issues, we present a containerized workflow resource allocation (CWRA) scheme designed specifically for Kubernetes workflow engines. CWRA predicts future workflow tasks during the current task pod’s lifecycle and employs a dynamic resource scaling strategy to manage high concurrency scenarios effectively. This scheme includes resource discovery and allocation algorithm, which are essential components of our containerized workflow engine (CWE). Our experimental results, across various workflow arrival patterns, indicate significant improvements when compared to the Argo workflow engine. CWRA achieves a reduction in total workflow duration by 0.9% to 11.4%, decreases average workflow duration by a maximum of 21.5%, and increases CPU and memory utilization by 2.07% to 16.95%.
在云原生时代,基于kubernetes的工作流引擎简化了容器化工作流的执行。然而,这些引擎在动态环境中面临着持续的工作流请求和不可预测的资源需求峰值的挑战。传统的资源分配方法仅依赖于当前工作流负载数据,缺乏灵活性和预见性,往往导致资源过度分配或稀缺。为了解决这些问题,我们提出了一个专门为Kubernetes工作流引擎设计的容器化工作流资源分配(CWRA)方案。CWRA在当前任务pod的生命周期内预测未来的工作流任务,并采用动态资源扩展策略来有效地管理高并发场景。该方案包括资源发现和分配算法,这是我们的容器化工作流引擎(CWE)的重要组成部分。我们的实验结果表明,在不同的工作流到达模式下,与Argo工作流引擎相比有了显著的改进。CWRA使总工作流持续时间减少0.9%至11.4%,使平均工作流持续时间最多减少21.5%,使CPU和内存利用率提高2.07%至16.95%。
{"title":"A Kubernetes-based scheme for efficient resource allocation in containerized workflow","authors":"Danyang Liu ,&nbsp;Yuanqing Xia ,&nbsp;Chenggang Shan ,&nbsp;Ke Tian ,&nbsp;Yufeng Zhan","doi":"10.1016/j.future.2024.107699","DOIUrl":"10.1016/j.future.2024.107699","url":null,"abstract":"<div><div>In the cloud-native era, Kubernetes-based workflow engines simplify the execution of containerized workflows. However, these engines face challenges in dynamic environments with continuous workflow requests and unpredictable resource demand peaks. The traditional resource allocation approach, which relies merely on current workflow load data, also lacks flexibility and foresight, often leading to resource over-allocation or scarcity. To tackle these issues, we present a containerized workflow resource allocation (CWRA) scheme designed specifically for Kubernetes workflow engines. CWRA predicts future workflow tasks during the current task pod’s lifecycle and employs a dynamic resource scaling strategy to manage high concurrency scenarios effectively. This scheme includes resource discovery and allocation algorithm, which are essential components of our containerized workflow engine (CWE). Our experimental results, across various workflow arrival patterns, indicate significant improvements when compared to the Argo workflow engine. CWRA achieves a reduction in total workflow duration by 0.9% to 11.4%, decreases average workflow duration by a maximum of 21.5%, and increases CPU and memory utilization by 2.07% to 16.95%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107699"},"PeriodicalIF":6.2,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142968058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blockchain and digital twin empowered edge caching for D2D wireless networks
IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-01-02 DOI: 10.1016/j.future.2024.107704
Jianbo Du , Zuting Yu , Shulei Li , Bintao Hu , Yuan Gao , Xiaoli Chu
Edge caching is considered a promising technology to fulfill user equipment (UE) requirements for content services. In this paper, we explore the use of blockchain and digital twin technologies to support edge caching in a Device-to-Device (D2D) wireless network, where each UE may fetch content from its own caching buffer, from other UEs through D2D links, or from a content server. A digital twin monitors and predicts the operating status of UE by storing crucial data such as the location, estimated processing capability, and remaining energy of each UE. To enable secure and credible trading between UEs, the blockchain technology is used to supervise transactions and constantly update UEs’ reputation values. We formulate an optimization problem to maximize an objective function that considers the content fetching performance, network lifetime and UE’s handover costs by optimizing the content placement and fetching strategies, subject to constraints on the UE’s storage capacity, the upper limit of serving other UEs, and latency requirements. To solve this complicated problem for a dynamic network environment, we propose a proximal policy optimization-based deep reinforcement learning framework. Simulation results demonstrate that our proposed algorithm converges rapidly and can efficiently maximize the rewards, network lifetime and content fetching gain while minimizing handover costs.
{"title":"Blockchain and digital twin empowered edge caching for D2D wireless networks","authors":"Jianbo Du ,&nbsp;Zuting Yu ,&nbsp;Shulei Li ,&nbsp;Bintao Hu ,&nbsp;Yuan Gao ,&nbsp;Xiaoli Chu","doi":"10.1016/j.future.2024.107704","DOIUrl":"10.1016/j.future.2024.107704","url":null,"abstract":"<div><div>Edge caching is considered a promising technology to fulfill user equipment (UE) requirements for content services. In this paper, we explore the use of blockchain and digital twin technologies to support edge caching in a Device-to-Device (D2D) wireless network, where each UE may fetch content from its own caching buffer, from other UEs through D2D links, or from a content server. A digital twin monitors and predicts the operating status of UE by storing crucial data such as the location, estimated processing capability, and remaining energy of each UE. To enable secure and credible trading between UEs, the blockchain technology is used to supervise transactions and constantly update UEs’ reputation values. We formulate an optimization problem to maximize an objective function that considers the content fetching performance, network lifetime and UE’s handover costs by optimizing the content placement and fetching strategies, subject to constraints on the UE’s storage capacity, the upper limit of serving other UEs, and latency requirements. To solve this complicated problem for a dynamic network environment, we propose a proximal policy optimization-based deep reinforcement learning framework. Simulation results demonstrate that our proposed algorithm converges rapidly and can efficiently maximize the rewards, network lifetime and content fetching gain while minimizing handover costs.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107704"},"PeriodicalIF":6.2,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Future Generation Computer Systems-The International Journal of Escience
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1