Topology reconstruction in telecommunication networks: Embedding operations research within deep learning

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-04-01 Epub Date: 2024-12-26 DOI:10.1016/j.cor.2024.106960
Tobias Engelhardt Rasmussen , Siv Sørensen , David Pisinger , Thomas Martini Jørgensen , Andreas Baum
{"title":"Topology reconstruction in telecommunication networks: Embedding operations research within deep learning","authors":"Tobias Engelhardt Rasmussen ,&nbsp;Siv Sørensen ,&nbsp;David Pisinger ,&nbsp;Thomas Martini Jørgensen ,&nbsp;Andreas Baum","doi":"10.1016/j.cor.2024.106960","DOIUrl":null,"url":null,"abstract":"<div><div>We consider the task of reconstructing the cabling arrangements of <em>last-mile</em> telecommunication networks using customer modem data. In such networks, downstream data traverses from a source node down through the branches of the tree network to a set of customer leaf nodes. Each modem monitors the quality of received data using a series of continuous data metrics. The state of the data, when it reaches a modem, is contingent upon the path it traverses through the network and can be affected by, e.g., corroded cable connectors.</div><div>We train an encoder to identify irregular inherited <em>events</em> in modem quality data, such as network faults, and encode them as discrete data sequences for each modem. Specifically, the encoding scheme is obtained by using unsupervised contrastive learning, where a Siamese neural network is trained on a positive (true) topology, its modem data, and a set of negative (false) topologies. The weights of the Siamese network are continuously updated based on a new modified version of the Maximum Parsimony optimality criterion. This approach essentially integrates an optimization problem directly into a deep learning loss function.</div><div>We evaluate the encoder’s performance on simulated data instances with randomly added events. The performance of the encoder is tested both on its ability to extract and encode events as well as whether the encoded data sequences lead to accurate topology reconstructions under the modified version of the Maximum Parsimony optimality criterion.</div><div>Promising computational results are reported for trees with a varying number of internal nodes, up to a maximum of 20. The encoder identifies a high percentage of simulated events, leading to nearly perfect topology reconstruction. Overall, these results affirm the potential of embedding an optimization problem into a deep learning loss function, unveiling many interesting topics for further research.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106960"},"PeriodicalIF":4.3000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004325","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/26 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the task of reconstructing the cabling arrangements of last-mile telecommunication networks using customer modem data. In such networks, downstream data traverses from a source node down through the branches of the tree network to a set of customer leaf nodes. Each modem monitors the quality of received data using a series of continuous data metrics. The state of the data, when it reaches a modem, is contingent upon the path it traverses through the network and can be affected by, e.g., corroded cable connectors.
We train an encoder to identify irregular inherited events in modem quality data, such as network faults, and encode them as discrete data sequences for each modem. Specifically, the encoding scheme is obtained by using unsupervised contrastive learning, where a Siamese neural network is trained on a positive (true) topology, its modem data, and a set of negative (false) topologies. The weights of the Siamese network are continuously updated based on a new modified version of the Maximum Parsimony optimality criterion. This approach essentially integrates an optimization problem directly into a deep learning loss function.
We evaluate the encoder’s performance on simulated data instances with randomly added events. The performance of the encoder is tested both on its ability to extract and encode events as well as whether the encoded data sequences lead to accurate topology reconstructions under the modified version of the Maximum Parsimony optimality criterion.
Promising computational results are reported for trees with a varying number of internal nodes, up to a maximum of 20. The encoder identifies a high percentage of simulated events, leading to nearly perfect topology reconstruction. Overall, these results affirm the potential of embedding an optimization problem into a deep learning loss function, unveiling many interesting topics for further research.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电信网络拓扑重构:深度学习中嵌入运筹学研究
我们考虑了利用客户调制解调器数据重构最后一英里电信网布线安排的任务。在这样的网络中,下游数据从源节点通过树形网络的分支向下遍历到一组客户叶节点。每个调制解调器使用一系列连续的数据度量来监视接收到的数据的质量。当数据到达调制解调器时,它的状态取决于它在网络中穿越的路径,并可能受到腐蚀的电缆连接器等因素的影响。我们训练一个编码器来识别调制解调器质量数据中的不规则继承事件,例如网络故障,并将它们编码为每个调制解调器的离散数据序列。具体来说,编码方案是通过使用无监督对比学习获得的,其中Siamese神经网络在一个正(真)拓扑、它的调制解调器数据和一组负(假)拓扑上进行训练。Siamese网络的权值基于一个新的修改版本的Maximum Parsimony最优性准则不断更新。这种方法本质上将优化问题直接集成到深度学习损失函数中。我们在随机添加事件的模拟数据实例上评估编码器的性能。测试了编码器的性能,包括其提取和编码事件的能力,以及编码的数据序列是否能在改进版本的最大简约最优性准则下导致准确的拓扑重构。对于具有不同数量的内部节点(最多20个)的树,报告了有希望的计算结果。编码器识别高百分比的模拟事件,导致几乎完美的拓扑重建。总的来说,这些结果肯定了将优化问题嵌入深度学习损失函数的潜力,揭示了许多值得进一步研究的有趣主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Beware of the classical benchmark instances for the Traveling Salesman Problem with Time Windows A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion A memory-enhanced Greedy Randomized Adaptive Search Procedure for the Multi-Pickup and Delivery Problem with Time Windows A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods Constraint programming approaches for stochastic Resource-Constrained Project Scheduling Problem subject to disruptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1