{"title":"Proceedings of RNDM 2022 ‒ Index of Authors","authors":"","doi":"10.1109/rndm55901.2022.9927641","DOIUrl":"https://doi.org/10.1109/rndm55901.2022.9927641","url":null,"abstract":"","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kristina Kumbria, Denis Demko, D. Nace, A. Tomaszewski, M. Bouhtou, Hanane Biallach
{"title":"VNFs reconfiguration in 5G networks","authors":"Kristina Kumbria, Denis Demko, D. Nace, A. Tomaszewski, M. Bouhtou, Hanane Biallach","doi":"10.1109/RNDM55901.2022.9927655","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927655","url":null,"abstract":"We consider a problem of allocating Virtual Network Functions (VNFs) in 5G networks, treating it as a multiple multidimensional knapsacks reconfiguration problem where items represent VNFs and knapsacks represent servers on which VNFs are able to run. Given an initial and final assignments of items to knapsacks, the task is to define a sequence of steps for moving items from a source knapsack and/or to a destination knapsack. The objective is to minimize the total number of steps in which items are not in the knapsack, which reflects the total time that VNFs are not operational. We derive a non-compact formulation and a new compact formulation of the problem, and evaluate their performance with numerical experiments.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115836435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bálazs Vass, Balázs Brányi, Beáta Éva Nagy, János Tapolcai
{"title":"On the Complexity of Disaster-Aware Network Extension Problems","authors":"Bálazs Vass, Balázs Brányi, Beáta Éva Nagy, János Tapolcai","doi":"10.1109/RNDM55901.2022.9927678","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927678","url":null,"abstract":"In this paper, we deal with the complexity of problems related to finding cost-efficient, disaster-aware cable routes. In particular, we compare two very different versions of the problem. In the first version, only the worst-case scenarios are considered, while in the second, the probability of the disasters is also known, and the aim is to find the most cost-efficient solution in terms of investment cost and risk of a network outage. Worstcase computations allow using efficient computational geometry algorithms, and even large networks can be analyzed. On the other hand, to find the cost-efficient soltuion, a lot of empirical hazard data must be processed, and heavy algorithms must be used. In this paper, we study the benefits and drawbacks of each model. In particular, we define multiple versions of the problem and investigate their complexity.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128441697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BGP Anomaly Detection by the mean of Updates Projection and Spatio-temporal Auto-encoding","authors":"Doris Fejza, Anthony Lambert","doi":"10.1109/RNDM55901.2022.9927587","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927587","url":null,"abstract":"Detecting BGP anomalies is crucial to improve the security and robustness of the Internet's inter-domain routing system. As part of this work, we propose an innovative way for detecting these anomalies, a spatio-temporal auto-encoder with BGP updates projection. We first transform BGP updates into video sequences, then we detect the anomalies in these videos by developing an auto-encoder that leverages both the spatial and the temporal features of the videos. The model successfully detects all the different scenario attacks tested. Finally, as we learn the model for exactly one prefix, we apply transfer learning for generalizing the model for all the other prefixes on the Internet. The experimental results are very significant as they indicate the existence of a very similar behaviour for all the prefixes on the Internet.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125447227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ryuji Munakata, Y. Mori, S. Subramaniam, M. Jinno, H. Hasegawa
{"title":"Spatially–Jointed Flexible Waveband Routing Optical Networks Adopting Shared Path Protection","authors":"Ryuji Munakata, Y. Mori, S. Subramaniam, M. Jinno, H. Hasegawa","doi":"10.1109/RNDM55901.2022.9927712","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927712","url":null,"abstract":"We propose a cost-effective and survivable space-division multiplexing optical network architecture that offers spatially-jointed flexible waveband routing (SJ-FWR) and shared path protection. A strategy to group backup paths by sharing frequency resources is developed to take advantage of the switching capability of SJ-FWR. We also show a network design algorithm based on the backup path grouping strategy. Numerical simulations on several network topologies elucidate that the number of fibers necessary is reduced by up to 25% compared to the dedicated path protection approach and a substantial hardware scale reduction is achieved relative to conventional networks with shared path protection.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"117 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129151515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On joint primary and backup controllers’ placement optimization against node-targeted attacks","authors":"M. Pióro, M. Mycek, A. Tomaszewski, A. Sousa","doi":"10.1109/RNDM55901.2022.9927645","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927645","url":null,"abstract":"Realizing node-to-node connections is a basic functionality of communication networks. In some networks, like SDN, to perform this function nodes must have access to controllers – the devices (installed in selected node locations) necessary in the process of setting-up the connections. Hence, in case of an attack on a set of nodes, not only the directly attacked nodes are eliminated from service, but also the nodes that loose connection with the controllers located at the unaffected nodes). In order to increase network resilience against node-targeted attacks, a number of backup controllers (whose locations do not have to obey the stringent controller-controller and nodecontroller delay constraints that have to be fulfilled by the primary controller locations) can be installed. In the paper we introduce a formulation of a general optimization problem addressing controllers placements that admit backup controllers in addition to primary controllers for increasing the resilience in question. A numerical study shows how the formulation can be used to investigate the benefits from the use of backup controllers.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of RNDM 2022 – Copyright and Reprint Permission","authors":"","doi":"10.1109/rndm55901.2022.9927722","DOIUrl":"https://doi.org/10.1109/rndm55901.2022.9927722","url":null,"abstract":"","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121419591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-Consensus Opinion Model with Byzantine Nodes","authors":"Xinhan Liu, M. Achterberg, R. Kooij","doi":"10.1109/RNDM55901.2022.9927718","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927718","url":null,"abstract":"pinion dynamics models study how the interaction among people influences the opinion formation process. In most opinion dynamics models, only one opinion can exist in the steady state, which is different from the real-life opinion formation process. In 2009, Shao et at. introduced a Non-Consensus Opinion (NCO) model, which allows different opinions to coexist in the steady state. This paper extends the NCO model by introducing a special type of nodes, namely Byzantine nodes, to play the role of dishonest people. We perform simulations on three different network models: small-scale graphs, Erdős-Rényi random graphs and scale-free networks. We find a new steady state for the NCO model: the cyclic steady state. The cyclic behavior of the NCO and Byzantine NCO model is discussed, including a method to generate networks with extremely long cycle lengths. Other properties of the Byzantine NCO model, such as the probability of cyclic behavior and the final opinion distribution, are also studied. We find that the introduction of Byzantine nodes generally steers towards a more balanced steady state and increases the probability of cyclic behavior. The latter is particularly problematic in communication systems, where the large cycle lengths may cause a very slow consensus process and thus stalling future communications.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128756478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hanane Biallach, M. Bouhtou, D. Nace, Mohamed Salah Mimouna
{"title":"An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem","authors":"Hanane Biallach, M. Bouhtou, D. Nace, Mohamed Salah Mimouna","doi":"10.1109/RNDM55901.2022.9927661","DOIUrl":"https://doi.org/10.1109/RNDM55901.2022.9927661","url":null,"abstract":"In this paper, we propose an efficient heuristic for the Virtual Network Function (VNF) reconfiguration problem in the context of 5G network slicing. This problem consists in reallocating the VNFs to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. We rely on the topological sorting algorithm and the Feedback Arc Set (FAS) problem to build our heuristic which is an alternative of an Integer Linear Programming (ILP) solution that we have already proposed in [1]. Experimental results show that our heuristic solves the problem in a few seconds even for large network infrastructures.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"657 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116231337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}