Balázs Vass

Budapest University of Technology and Economics — Hungary

Engineering · Physical Sciences

11h-index354citations57works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Optical Network Technologies(32), Software-Defined Networks and 5G(31), Interconnection Networks and Systems(19), Network Traffic and Congestion Control(7), Complex Network Analysis Techniques(6)

Publications57 total

An Ant Colony Optimization Approach for Safest Path Pair Computation Under Correlated Failures
Lecture notes in computer science·2025· 1 cited
Ant Colony Optimization Algorithm for Safest Path Computation in Presence of Correlated Failures in Backbone Networks
Proceedings of the Genetic and Evolutionary Computation Conference·2025· 1 cited
On Traffic Prediction in Backbone Networks for Adaptive Proactive Protection
2025
Programmable Real-Time Scheduling of Disaggregated Network Functions: A Theoretical Model
IEEE Transactions on Network and Service Management·2025
<i>DateLine</i>: Efficient Algorithm for Computing Region Disjoint Paths in Backbone Networks
IEEE Journal on Selected Areas in Communications·2025· 2 cited
Spring: Theory and an Efficient Heuristic for Programmable Packet Scheduling with SP-PIFO
Híradástechnika/Infocommunications journal·2025Open Access
On Traffic Prediction in Backbone Networks for Adaptive Proactive Protection
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Programmable Real-time Scheduling of Disaggregated Network Functions: A Theoretical Model
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Programmable Real-time Scheduling of Disaggregated Network Functions: A Theoretical Model
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
On Traffic Prediction in Backbone Networks for Adaptive Proactive Protection
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Computing Safest $st$-Paths in Backbone Networks: Efficiently Solvable Cases and Fast Heuristics
2024· 2 cited
Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches
IEEE/ACM Transactions on Networking·2024· 1 cited
Programmable Real-Time Scheduling of Disaggregated Network Functions
2024
Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks
2024· 3 cited
Efficient Computing of Disaster-Disjoint Paths: Greedy and Beyond
2024· 1 cited
Computing Safest st-Paths in Backbone Networks: Efficiently Solvable Cases and Fast Heuristics
Zenodo (CERN European Organization for Nuclear Research)·2024Open Access
Computing Safest st-Paths in Backbone Networks: Efficiently Solvable Cases and Fast Heuristics
Zenodo (CERN European Organization for Nuclear Research)·2024Open Access
The complexity landscape of disaster‐aware network extension problems
Networks·2023· 1 citedOpen Access
Everything Matters in Programmable Packet Scheduling
arXiv (Cornell University)·2023· 3 citedOpen Access
A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem
IEEE/ACM Transactions on Networking·2023· 6 cited
page 1 of 3Next →

Frequent Co-authors

János Tapolcai(23), Erika R. Bérczi‐Kovács(12), Gábor Rétvári(9), Alija Pašíć(7), Rita Girão‐Silva(5), Teresa Gomes(5), Lajos Rónyai(4), David Hay(4), Fernando Kuipers(4), Péter Revisnyei(4), Tamás Lévai(4), Péter Babarczi(3), Jacek Rak(3), Jorik Oostenbrink(3), Péter Gyimesi(3), Laszlo Gyimothi(2), Zalán Heszberger(2), József Bı́ró(2), Costin Raiciu(2), Ferenc Mogyorósi(2)