Simulation Modelling Practice and Theory最新文献

{"title":"VM consolidation steps in cloud computing: A perspective review","authors":"Seyyed Meysam Rozehkhani ,&nbsp;Farnaz Mahan ,&nbsp;Witold Pedrycz","doi":"10.1016/j.simpat.2024.103034","DOIUrl":"10.1016/j.simpat.2024.103034","url":null,"abstract":"<div><div>The proliferation of cloud-based applications, data, and services has significantly transformed digital interactions, driven by the widespread use of powerful smart devices and the expansion of cloud ecosystems. These ecosystems rely on data centers composed of Physical Machines (PMs) and Virtual Machines (VMs). The increasing demand for cloud services has led to extensive use of physical servers, resulting in high energy consumption and inefficient resource utilization. Consequently, optimizing resource allocation and reducing power consumption have become pivotal challenges in data center management. A key strategy to address these challenges is Virtual Machine Consolidation (VMC), which optimizes computing resources by consolidating multiple VMs into fewer PMs. This paper comprehensively reviews the three critical phases involved in VMC: PM detection, VM selection, and VM placement. Through an extensive analysis of literature spanning from 2015 to 2024, this review seeks to provide valuable insights into the current landscape of VMC and its potential ramifications on the performance and sustainability of cloud computing. The main flaw in the articles is that the various authors focused on different assessment metrics when the emphasis should have been on the three primary steps in VMC. The importance of this categorization lies in its ability to provide clarity, organization, and a structured framework for comprehending the intricate landscape of VMC. VMC is a multifaceted undertaking encompassing numerous subtasks. Categorization simplifies this complexity by breaking it down into manageable components. Researchers can address each category individually, potentially leading to more focused and effective solutions.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103034"},"PeriodicalIF":3.5,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142653010","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}

{"title":"Model checking spatial reachability specifications of public transport networks","authors":"Jun Niu ,&nbsp;Jia Wang","doi":"10.1016/j.simpat.2024.103033","DOIUrl":"10.1016/j.simpat.2024.103033","url":null,"abstract":"<div><div>Well-designed spatial configurations of public transport stops and routes in big cities contribute to enhancing daily travel services for citizens, effectively mitigating traffic congestion, and addressing other pertinent challenges. When examining spatial layouts of public transport networks (PTNs), various reachability demands between stops or urban Points of Interest (POIs) are crucial issues should be firstly taken into account. Existing methods to investigate spatial reachability properties of PTNs generally need to construct some evaluation functions, or survey reachability metrics through some network analysis techniques. These methods are often impractical, as the functional relations always cannot be accurately defined, or some global network metrics cannot provide explicit evidences for PTN layout planning or optimization.</div><div>In this paper, we introduce spatial model checking techniques to the formal verification of the reachability specifications of PTN to guarantee the rationality of PTN layout. First, we extend closure space structure by incorporating attribute labeling functions and logical propositions for public transport stops and routes to develop a formal spatial verification model for PTN spatial layout. Second, we propose several novel reachability operators based on the logical operators of the Spatial Logic for Closure Space (SLCS) to facilitate the logical characterization of reachability specifications. Third, we perform the verification of the transformed reachability formulas by the spatial model checker topochecker. Examples demonstrate the effectiveness of our approach and indicate that it can perform automatic, descriptive and comprehensible verification of the reachability properties PTN layouts.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103033"},"PeriodicalIF":3.5,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142652591","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}

