Future Generation Computer Systems-The International Journal of Escience最新文献_第2页

CG-TTC: A coalitional game-based approach for resource sharing in a peer-to-peer cloud federation market CG-TTC：在点对点云联盟市场中用于资源共享的基于联盟游戏的方法

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-17 DOI: 10.1016/j.future.2025.108016

Parisa Khoshdel , Saeid Abrishami , Mehdi Feizi , Faeze Ramezani

{"title":"CG-TTC: A coalitional game-based approach for resource sharing in a peer-to-peer cloud federation market","authors":"Parisa Khoshdel , Saeid Abrishami , Mehdi Feizi , Faeze Ramezani","doi":"10.1016/j.future.2025.108016","DOIUrl":"10.1016/j.future.2025.108016","url":null,"abstract":"<div><div>In today’s fast-paced technological landscape, cloud federation has emerged as a groundbreaking solution, transforming the way businesses and organizations utilize cloud computing. Cloud federation involves collaboration among multiple Cloud Service Providers (CSPs), allowing them to share computational resources within a unified environment. However, creating a functional marketplace within a cloud federation poses a significant challenge, requiring providers to develop optimal strategies to maximize profitability. This paper addresses the challenge of forming effective federations, conceptualized as a cooperative game with transferable utility. The proposed framework focuses on providers with surplus resources coming together to form coalitions, thereby meeting the resource needs of other providers. To address this, the Coalitional Game-Top Trading Cycles (CG-TTC) mechanism has been introduced—a decentralized approach that uses the well-known Top Trading Cycle assignment algorithm to tackle coalition formation challenges. Importantly, the CG-TTC solution has been shown to be both <em>Pareto optimal</em> and <em>individually stable</em>, ensuring that providers have no incentive to leave their coalitions. Empirical results show that the CG-TTC mechanism improves profitability by up to 34% and enhances fairness by up to 32% compared to the Cloud Federation Formation Mechanism (CFFM).</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108016"},"PeriodicalIF":6.2,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664881","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

HPC and AI in bioinformatics 生物信息学中的高性能计算和人工智能

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-16 DOI: 10.1016/j.future.2025.108019

Yanjie Wei, Weiguo Liu, Bertil Schmidt, Quan Zou, Limin Jiang

引用次数: 0

Scalable energy-aware VM allocation on cloud data centers through mathematical programming models 通过数学规划模型在云数据中心上进行可伸缩的能源感知虚拟机分配

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-16 DOI: 10.1016/j.future.2025.108011

Roberto Meroni, Jordi Guitart

{"title":"Scalable energy-aware VM allocation on cloud data centers through mathematical programming models","authors":"Roberto Meroni, Jordi Guitart","doi":"10.1016/j.future.2025.108011","DOIUrl":"10.1016/j.future.2025.108011","url":null,"abstract":"<div><div>Cloud data centers are becoming indispensable pillars of modern society, driving AI innovation, global connectivity, and data-driven advancements. As their size and complexity grow, so does the urgency for sustainable and efficient solutions to address operational and environmental challenges. The Virtual Machine (VM) allocation problem lies at the heart of these challenges, directly impacting energy consumption, scalability, and cost-effectiveness. While heuristics are traditionally favored for their fast execution times, they fail to adequately address the complexities of heterogeneous environments and the increasing need for energy-aware solutions. In this work, we redefine the potential of mathematical programming models — traditionally considered impractical due to scalability limitations — by defining a comprehensive VM allocation strategy that embeds the models into scalable algorithms that distribute computational workloads and exploit solver capabilities. This approach achieves linear scalability — an unprecedented milestone for mathematical programming — allowing us to integrate detailed and heterogeneous aspects of the VM allocation problem. The resulting algorithms dramatically outperform state-of-the-art heuristics and metaheuristics in both scalability and solution quality, delivering an average 16% increase in Net Profit, a 54% reduction in Total Energy Consumption, and a more-than-double improvement in Energy Efficiency. Designed to meet the evolving demands of modern Cloud data centers, our algorithms scale efficiently to manage growing workloads, adapt to heterogeneity, and comply with sustainability and regulatory requirements by prioritizing energy efficiency, facilitating the transition to next-generation Cloud environments.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108011"},"PeriodicalIF":6.2,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144656121","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 novel dung beetle optimization algorithm based on Lévy flight and triangle walk 基于lsamvy飞行和三角行走的屎壳郎优化算法

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-15 DOI: 10.1016/j.future.2025.108006

