Oracle-based data generation for highly efficient digital twin network training

None Eliyahu Sason, None Yackov Lubarsky, None Alexei Gaissinski, None Eli Kravchik, None Pavel Kisilev
{"title":"Oracle-based data generation for highly efficient digital twin network training","authors":"None Eliyahu Sason, None Yackov Lubarsky, None Alexei Gaissinski, None Eli Kravchik, None Pavel Kisilev","doi":"10.52953/aweu6345","DOIUrl":null,"url":null,"abstract":"Recent advances in Graph Neural Networks (GNNs) has opened new capabilities to analyze complex communication systems. However, little work has been done to study the effects of limited data samples on the performance of GNN-based systems. In this paper, we present a novel solution to the problem of finding an optimal training set for efficient training of a RouteNet-Fermi GNN model. The proposed solution ensures good model generalization to large previously unseen networks under strict limitations on the training data budget and training topology sizes. Specifically, we generate an initial data set by emulating the flow distribution of large networks while using small networks. We then deploy a new clustering method that efficiently samples the above generated data set by analyzing the data embeddings from different Oracle models. This procedure provides a very small but information-rich training set. The above data embedding method translates highly heterogeneous network samples into a common embedding spac, wherein the samples can be easily related to each other. The proposed method outperforms state-of-the-art approaches, including the winning solutions of the 2022 Graph Neural Networking challenge.","PeriodicalId":93013,"journal":{"name":"ITU journal : ICT discoveries","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITU journal : ICT discoveries","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52953/aweu6345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recent advances in Graph Neural Networks (GNNs) has opened new capabilities to analyze complex communication systems. However, little work has been done to study the effects of limited data samples on the performance of GNN-based systems. In this paper, we present a novel solution to the problem of finding an optimal training set for efficient training of a RouteNet-Fermi GNN model. The proposed solution ensures good model generalization to large previously unseen networks under strict limitations on the training data budget and training topology sizes. Specifically, we generate an initial data set by emulating the flow distribution of large networks while using small networks. We then deploy a new clustering method that efficiently samples the above generated data set by analyzing the data embeddings from different Oracle models. This procedure provides a very small but information-rich training set. The above data embedding method translates highly heterogeneous network samples into a common embedding spac, wherein the samples can be easily related to each other. The proposed method outperforms state-of-the-art approaches, including the winning solutions of the 2022 Graph Neural Networking challenge.
基于oracle的数据生成,用于高效的数字孪生网络训练
图神经网络(gnn)的最新进展开辟了分析复杂通信系统的新能力。然而,很少有人研究有限数据样本对基于gnn的系统性能的影响。本文针对RouteNet-Fermi GNN模型有效训练的最优训练集问题,提出了一种新的解决方案。该解决方案在严格限制训练数据预算和训练拓扑大小的情况下,确保了对以前未见过的大型网络的良好模型泛化。具体来说,我们通过在使用小型网络的同时模拟大型网络的流量分布来生成初始数据集。然后,我们部署了一种新的聚类方法,通过分析来自不同Oracle模型的数据嵌入,有效地对上述生成的数据集进行采样。这个程序提供了一个非常小但信息丰富的训练集。上述数据嵌入方法将高度异构的网络样本转化为一个公共的嵌入空间,其中样本可以很容易地相互关联。所提出的方法优于最先进的方法,包括2022年图神经网络挑战赛的获奖解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信