{"title":"End-to-end latency upper bounds and service chain deployment algorithm based on industrial internet network","authors":"Min Wang ,&nbsp;Ziyi Gao ,&nbsp;Haoyuan Wang ,&nbsp;Sibo Qiao ,&nbsp;Jinhai Wang","doi":"10.1016/j.simpat.2024.103031","DOIUrl":"10.1016/j.simpat.2024.103031","url":null,"abstract":"<div><div>The diverse service requests in industrial Internet networks require flexible and efficient service chain deployment to ensure the quality of service (QoS). However, current deployment algorithms for service chains are primarily designed to guarantee only low end-to-end latency; they often overlook the amount of service chains that can be accommodated by the network and could lead to severe network load imbalances, significantly reducing service efficiency and causing serious network congestion issues. To address the above issues, we develop a mathematical model of the network topology and service request chains by integrating Network Function Virtualization (NFV) and Software Defined Networking (SDN). Utilizing network calculus theory, we derive the upper bound of end-to-end delay for service chain routing and analyzed the relationship between the upper bound of service chain routing delay and the resource allocation of Virtual Network Function (VNF) nodes. Based on the aforementioned model, we propose a novel service chain deployment algorithm named the Delay-Aware Load-Balanced Routing Algorithm (DLBRA). DLBRA comprehensively considers network traffic load balancing and end-to-end latency of service chains, rationally allocating VNF node resources to complete the determined service chain routing deployment. Experimental results indicate that, compared to the shortest path and load balancing algorithms, DLBRA not only ensures that the end-to-end delay of the service chain meets its QoS requirements, but also effectively reduces network load imbalance, significantly increasing the number of service chain requests that the network can accommodate. Additionally, DLBRA provides tailored deployment guidance for different types of service chains, such as latency-sensitive and data-intensive service chains, ensuring optimal utilization of network resources. This algorithm enhances the efficiency of service chain deployment in industrial internet scenarios and possesses broad application potential in other network environments where delay optimization and load balancing are critical, such as intelligent transportation, cloud computing, and 5G networks.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103031"},"PeriodicalIF":3.5,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142652969","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}

{"title":"Do the sparser access points have less impact on arterial traffic? A microscopic simulation-based study","authors":"Jing Zhao ,&nbsp;Yulan Xia ,&nbsp;Chaojun Wang ,&nbsp;Jairus Odawa","doi":"10.1016/j.simpat.2024.103036","DOIUrl":"10.1016/j.simpat.2024.103036","url":null,"abstract":"<div><div>A dynamic microscopic traffic flow simulation within a ring arterial context was developed to investigate the effects of access point spacing on urban arterial flow under a right-in-right-out access management system. The microscopic traffic flow model, centered on car-following and lane-changing behaviors, was established based on vehicle interactions. The car-following aspect encompasses free driving, car-following behavior, and deceleration and braking states while lane-changing considerations include decision-making and acceptable gap assessment. Experimental scenarios account for arterial traffic density, access traffic demand intensity, average access point spacing, and variation coefficient of access point spacing. The traffic flow and speeds within the ring arterial were evaluated across 5040 operational conditions (equating to 5880 simulation hours). The traffic flow trends and speed variations with density across different access spacing scenarios were analyzed. We made an intriguing discovery: the impact on arterial traffic flow increases with larger average access point spacing, challenging conventional traffic planning recommendations that advocate for greater spacing. Additionally, access traffic minimally affects the overall arterial flow when arterial traffic volume is low. By highlighting these critical insights, this study introduces novel considerations for designing and managing access points.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103036"},"PeriodicalIF":3.5,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142653012","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}

{"title":"A cellular automata model of a laser reproducing laser passive and active Q-Switching","authors":"Francisco Jiménez-Morales ,&nbsp;José-Luis Guisado-Lizar ,&nbsp;José Manuel Guerra","doi":"10.1016/j.simpat.2024.103028","DOIUrl":"10.1016/j.simpat.2024.103028","url":null,"abstract":"<div><div>The Q-switching (QS) phenomenon in lasers refers to the production of high intensity pulses by means of a saturable absorber (passive method) or by modifying the reflectivity or losses of the intracavity optics or mirrors (active method). Theoretically, the QS is studied through the laser rate equations which are useful to predict, at least qualitatively and roughly, the fundamental aspects of laser dynamics. However, specific details such as the spatial distribution of the intensity of the laser emission escape the simplicity of the rate equations. In this work we present a two dimensional cellular automata model (CA) to study the QS phenomenology for both the passive and the active method. To simulate the passive method we consider a spatial distribution of cells whose physical properties emulate those of the saturable adsorbers. And for the active method we introduce a periodic modulation of the lifetime of the photons inside the cavity. We have done numerous numerical simulations that show that despite the simplicity of the evolution rules, the AC model is capable of obtaining the main dynamics of operation of the laser by modifying the system parameters such as the pumping probability and the properties of the absorber.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103028"},"PeriodicalIF":3.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586362","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}

