首页期刊导航|ACM Transactions on Modeling and Computer Simulation
期刊信息/Journal information
ACM Transactions on Modeling and Computer Simulation
Association for Computing Machinery
ACM Transactions on Modeling and Computer Simulation

Association for Computing Machinery

季刊

1049-3301

ACM Transactions on Modeling and Computer Simulation/Journal ACM Transactions on Modeling and Computer SimulationEISCIISTP
正式出版
收录年代

    Introduction to the Special Issue on QEST 2022, Part 2

    Erika AbrahamMarco Paolieri
    1-2页
    查看更多>>摘要：The QEST conference series (International Conference on Quantitative Evaluation of SysTems) has a long and rich history spanning over 20 years, with a focus on evaluation and verification of computer systems and networks through stochastic models and measurements. The 19th edition (QEST 2022) was hosted during September 13-16, 2022 in Warsaw, Poland and co-located with CONCUR, FORMATS, and FMICS as part of the CONFEST 2022 event. This special issue contains extended versions of the best papers of QEST 2022. The guest editors selected these papers based on the feedback provided by the QEST 2022 Program Committee; revised and extended manuscripts were reviewed again by at least three experts.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks

    PEDRO R. D'ARGENIOJUAN FRAIREARND HARTMANNSFERNANDO RAVERTA...
    10.1-10.26页
    查看更多>>摘要：In delay-tolerant networks (DTNs) with uncertain contact plans, the communication episodes and their reliabilities are known a priori. To maximise the end-to-end delivery probability, a bounded network-wide number of message copies are allowed. The resulting multi-copy routing optimization problem is naturally modelled as a Markov decision process with distributed information. In this paper, we provide an in-depth comparison of three solution approaches: statistical model checking with scheduler sampling, the analytical RUCoP algorithm based on probabilistic model checking, and an implementation of concurrent Q-learning. We use an extensive benchmark set comprising random networks, scalable binomial topologies, and realistic ring-road low Earth orbit satellite networks. We evaluate the obtained message delivery probabilities as well as the computational effort. Our results show that all three approaches are suitable tools for obtaining reliable routes in DTN, and expose a tradeoff between scalability and solution quality.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Computation Offloading and Band Selection for IoT Devices in Multi-Access Edge Computing

    KAUSTABHA RAYANSUMAN BANERJEE
    11.1-11.28页
    查看更多>>摘要：The advent of Multi-Access Edge Computing (MEC) has enabled service providers to mitigate high network latencies often encountered in accessing cloud services. The key idea of MEC involves service providers deploying containerized application services on MEC servers situated near Internet-of-Things (IoT) device users. The users access these services via wireless base stations with ultra low latency. Computation tasks of IoT devices can then either be executed locally on the devices or on the MEC servers. A key cornerstone of the MEC environment is an offloading policy utilized to determine whether to execute computation tasks on IoT devices or to offload the tasks to MEC servers for processing. In this work, we propose a two-phase Probabilistic Model Checking-based offloading policy catering to IoT device user preferences. The first stage evaluates the tradeoffs between local vs. server execution while the second stage evaluates the tradeoffs between choice of wireless communication bands for offloaded tasks.We present experimental results in practical scenarios on data gathered from an IoT test-bed setup with benchmark applications to show the benefits of an adaptive preference-aware approach over conventional approaches in the MEC offloading context.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Verifier's Dilemma in Proof-of-Work Public Blockchains: A Quantitative Analysis

    DARIA SMUSEVAANDREA MARINSABINA ROSSIAAD VAN MOORSEL...
    12.1-12.24页
    查看更多>>摘要：A blockchain is an immutable ledger driven by a distributed consensus protocol. In public blockchains, such as Bitcoin and Ethereum Classic, consensus is established through a computational effort called Proof-of-Work (PoW). Special users called miners contribute to the PoWin exchange for a fee and also verify the data stored in blocks mined by the otherminers. Here iswhere the Verifier's Dilemma emerges. Verification of blocks does not receive a reward, and to maximise their profits, miners may be incentivised to forego verifying blocks and to only invest their resources in PoW. In this article, we study the Verifier's Dilemma and a possible countermeasure consisting of the injection of invalid blocks using a quantitative model based on Markovian process algebra. To avoid the state space explosion problem, we study the underlying Markov chain by using a lumping that allows us to derive closed-form solutions for interesting performance indices. The analysis demonstrates the circumstances under which non-verifying miners gain fees higher than those of verifying miners. The model also allows us to derive the optimal rate at which invalid blocks must be injected so that skipping the verifying phase becomes economically disadvantageous whereas the throughput of the blockchain is only minimally reduced. The impact on miners' rewards and overall performance is also assessed.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Introduction to the Special Issue on PADS 2023

    Dong JinChristopher Carothers
    13.1-13.3页
    查看更多>>摘要：The Principles of Advanced Discrete Simulation (PADS) special issue is based on the selected papers from the 2023 ACMSIGSIM-PADS Conference, the flagship conference of the ACM's Special Interest Group on Simulation and Modeling (SIGSIM). Building on 37 years of history and a reputation for high-quality papers, the 2023 ACM SIGSIM-PADS Conference was held in Orlando, Florida, from June 21 to June 23, 2023, as part of the ACM Federated Computing Research Conference (FCRC). Dong (Kevin) Jin and Christopher Carothers are the guest editors of this special issue. They also served as the conference program chairs and were responsible for the conference proceedings.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Hybrid PDES Simulation of HPC Networks Using Zombie Packets

    ELKIN CRUZ-CAMACHOKEVIN BROWNXIN WANGXIONGXIAO XU...
    14.1-14.19页
    查看更多>>摘要：Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. We present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    SymBChainSim: A Novel Simulation System for Info-Symbiotic Blockchain Management

    GEORGIOS DIAMANTOPOULOSRAMI BAHSOONNIKOS TZIRITASGEORGIOS THEODOROPOULOS...
    15.1-15.25页
    查看更多>>摘要：Despite the recent increase in the popularity of blockchain, the technology suffers from the trilemma tradeoff between security, decentralisation and scalability, prohibiting adoption and limiting the efficiency and effectiveness of the induced system. Addressing the trilemma tradeoff calls for dynamic management and configuration of the blockchain system. In particular, choosing an effective and efficient consensus protocol for balancing the trilemma tradeoff when inducing the blockchain-based system is acknowledged to be a challenging problem, given the dynamic and complex nature of the blockchain environment. DDDAS approaches are particularly suitable for tackling this challenge. In previous work, the authors presented a novel DDDAS-based blockchain architecture and demonstrated that it offers a promising approach for dynamically adjusting the parameters of a blockchain system to optimise for the tradeoff. This article presents a novel simulation tool that can support and satisfy the DDDAS requirements for a dynamically re-configurable blockchain system. The tool supports the simulation and the dynamic switching of consensus protocols, analysing their trilemma tradeoff. The simulator design is modular and allows the implementation and analysis of a wide range of consensus protocols and their implementation scenarios. The article also presents a quantitative evaluation of the tool.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Enhancing P4-Based Network Emulation Fidelity Through a Lightweight Virtual Time System and Application Evaluation

    GONG CHENZHENG HUYANFENG QUDONG JIN...
    16.1-16.24页
    查看更多>>摘要：P4 serves as a programming language for configuring flexible and programmable network data planes, facilitating the development of custom protocols and programmable switches, and driving innovation in softwaredefined networking and network function virtualization. While the Linux container based network emulator, Mininet, coupled with the BMv2 software P4 switch, is widely used for rapid prototyping of P4-based applications, BMv2's diminished performance raises fidelity concerns under high traffic and large network scenarios. In this paper, we introduce a lightweight virtual time system integrated into Mininet with BMv2 to enhance fidelity and scalability. By applying a time dilation factor (TDF) to interactions between containers and the physical machine, we optimize the emulated P4 network's perceived speed from the application processes' perspective. System evaluation demonstrates accurate emulation of significantly larger networks under high loads with minimal system overhead. We showcase our system's utility through two network applications: an emulation of a TCP SYN flood attack and an ECMP load balancer. Evaluating against a production-grade software switch, Open vSwitch, and a physical testbed, we highlight the virtual time system's improvement in temporal fidelity despite the observed performance degradation in BMv2 software switches.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery

    Preventing Workload Interference with Intelligent Routing and Flexible Job Placement Strategy on Dragonfly System

    XIN WANGYAO KANGZHILING LAN
    17.1-17.22页
    查看更多>>摘要：Dragonfly is an indispensable interconnect topology for exascale high-performance computing (HPC) systems. To link tens of thousands of compute nodes at a reasonable cost, Dragonfly shares network resources with the entire system such that network bandwidth is not exclusive to any single application. Since HPC systems are usually shared among multiple co-running applications at the same time, network competition between co-existing workloads is inevitable. This network contention manifests as workload interference, in which a job's network communication can be severely delayed by other jobs. This study presents a comprehensive examination of leveraging intelligent routing and flexible job placement to mitigate workload interference on Dragonfly systems. Specifically, we leverage the parallel discrete event simulation toolkit, the Structural Simulation Toolkit (SST), to investigate workload interference on Dragonfly with three contributions. We first present Q-adaptive routing, a multi-agent reinforcement learning routing scheme, and a flexible job placement strategy that, together, can mitigate workload interference based on workload communication characteristics. Next, we enhance SST with Q-adaptive routing and develop an automatic module that serves as the bridge between the SST and HPC job scheduler for automatic simulation configuration and automated simulation launching. Finally, we extensively examine workload interference under various job placement and routing configurations.
      原文链接:
    • NETL
    • NSTL
    • Assoc Computing Machinery