Xin Fan , Hao Wang , Zhikai Zhuo , Shaoyi Bei , Yuanjiang Li , Zixu Liu

{"title":"A novel dung beetle optimization algorithm based on Lévy flight and triangle walk","authors":"Xin Fan , Hao Wang , Zhikai Zhuo , Shaoyi Bei , Yuanjiang Li , Zixu Liu","doi":"10.1016/j.future.2025.108006","DOIUrl":"10.1016/j.future.2025.108006","url":null,"abstract":"<div><div>The dung beetle optimization (DBO) algorithm is a meta-heuristic intelligent optimization algorithm with strong search capability and fast convergence speed. With the increasing complexity of engineering optimization problems, the DBO algorithm may get trapped in local optimal solutions during the later stage of optimization. To address this issue, this paper proposes a multi-strategy improved DBO algorithm, namely “Lévy flight triangle walk dung beetle optimization (LTDBO) algorithm”. By introducing Logistic-cubic hybrid mapping to increase the diversity of initial dung beetle populations and adopting foraging strategies based on triangle walks to enhance the randomness of the search phase and strengthen local search capabilities. In addition, we propose a Lévy flight mechanism with nonlinear weight coefficients that effectively balance local and global search capabilities and avoid getting stuck in local optimal solutions. To verify the effectiveness of the LTDBO method, a comparative experimental analysis was conducted on CEC2017 and CEC2022 test suites, comparing it with 9 classic and 5 variants optimization algorithms. The results show that the LTDBO algorithm has higher convergence accuracy and better robustness.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108006"},"PeriodicalIF":6.2,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664915","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

FabricTCA: A two-level conflict avoidance approach to consortium blockchains FabricTCA：联盟区块链的两级冲突避免方法

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-15 DOI: 10.1016/j.future.2025.108029

Haibo Wu , Hui Liu , Lili Zhang , Yi Sun , Jianhui Li

{"title":"FabricTCA: A two-level conflict avoidance approach to consortium blockchains","authors":"Haibo Wu , Hui Liu , Lili Zhang , Yi Sun , Jianhui Li","doi":"10.1016/j.future.2025.108029","DOIUrl":"10.1016/j.future.2025.108029","url":null,"abstract":"<div><div>Consortium blockchain systems have been recognized as promising infrastructures for data sharing and collaboration among different organizations due to their trustless nature. However, performance bottlenecks have seriously hindered the applications of these systems in many practical scenarios, especially under high transaction volumes. This study identifies two critical factors affecting system performance: intra-block and inter-block transaction conflicts. To address these issues, we present FabricTCA (Fabric Two-level Conflict Avoidance), a method that significantly improves system throughput by mitigating both transaction-level (intra-block) and block-level (inter-block) conflicts. To resolve intra-block transaction conflicts, we propose a scheduling strategy that detects and prevents conflicts by introducing a novel <em>dependency chain</em> data structure and defining the notion of <em>dangerous structures</em>. For inter-block transaction conflicts, we propose a conflicting transaction detection mechanism by constructing a cache during the early ordering service stage, in which detected conflicting transactions will be sent back to clients and resubmitted. Extensive experiments under multiple workload scenarios demonstrate that FabricTCA outperforms state-of-the-art consortium blockchains, such as Hyperledger Fabric (a.k.a. Fabric) and its multiple variants, in terms of throughput, transaction abort rate, transaction execution time, and space utilization. In particular, FabricTCA achieves a 9.51-fold increase in throughput and reduces space consumption by 88.27 % compared to Hyperledger Fabric, showcasing its superior performance. Additionally, FabricTCA demonstrates low storage occupation, strong robustness to attacks and high detection speed.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108029"},"PeriodicalIF":6.2,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664918","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 secure framework for containerized IoT applications in integrated edge–cloud computing environments 集成边缘云计算环境中容器化物联网应用的安全框架

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-13 DOI: 10.1016/j.future.2025.108010

Qifan Deng , Mohammad Goudarzi , Arash Shaghaghi , Majid Sarvi , Rajkumar Buyya