{"title":"Advanced network design for 6G: Leveraging graph theory and slicing for edge stability","authors":"Mantisha Gupta (IEEE Student Member) ,&nbsp;Rakesh Kumar Jha (IEEE Senior Member)","doi":"10.1016/j.simpat.2024.103029","DOIUrl":"10.1016/j.simpat.2024.103029","url":null,"abstract":"<div><div>The advent of 6 G networks will emphasize AR/VR-based tactile internet and touch-enabled services, requiring solutions to address latency and reliability issues in tactile data perception, particularly in edge networking. This article highlights the critical role of graph theory in improving network design for both symmetric and randomly deployed networks, and it emphasizes the importance of network slicing in managing densely connected edge networks. These networks typically consist of numerous edge devices that enable data transfer to higher layers, enhancing connectivity and ensuring network stability within a confined range. The paper compares the accuracy of conventional networks before and after implementing network slicing, with the goal of increasing reliability by dividing the edge network into segments, thereby reducing computation time. The study proposes a method for optimal node segregation and path determination in edge networks using both uniform and random network slicing. Network performance is assessed using metrics such as computation time and node failure rate. The paper concludes that network slicing is the most effective design approach for touch technology interfaces within 6 G and IoT frameworks.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103029"},"PeriodicalIF":3.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142757148","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}

{"title":"Simulation-based evaluation of advanced threat detection and response in financial industry networks using zero trust and blockchain technology","authors":"Clement Daah,&nbsp;Amna Qureshi,&nbsp;Irfan Awan,&nbsp;Savas Konur","doi":"10.1016/j.simpat.2024.103027","DOIUrl":"10.1016/j.simpat.2024.103027","url":null,"abstract":"<div><div>The financial sector is increasingly facing advanced cyber threats, necessitating a shift from traditional security measures to more dynamic frameworks. This study presents a novel integration of Zero Trust architecture with hybrid access control system and blockchain technology to enhance security in financial institutions. Zero Trust enforces continuous authentication and dynamic access controls, while blockchain secures digital identities and transaction logs through its immutable ledger, ensuring data integrity and non-repudiation. The proposed framework, evaluated using OMNeT++ simulations enhanced by Ethereum-Ganache, shows improved detection accuracy, reduced false positives, and increased resistance to insider threats and other attacks. It also strengthens compliance with regulatory requirements through robust audit trails, providing enhanced protection for sensitive financial data.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103027"},"PeriodicalIF":3.5,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142572104","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}

{"title":"Simulation-based adaptive optimization for passenger flow control measures at metro stations","authors":"Yiqi Zhou ,&nbsp;Maohua Zhong ,&nbsp;Zhongwen Li ,&nbsp;Xuan Xu ,&nbsp;Fucai Hua ,&nbsp;Rongliang Pan","doi":"10.1016/j.simpat.2024.103021","DOIUrl":"10.1016/j.simpat.2024.103021","url":null,"abstract":"<div><div>Effective passenger flow control measures are essential for the safe operation of metro stations. Existing in-station control measures include adjusting the operation mode of escalators and setting up temporary fences. However, in practice, metro operators often adopt fixed operation modes during fixed periods, indicating that the current passenger flow control measures at metro stations are overly rigidified. Therefore, developing an adaptive control strategy to constantly balance the wildly fluctuating passenger flow and optimize the operation performance is a key issue in current research. In this study, transportation efficiency and congestion risk are selected as evaluation objectives for passenger transportation risk, and passenger flow feature, station structure, and passenger flow control measures are considered key influential factors. Subsequently, an adaptive optimization method integrating simulation and data interpolation is proposed. The software Legion is used to conduct 150 orthogonal simulations, and prediction models for passenger transportation risk are obtained by performing data interpolation on the simulation results. Finally, taking a certain metro station as a case study, the optimal passenger flow control strategy under any passenger flow composition is obtained by scenario acquisition, risk identification, and adaptive decision-making. The results show that setting up temporary fences can reduce the passenger density near the fare gates, while adjusting the running direction of escalators can reduce overcrowding on the platform. Under varying passenger flow composition, the optimal strategy for the current scenario can be obtained, controlling passenger transportation risk within an acceptable range and providing assistance for metro operators in decision-making.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103021"},"PeriodicalIF":3.5,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142535349","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}

