@inproceedings{MTMT:34238494,
	title = {Intelligent Control Plane Design for Virtual Software-Defined Networks},
	url = {https://m2.mtmt.hu/api/publication/34238494},
	author = {Babarczi, Péter and Mogyorósi, Ferenc and Pašić, Alija},
	booktitle = {2023 13th International Workshop on Resilient Networks Design and Modeling (RNDM)},
	doi = {10.1109/RNDM59149.2023.10293099},
	unique-id = {34238494},
	year = {2023},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172; Pašić, Alija/0000-0001-6346-496X}
}

@inproceedings{MTMT:33790929,
	title = {Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences},
	url = {https://m2.mtmt.hu/api/publication/33790929},
	author = {Tapolcai, János and Babarczi, Péter and Ho, P-H and Rónyai, Lajos},
	booktitle = {IEEE INFOCOM 2023 - IEEE Conference on Computer Communications},
	doi = {10.1109/INFOCOM53939.2023.10229023},
	unique-id = {33790929},
	year = {2023},
	pages = {1-10},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@inproceedings{MTMT:33091437,
	title = {Routing on the Shortest Pairs of Disjoint Paths},
	url = {https://m2.mtmt.hu/api/publication/33091437},
	author = {Babarczi, Péter and Rétvári, Gábor and Rónyai, Lajos and Tapolcai, János},
	booktitle = {2022 IFIP Networking Conference (IFIP Networking)},
	doi = {10.23919/IFIPNetworking55013.2022.9829760},
	unique-id = {33091437},
	abstract = {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.},
	keywords = {multi-path routing; Suurballe-Tarjan algorithm; data-plane scalability; incremental deployment},
	year = {2022},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@article{MTMT:33049046,
	title = {Resilient Control Plane Design for Virtualized 6G Core Networks},
	url = {https://m2.mtmt.hu/api/publication/33049046},
	author = {Mogyorósi, Ferenc and Babarczi, Péter and Zerwas, J. and Blenk, A. and Pašić, Alija},
	doi = {10.1109/TNSM.2022.3193241},
	journal-iso = {IEEE T NETW SERV MANAG},
	journal = {IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT},
	volume = {19},
	unique-id = {33049046},
	issn = {1932-4537},
	abstract = {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.},
	year = {2022},
	eissn = {1932-4537},
	pages = {2453-2467},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172; Pašić, Alija/0000-0001-6346-496X}
}

@inproceedings{MTMT:31899008,
	title = {Modeling the Cost of Flexibility in Communication Networks},
	url = {https://m2.mtmt.hu/api/publication/31899008},
	author = {Alberto, Martínez Alba and Babarczi, Péter and Andreas, Blenk and Mu, He and Patrick, Kalmbach and Johannes, Zerwas and Wolfgang, Kellerer},
	booktitle = {2021 IEEE International Conference on Computer Communications (IEEE INFOCOM 2021)},
	doi = {10.1109/INFOCOM42981.2021.9488900},
	unique-id = {31899008},
	abstract = {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.},
	keywords = {ADAPTATION; communication networks; cost; FLEXIBILITY},
	year = {2021},
	pages = {1-10},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@article{MTMT:31898773,
	title = {Resilient Control Plane Design for Virtual Software Defined Networks},
	url = {https://m2.mtmt.hu/api/publication/31898773},
	author = {Babarczi, Péter},
	doi = {10.1109/TNSM.2021.3063204},
	journal-iso = {IEEE T NETW SERV MANAG},
	journal = {IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT},
	volume = {18},
	unique-id = {31898773},
	issn = {1932-4537},
	year = {2021},
	eissn = {1932-4537},
	pages = {2557-2569},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@article{MTMT:31829886,
	title = {eFRADIR: An Enhanced FRAmework for DIsaster Resilience},
	url = {https://m2.mtmt.hu/api/publication/31829886},
	author = {Pašić, Alija and Girao-Silva, Rita and Mogyorósi, Ferenc and Vass, Balázs and Gomes, Teresa and Babarczi, Péter and Revisnyei, Péter and Tapolcai, János and Rak, Jacek},
	doi = {10.1109/ACCESS.2021.3050923},
	journal-iso = {IEEE ACCESS},
	journal = {IEEE ACCESS},
	volume = {9},
	unique-id = {31829886},
	issn = {2169-3536},
	year = {2021},
	eissn = {2169-3536},
	pages = {13125-13148},
	orcid-numbers = {Pašić, Alija/0000-0001-6346-496X; Girao-Silva, Rita/0000-0002-2331-8340; Mogyorósi, Ferenc/0000-0002-7929-5774; Vass, Balázs/0000-0002-8589-7165; Gomes, Teresa/0000-0002-3084-5608; Babarczi, Péter/0000-0003-1644-2172; Revisnyei, Péter/0000-0002-9459-8335; Tapolcai, János/0000-0002-3512-9504; Rak, Jacek/0000-0001-7276-6097}
}

@article{MTMT:31615222,
	title = {A mathematical framework for measuring network flexibility},
	url = {https://m2.mtmt.hu/api/publication/31615222},
	author = {Babarczi, Péter and Klügel, Markus and Alba, Alberto Martínez and He, Mu and Zerwas, Johannes and Kalmbach, Patrick and Blenk, Andreas and Kellerer, Wolfgang},
	doi = {10.1016/j.comcom.2020.09.014},
	journal-iso = {COMPUT COMMUN},
	journal = {COMPUTER COMMUNICATIONS},
	volume = {164},
	unique-id = {31615222},
	issn = {0140-3664},
	year = {2020},
	eissn = {1873-703X},
	pages = {13-24},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@{MTMT:31491601,
	title = {Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios},
	url = {https://m2.mtmt.hu/api/publication/31491601},
	author = {Gomes, Teresa and Jorge, Luisa and Girão-Silva, Rita and Yallouz, Jose and Babarczi, Péter and Rak, Jacek},
	booktitle = {Guide to Disaster-Resilient Communication Networks},
	doi = {10.1007/978-3-030-44685-7_17},
	unique-id = {31491601},
	year = {2020},
	pages = {429-453},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@{MTMT:31491533,
	title = {Alert-Based Network Reconfiguration and Data Evacuation},
	url = {https://m2.mtmt.hu/api/publication/31491533},
	author = {Tornatore, Massimo and Babarczi, Péter and Ayoub, Omran and Ferdousi, Sifat and Lourenco, Rafael and Zerwas, Johannes and Blenk, Andreas and Klügel, Markus and Kellerer, Wolfgang},
	booktitle = {Guide to Disaster-Resilient Communication Networks},
	doi = {10.1007/978-3-030-44685-7_14},
	unique-id = {31491533},
	year = {2020},
	pages = {353-377},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}