{"title":"A secure framework for containerized IoT applications in integrated edge–cloud computing environments","authors":"Qifan Deng , Mohammad Goudarzi , Arash Shaghaghi , Majid Sarvi , Rajkumar Buyya","doi":"10.1016/j.future.2025.108010","DOIUrl":"10.1016/j.future.2025.108010","url":null,"abstract":"<div><div>The integration of edge and cloud computing combines low latency with high computational power, addressing the constraints of edge resources and high access latency inherent in cloud environments. This is essential for deploying Internet of Things (IoT) applications, which are mainly developed by Containers within these heterogeneous environments. However, the open, multi-user nature of edge computing, compounded by a lack of standardized practices, introduces substantial security challenges with severe economic implications. In response, we propose SecConEC, an economically driven framework designed to secure the deployment and execution of containerized IoT applications. We conducted systematic threat modeling using the STRIDE framework, explicitly incorporating quantitative economic risk assessment to identify and prioritize security threats based on their potential economic impacts. We particularly focus on tampering and resource hijacking threats. SecConEC implements robust yet lightweight mitigation and detection mechanisms informed by the MITRE ATT&CK framework through a Security Information and Event Management (SIEM) system. Also, SecConEC introduces a dynamic, security-aware scheduling mechanism that balances performance and security considerations, proactively mitigating economic risks associated with potential security threats. Extensive performance evaluation shows that SecConEC significantly mitigates prioritized threats, effectively securing IoT application deployment and execution in edge-cloud environments, while maintaining low service latency with a minimal performance overhead of 1.7%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108010"},"PeriodicalIF":6.2,"publicationDate":"2025-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613294","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

Verifiable multi-client blockchain-based dynamic data retrieval 可验证的基于区块链的多客户端动态数据检索

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-12 DOI: 10.1016/j.future.2025.108008

Anqi Jiang, Jianfeng Wang, Wanxuan Huang

{"title":"Verifiable multi-client blockchain-based dynamic data retrieval","authors":"Anqi Jiang, Jianfeng Wang, Wanxuan Huang","doi":"10.1016/j.future.2025.108008","DOIUrl":"10.1016/j.future.2025.108008","url":null,"abstract":"<div><div>Blockchain-based verifiable dynamic searchable symmetric encryption (BV-DSSE) enables users to retrieve data efficiently and publicly verify results in data-updatable decentralized storage scenarios. However, the existing BV-DSSE schemes have to store larger data structures on the blockchain to complete the result verification, which makes the computation and storage overhead on the chain substantial. In addition, to enhance data utilization and ensure privacy retrieval, a multi-client revocable BV-DSSE has been proposed that can revoke access rights for malicious users. However, existing solutions are expensive and challenging to implement in decentralized storage scenarios. This paper proposes an efficient revocable multi-client BV-DSSE scheme with forward and Type III backward security. Firstly, we present a multi-client BV-DSSE relying on multiset hash functions and blockchain, achieving forward and Type III backward security while minimizing storage and computational overhead for users and on-chain operations. Secondly, we propose an efficient malicious user revocation protocol based on updatable encryption technology and introduce a two-tier access control mechanism to prevent unauthorized users from accessing private data. Finally, we implement and compare our proposed scheme with existing state-of-the-art solutions, indicating that our scheme has far lower storage and revocation overheads.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108008"},"PeriodicalIF":6.2,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144611782","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

Flight: A FaaS-based framework for complex and Hierarchical Federated Learning Flight：基于faas的复杂分层联邦学习框架

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-12 DOI: 10.1016/j.future.2025.107998

Nathaniel Hudson , Valerie Hayot-Sasson , Yadu Babuji , Matt Baughman , J. Gregory Pauloski , Ryan Chard , Ian Foster , Kyle Chard