{"title":"Dual-timescale resource management for multi-type caching placement and multi-user computation offloading in Internet of Vehicle","authors":"Dun Cao ,&nbsp;Bo Peng ,&nbsp;Yubin Wang ,&nbsp;Fayez Alqahtani ,&nbsp;Jinyu Zhang ,&nbsp;Jin Wang","doi":"10.1016/j.simpat.2024.103025","DOIUrl":"10.1016/j.simpat.2024.103025","url":null,"abstract":"<div><div>In Internet of Vehicle (IoV), edge computing can effectively reduce task processing delays and meet the real-time needs of connected-vehicle applications. However, since the requirements for caching and computing resources vary across heterogeneous vehicle requests, a new challenge is posed on the resource management in the three-tier cloud–edge–end architecture, particularly when multi users offload tasks in the same time. Our work comprehensively considers various scenarios involving the deployment of multiple caching types from multi-users and the distinct time scales of offloading and updating, then builds a joint optimization caching placement, computation offloading and computational resource allocation model, aiming to minimize overall latency. Meanwhile, to better solving the model, we propose the Multi-node Collaborative Caching, Offloading, and Resource Allocation Algorithm (MCCO-RAA). MCCO-RAA utilizes dual time scales to optimize the problem: employing a Bellman optimization idea-based multi-node collaborative greedy caching placement strategy at large time scales, and a computational offloading and resource allocation strategy based on a two-tier iterative Deep Deterministic Policy Gradient (DDPG) and cooperative game at small time scales. Experimental results demonstrate that our proposed scheme achieves a 28% reduction in overall system latency compared to the baseline scheme, with smoother latency variations under different parameters.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103025"},"PeriodicalIF":3.5,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142572105","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}

{"title":"Underground rescue path planning based on a comprehensive risk assessment approach","authors":"Li Zhou ,&nbsp;Jinqiu Zhao ,&nbsp;Binglei Xie ,&nbsp;Yong Xu","doi":"10.1016/j.simpat.2024.103022","DOIUrl":"10.1016/j.simpat.2024.103022","url":null,"abstract":"<div><div>Fire incidents in underground environments, such as subway stations and shopping malls, pose significant hazards due to restricted ventilation and confined spaces. These conditions complicate rescue operations, particularly given the unpredictable nature of fires. Effective integration of fire risk assessment into rescue path planning is essential for ensuring both safety and operational efficiency. However, fire risk is inherently complex, varying across both temporal and spatial dimensions, and accurate assessment depends on precise fire situation inference. Despite advancements in fire simulation technologies, inconsistencies in geometric structures between computational units limit seamless integration with path planning models. Consequently, many existing studies rely on simplistic and less reliable linear fire inference models, compromising the safety of rescue operations. This paper addresses these challenges by proposing an underground rescue path planning method based on a comprehensive fire risk assessment, aimed at enhancing both safety and operational efficiency. A fire risk assessment approach, driven by fire situation inference, is introduced, employing a novel grid-matching transformation to capture the spatio-temporal dynamics of fire conditions using high-precision simulation software. Additionally, an improved A* algorithm is developed for real-time rescue path optimization, minimizing path risk based on the results of the risk assessment. The proposed method is validated through a detailed case study, demonstrating its effectiveness and reliability.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103022"},"PeriodicalIF":3.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142535350","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}