TY - CHAP AU - Babarczi, Péter AU - Mogyorósi, Ferenc AU - Pašić, Alija ED - IEEE, , TI - Intelligent Control Plane Design for Virtual Software-Defined Networks T2 - 2023 13th International Workshop on Resilient Networks Design and Modeling (RNDM) PB - IEEE CY - Piscataway (NJ) SN - 9798350327359 PY - 2023 PG - 8 DO - 10.1109/RNDM59149.2023.10293099 UR - https://m2.mtmt.hu/api/publication/34238494 ID - 34238494 N1 - UNIBERG Conference code: 194041 Export Date: 20 December 2023 Funding details: NTP-NFTÖ-22-B-0141, NTP-NFTÖ-22-B-0225 Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFI, FK 20 Funding details: Nemzeti Kutatási, Fejlesztési és Innovaciós Alap, NKFIA, KDP-2021 Funding text 1: Hungarian Academy of Sciences. Project no. C1445813 has been implemented with the support provided by the Ministry of Culture and Innovation of Hungary from the National Research, Development and Innovation Fund, financed under the KDP-2021 funding scheme. The work of F. Mogyorósi and A. Pasˇić was supported by EMET under grant NTP-NFTÖ-22-B-0225 and NTP-NFTÖ-22-B-0141. Funding text 2: This work was supported by Projects no. 134604 and no. 137698 that have been implemented with the support provided by the National Research, Development and Innovation Fund of Hungary, financed under the FK 20 and PD 21 funding schemes, respectively. The work of A. Pasˇić was supported by the János Bolyai Research Scholarship of the LA - English DB - MTMT ER - TY - CHAP AU - Tapolcai, János AU - Babarczi, Péter AU - Ho, P-H AU - Rónyai, Lajos TI - Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences T2 - IEEE INFOCOM 2023 - IEEE Conference on Computer Communications PB - IEEE CY - Piscataway (NJ) SN - 9798350334142 PY - 2023 SP - 1 EP - 10 PG - 10 DO - 10.1109/INFOCOM53939.2023.10229023 UR - https://m2.mtmt.hu/api/publication/33790929 ID - 33790929 N1 - Export Date: 2 October 2023 CODEN: PINFE Correspondence Address: Tapolcai, J.; Budapest University of Technology and Economics, Hungary; email: tapolcai@tmit.bme.hu LA - English DB - MTMT ER - TY - CHAP AU - Babarczi, Péter AU - Rétvári, Gábor AU - Rónyai, Lajos AU - Tapolcai, János TI - Routing on the Shortest Pairs of Disjoint Paths T2 - 2022 IFIP Networking Conference (IFIP Networking) PB - IEEE CY - Piscataway (NJ) SN - 9783903176485 PY - 2022 PG - 9 DO - 10.23919/IFIPNetworking55013.2022.9829760 UR - https://m2.mtmt.hu/api/publication/33091437 ID - 33091437 N1 - Budapest University of Technology and Economics, Faculty of Electrical Engineering and Informatics, Department of Telecommunications and Media Informatics, Muegyetem rkp. 3, Budapest, H-1111, Hungary Institute for Computer Science and Control, Institute of Mathematics, Budapest University of Technology and Economics, Eötvös Lorand Research Network, Department of Algebra, Muegyetem rkp. 3, Budapest, H-1111, Hungary Export Date: 13 September 2022 Funding Agency and Grant Number: National Research, Development and Innovation Fund of Hungary [134604, 128062]; NKFIH/OTKA Project [135606]; MTA-BME Information Systems Research Group; MTA-BME Network Softwarization Research Group; Hungarian Ministry of Innovation and Technology NRDI Office Funding text: This work was supported in part by Project no. 134604 and Project no. 128062 that have been implemented with the support provided by the National Research, Development and Innovation Fund of Hungary, financed under the FK_20 and K_18 funding schemes, respectively. G. Retvari was also funded by the NKFIH/OTKA Project #135606, the MTA-BME Information Systems Research Group and the MTA-BME Network Softwarization Research Group. The research of L. R ' onyai was supported in part by the Hungarian Ministry of Innovation and Technology NRDI Office within the framework of the Artificial Intelligence National Laboratory Program. AB - Recent trends point towards communication networks will be multi-path in nature to increase failure resilience, support load-balancing and provide alternate paths for congestion avoidance. We argue that the transition from single-path to multi-path routing should be as seamless as possible in order to lower the deployability barrier for network operators. Therefore, in this paper we are focusing on the problem of routing along the shortest pairs of disjoint paths between each source-destination pair over the currently deployed link-state routing architecture. We show that the union of disjoint path-pairs towards a given destination has a special structure, and we propose an efficient tag encoding scheme which requires only one extra forwarding table entry per router per destination. Our numerical evaluations demonstrate that in real-world topologies usually only 4 bit tags are sufficient in the packet headers to route on the disjoint path-pairs. Finally, we show that our tags automatically encode additional paths beyond the shortest pair of disjoint paths, including the shortest paths themselves, which enables incremental deployment of the proposed method. LA - English DB - MTMT ER - TY - JOUR AU - Mogyorósi, Ferenc AU - Babarczi, Péter AU - Zerwas, J. AU - Blenk, A. AU - Pašić, Alija TI - Resilient Control Plane Design for Virtualized 6G Core Networks JF - IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT J2 - IEEE T NETW SERV MANAG VL - 19 PY - 2022 IS - 3 SP - 2453 EP - 2467 PG - 15 SN - 1932-4537 DO - 10.1109/TNSM.2022.3193241 UR - https://m2.mtmt.hu/api/publication/33049046 ID - 33049046 N1 - Department of Telecommunications and Media Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Műegyetem rkp. 3, Budapest, Hungary Chair of Communication Networks, Technical University of Munich, Germany Siemens AG, Corporate Technology, Munich, Germany Export Date: 12 August 2022 AB - With the advent of 6G and its mission-critical and tactile Internet applications running in a virtualized environment on the same physical infrastructure, even the shortest service disruptions have severe consequences for thousands of users. Therefore, the network hypervisors, which enable such virtualization, should tolerate failures or be able to adapt to sudden traffic fluctuations instantaneously, i.e., should be well-prepared for such unpredictable environmental changes. In this paper, we propose a latency-aware dual hypervisor placement and control path design method, which protects against single-link and hypervisor failures and is ready for unknown future changes. We prove that finding the minimum number of hypervisors is not only NP-hard, but also hard to approximate. We propose optimal and heuristic algorithms to solve the problem. We conduct thorough simulations to demonstrate the efficiency of our method on real-world optical topologies, and show that with an appropriately selected representative set of possible future requests, we are not only able to approach the maximum possible acceptance ratio but also able to mitigate the need of frequent hypervisor migrations for most realistic latency constraints. LA - English DB - MTMT ER - TY - CHAP AU - Alberto, Martínez Alba AU - Babarczi, Péter AU - Andreas, Blenk AU - Mu, He AU - Patrick, Kalmbach AU - Johannes, Zerwas AU - Wolfgang, Kellerer ED - Lu, Su ED - Dejun, (DJ) Yang TI - Modeling the Cost of Flexibility in Communication Networks T2 - 2021 IEEE International Conference on Computer Communications (IEEE INFOCOM 2021) PB - IEEE CY - Piscataway (NJ) SN - 9780738112817 PY - 2021 SP - 1 EP - 10 PG - 10 DO - 10.1109/INFOCOM42981.2021.9488900 UR - https://m2.mtmt.hu/api/publication/31899008 ID - 31899008 AB - Communication networks are evolving towards a more adaptive and reconfigurable nature due to the evergrowing demands they face. A framework for measuring network flexibility has been proposed recently, but the cost of rendering communication networks more flexible has not yet been mathematically modeled. As new technologies such as software-defined networking (SDN), network function virtualization (NFV), or network virtualization (NV) emerge to provide network flexibility, a way to estimate and compare the cost of different implementation options is needed. In this paper, we present a comprehensive model of the cost of a flexible network that takes into account its transient and stationary phases. This allows network researchers and operators to not only qualitatively argue about their new flexible network solutions, but also to analyze their cost for the first time in a quantitative way. LA - English DB - MTMT ER - TY - JOUR AU - Babarczi, Péter TI - Resilient Control Plane Design for Virtual Software Defined Networks JF - IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT J2 - IEEE T NETW SERV MANAG VL - 18 PY - 2021 IS - 3 SP - 2557 EP - 2569 PG - 13 SN - 1932-4537 DO - 10.1109/TNSM.2021.3063204 UR - https://m2.mtmt.hu/api/publication/31898773 ID - 31898773 N1 - Cited By :1 Export Date: 6 February 2022 Correspondence Address: Babarczi, P.; Department of Telecommunications and Media Informatics, Hungary; email: babarczi@tmit.bme.hu Funding details: Alexander von Humboldt-Stiftung, AvH Funding text 1: Manuscript received September 1, 2020; revised November 30, 2020 and February 7, 2021; accepted February 26, 2021. Date of publication March 2, 2021; date of current version September 9, 2021. The work of P. Babarczi was supported in part by Project no. 134604 that has been implemented with the support provided by the National Research, Development and Innovation Fund of Hungary, financed under the FK_20 funding scheme, and in part by the Alexander von Humboldt Foundation. The associate editor coordinating the review of this article and approving it for publication was C. Mas. LA - English DB - MTMT ER - TY - JOUR AU - Pašić, Alija AU - Girao-Silva, Rita AU - Mogyorósi, Ferenc AU - Vass, Balázs AU - Gomes, Teresa AU - Babarczi, Péter AU - Revisnyei, Péter AU - Tapolcai, János AU - Rak, Jacek TI - eFRADIR: An Enhanced FRAmework for DIsaster Resilience JF - IEEE ACCESS J2 - IEEE ACCESS VL - 9 PY - 2021 SP - 13125 EP - 13148 PG - 24 SN - 2169-3536 DO - 10.1109/ACCESS.2021.3050923 UR - https://m2.mtmt.hu/api/publication/31829886 ID - 31829886 N1 - Department of Telecommunication and Media Informatics, Faculty of Electrical Engineering and Informatics (VIK), MTA-BME Future Internet Research Group, Budapest University of Technology and Economics (BME), Budapest, 1111, Hungary Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, 3030-290, Portugal Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), Coimbra, 3030-290, Portugal Faculty of Electronics, Telecommunications, and Informatics, Gdańsk University of Technology (GUT), Gdańsk, 80-233, Poland Cited By :3 Export Date: 4 February 2022 Correspondence Address: Pasic, A.; Department of Telecommunication and Media Informatics, Hungary; email: pasic@tmit.bme.hu Funding details: Fundação para a Ciência e a Tecnologia, FCT, UIDB/00308/2020 Funding details: European Regional Development Fund, ERDF, CENTRO-01-0145-FEDER-029312 Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFIH, BME IE-MI-SC TKP2020 Funding text 1: This article is based on work from COST Action CA15127 (‘‘Resilient communication services protecting end-user applications from disaster-based failures’’ – RECODIS), supported by COST (European Cooperation in Science and Technology); http://www.cost.eu. This work was supported in part by the High Speed Networks Laboratory (HSNLab); in part by the National Research, Development, and Innovation Fund of Hungary, financed through the FK_17, KH_18, K_17, FK_20 and K_18 funding schemes, respectively, under Project 123957, Project 129589, Project 124171, Project 134604, and Project 128062; and in part by the BME through the TKP2020, Institutional Excellence Program of the National Research Development and Innovation Office in the field of Artificial Intelligence under Grant BME IE-MI-SC TKP2020. The work of Rita Girão-Silva and Teresa Gomes was supported in part by the Fundação para a Ciência e a Tecnologia (FCT), I.P. under Project UIDB/00308/2020, and in part by the ERDF Funds through the Centre’s Regional Operational Program and by National Funds through FCT under Project CENTRO-01-0145-FEDER-029312. LA - English DB - MTMT ER - TY - JOUR AU - Babarczi, Péter AU - Klügel, Markus AU - Alba, Alberto Martínez AU - He, Mu AU - Zerwas, Johannes AU - Kalmbach, Patrick AU - Blenk, Andreas AU - Kellerer, Wolfgang TI - A mathematical framework for measuring network flexibility JF - COMPUTER COMMUNICATIONS J2 - COMPUT COMMUN VL - 164 PY - 2020 SP - 13 EP - 24 PG - 12 SN - 0140-3664 DO - 10.1016/j.comcom.2020.09.014 UR - https://m2.mtmt.hu/api/publication/31615222 ID - 31615222 N1 - Chair of Communication Networks, Technical University of Munich, Germany MTA-BME Future Internet Research Group, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Hungary Communication Technologies, Faculty of Computer Science, University of Vienna, Austria Cited By :3 Export Date: 8 February 2022 CODEN: COCOD Correspondence Address: Babarczi, P.; MTA-BME Future Internet Research Group, Hungary; email: peter.babarczi@tum.de Funding details: Alexander von Humboldt-Stiftung Funding details: Horizon 2020 Framework Programme, H2020, 134604, 647158 Funding details: European Research Council, ERC Funding details: Horizon 2020 Funding text 1: This work is part of a project that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 647158 - FlexNets “Quantifying Flexibility for Communication Networks”). The work of P. Babarczi was supported in part by Project no. 134604 that has been implemented with the support provided by the National Research, Development and Innovation Fund of Hungary , financed under the FK_20 funding scheme, and in part by the Alexander von Humboldt Foundation, Germany . Funding text 2: This work is part of a project that has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement No. 647158 - FlexNets ?Quantifying Flexibility for Communication Networks?). The work of P. Babarczi was supported in part by Project no. 134604 that has been implemented with the support provided by the National Research, Development and Innovation Fund of Hungary, financed under the FK_20 funding scheme, and in part by the Alexander von Humboldt Foundation, Germany. LA - English DB - MTMT ER - TY - CHAP AU - Gomes, Teresa AU - Jorge, Luisa AU - Girão-Silva, Rita AU - Yallouz, Jose AU - Babarczi, Péter AU - Rak, Jacek ED - Hutchison, David ED - Rak, Jacek TI - Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios T2 - Guide to Disaster-Resilient Communication Networks PB - Springer Netherlands CY - Cham SN - 9783030446840 T3 - Computer Communications and Networks, ISSN 1617-7975 PY - 2020 SP - 429 EP - 453 PG - 25 DO - 10.1007/978-3-030-44685-7_17 UR - https://m2.mtmt.hu/api/publication/31491601 ID - 31491601 LA - English DB - MTMT ER - TY - CHAP AU - Tornatore, Massimo AU - Babarczi, Péter AU - Ayoub, Omran AU - Ferdousi, Sifat AU - Lourenco, Rafael AU - Zerwas, Johannes AU - Blenk, Andreas AU - Klügel, Markus AU - Kellerer, Wolfgang ED - Hutchison, David ED - Rak, Jacek TI - Alert-Based Network Reconfiguration and Data Evacuation T2 - Guide to Disaster-Resilient Communication Networks PB - Springer Netherlands CY - Cham SN - 9783030446840 T3 - Computer Communications and Networks, ISSN 1617-7975 PY - 2020 SP - 353 EP - 377 PG - 25 DO - 10.1007/978-3-030-44685-7_14 UR - https://m2.mtmt.hu/api/publication/31491533 ID - 31491533 LA - English DB - MTMT ER -