{"title":"Flight: A FaaS-based framework for complex and Hierarchical Federated Learning","authors":"Nathaniel Hudson , Valerie Hayot-Sasson , Yadu Babuji , Matt Baughman , J. Gregory Pauloski , Ryan Chard , Ian Foster , Kyle Chard","doi":"10.1016/j.future.2025.107998","DOIUrl":"10.1016/j.future.2025.107998","url":null,"abstract":"<div><div>Federated Learning (FL) is a decentralized machine learning paradigm where models are trained on distributed devices and are aggregated at a central server. Existing FL frameworks assume simple two-tier network topologies where end devices are directly connected to the aggregation server. While this is a practical mental model, it does not exploit the inherent topology of real-world distributed systems like the Internet-of-Things. We present <span>Flight</span>, a novel FL framework that supports complex hierarchical multi-tier topologies, asynchronous aggregation, and decouples the control plane from the data plane. We compare the performance of <span>Flight</span> against Flower, a state-of-the-art FL framework. Our results show that <span>Flight</span> scales beyond Flower, supporting up to 2048 simultaneous devices, and reduces FL makespan across several models. Finally, we show that <span>Flight</span>’s hierarchical FL model can reduce communication overheads by more than 60%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 107998"},"PeriodicalIF":6.2,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613289","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

Hybrid based QoS-aware selection of web services compositions 基于混合qos的web服务组合选择

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-12 DOI: 10.1016/j.future.2025.108007

Narjes Zahiri, Seyed Morteza Babamir

{"title":"Hybrid based QoS-aware selection of web services compositions","authors":"Narjes Zahiri, Seyed Morteza Babamir","doi":"10.1016/j.future.2025.108007","DOIUrl":"10.1016/j.future.2025.108007","url":null,"abstract":"<div><div>A combination of web services is a set of coordinating services with the aim of achieving a combinatorial function where each service performs a single function. Since each single function can be performed with different quality attributes by the different services, many compositions with different services can exist for performing the same combinatorial function. Among them, the choice of compositions with near-optimal qualities is an NP-Hard problem. The coordinating services constitute structural patterns of <em>sequential, parallel, loop, and conditional</em> in a composition. In this paper, in the first phase, in addition to proposing two new patterns, we use the quality attributes and their aggregation to digest patterns through a <em>dual-based</em> method (node and path-based) leading to a single node or some simple paths of nodes. Afterward, in the second phase, we present a hybrid evolutionary algorithm for selecting the near-optimal digested compositions. To show the effectiveness of the proposed method, we applied it to four compositions; then, compared with others, we evaluated results in terms of the quality attributes and performance indicators. The presented method can be useful for web-based service-oriented systems in that their quality of service (QoS) is a matter of concern.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108007"},"PeriodicalIF":6.2,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613288","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

QoS-aware placement of interdependent services in energy-harvesting-enabled multi-access edge computing 在支持能量收集的多访问边缘计算中，相互依赖服务的qos感知放置

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-11 DOI: 10.1016/j.future.2025.108009

Shuyi Chen , Panagiotis Oikonomou , Zhengchang Hua , Nikos Tziritas , Karim Djemame , Nan Zhang , Georgios Theodoropoulos

{"title":"QoS-aware placement of interdependent services in energy-harvesting-enabled multi-access edge computing","authors":"Shuyi Chen , Panagiotis Oikonomou , Zhengchang Hua , Nikos Tziritas , Karim Djemame , Nan Zhang , Georgios Theodoropoulos","doi":"10.1016/j.future.2025.108009","DOIUrl":"10.1016/j.future.2025.108009","url":null,"abstract":"<div><div>The advent of 5G drives the growth of multi-access edge computing (MEC), a revolutionary paradigm that utilises edge resources to enable low-latency mobile access and support complex service execution. Deploying services across geographically distributed edge nodes challenges providers to optimise performance metrics like end-to-end latency and resource efficiency, impacting user experience, operational cost, and environmental footprint. The energy harvesting (EH) technology provides clean and renewable energy at the edge, promoting the MEC system to minimise the impacts on the environment. However, the integration of EH can introduce energy limits and uncertainty to the powered devices. In the context of service scheduling with data flow dependencies, we propose two offline and heuristic-based service placement algorithms that balance minimising latency and maximising resource efficiency with fast execution. The two algorithms, evaluated in a simulated environment using state-of-the-art workload benchmarks, achieve significant energy consumption improvements while maintaining comparable latency. Based on the designed algorithms, we take a step further by developing an online dynamic resource scheduling and service offloading approach for MEC systems with EH capabilities. Simulation results demonstrate that the proposed strategy effectively utilise the harvested energy while granting a low user-experienced latency and low operational cost.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108009"},"PeriodicalIF":6.2,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613290","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