Fang Yang, Tao Ma, Chunlai Ma, Nina Shu, Chao Chang, Chunsheng Liu, Tao Wu, Xingkui Du
{"title":"GenNP: A low-threshold and powerful network performance data generator","authors":"Fang Yang, Tao Ma, Chunlai Ma, Nina Shu, Chao Chang, Chunsheng Liu, Tao Wu, Xingkui Du","doi":"10.1016/j.comnet.2025.111209","DOIUrl":null,"url":null,"abstract":"<div><div>The existing Discrete Event Simulators (DES) cannot meet the demands of modern networks for efficient, accurate, and flexible simulation. Recent <strong>m</strong>achine <strong>l</strong>earning models have demonstrated exceptional capabilities for <strong>e</strong>stimating <strong>n</strong>etwork <strong>p</strong>erformance (MLENP). However, the quality and quantity of available data greatly limit the accuracy and generalizability of ML models. After analyzing the data requirements of MLENP over the past decade and the shortcomings of existing DES, we propose a low-threshold and powerful <strong>n</strong>etwork <strong>p</strong>erformance data <strong>gen</strong>erator (GenNP), and generate a network performance dataset consisting of 10K samples. GenNP, with OMNeT++ and INET at its simulation core, integrates the configuration generation layer, simulation transformation layer, result extraction layer, and result output layer, achieving massive random generation of simulation configurations (networks, traffic, routing protocols, faults) and multi-granularity extraction of network performance data (throughput, drop, delay, jitter, routing table). We validate the robust capabilities of GenNP through a series of simulation experiments across multi-granularity (spatial, temporal), diversity (traffic models, network load, fault types, routing protocols), and efficiency (parallelism).</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111209"},"PeriodicalIF":4.4000,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S138912862500177X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
The existing Discrete Event Simulators (DES) cannot meet the demands of modern networks for efficient, accurate, and flexible simulation. Recent machine learning models have demonstrated exceptional capabilities for estimating network performance (MLENP). However, the quality and quantity of available data greatly limit the accuracy and generalizability of ML models. After analyzing the data requirements of MLENP over the past decade and the shortcomings of existing DES, we propose a low-threshold and powerful network performance data generator (GenNP), and generate a network performance dataset consisting of 10K samples. GenNP, with OMNeT++ and INET at its simulation core, integrates the configuration generation layer, simulation transformation layer, result extraction layer, and result output layer, achieving massive random generation of simulation configurations (networks, traffic, routing protocols, faults) and multi-granularity extraction of network performance data (throughput, drop, delay, jitter, routing table). We validate the robust capabilities of GenNP through a series of simulation experiments across multi-granularity (spatial, temporal), diversity (traffic models, network load, fault types, routing protocols), and efficiency (parallelism).
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.