Gábor Rétvári

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 46

Top Topics

Hybrid Architecture

Nash Equilibria

Complex Networks

Top Venues

IEEE/ACM Trans. Netw.

SIGCOMM Posters and Demos

Publications

Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, Gianni Antichi
Morpheus: A Run Time Compiler and Optimizer for Software Data Planes. IEEE/ACM Trans. Netw. 32 (3) (2024)
Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári, Stefan Schmid
MTS: Bringing Multi-Tenancy to Virtual Networking. CoRR (2024)
Tamás Lévai, Balázs Edvárd Kreith, Gábor Rétvári
Supercharge WebRTC: Accelerate TURN Services with eBPF/XDP. eBPF@SIGCOMM (2023)
Albert Gran Alcoz, Balázs Vass, Gábor Rétvári, Laurent Vanbever
Everything Matters in Programmable Packet Scheduling. CoRR (2023)
Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid, Juan Vanerio
Self-Adjusting Partially Ordered Lists. INFOCOM (2023)
Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel Sadoc Menasché
Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. 19 (3) (2022)
Péter Babarczi, Gábor Rétvári, Lajos Rónyai, János Tapolcai
Routing on the Shortest Pairs of Disjoint Paths. IFIP Networking (2022)
Balázs Vass, Csaba Sarkadi, Gábor Rétvári
Programmable Packet Scheduling With SP-PIFO: Theory, Algorithms and Evaluation. INFOCOM Workshops (2022)
Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, Gianni Antichi
Domain specific run time optimization for software data planes. ASPLOS (2022)
Balázs Vass, Ádám Fraknói, Erika R. Bérczi-Kovács, Gábor Rétvári
Compiling packet programs to dRMT switches: theory and algorithms. EuroP4@CoNEXT (2022)
Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, Gianni Antichi
Dynamic Recompilation of Software Network Services with Morpheus. CoRR (2021)
Marco Chiesa, Andrzej Kamisinski, Jacek Rak, Gábor Rétvári, Stefan Schmid
A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks. IEEE Commun. Surv. Tutorials 23 (2) (2021)
Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid
Self-Adjusting Packet Classification. CoRR (2021)
Oliver Michel, Roberto Bifulco, Gábor Rétvári, Stefan Schmid
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications. CoRR (2021)
Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid
Online List Access with Precedence Constraints. CoRR (2021)
Oliver Michel, Roberto Bifulco, Gábor Rétvári, Stefan Schmid
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications. ACM Comput. Surv. 54 (4) (2021)
Balázs Vass, Erika R. Bérczi-Kovács, Costin Raiciu, Gábor Rétvári
Compiling Packet Programs to Reconfigurable Switches: Theory and Algorithms. EuroP4@CoNEXT (2020)
Attila Korösi, András Gulyás, Zalán Heszberger, József Bíró, Gábor Rétvári
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces. IEEE/ACM Trans. Netw. 28 (3) (2020)
Sebastiano Miano, Gábor Rétvári, Fulvio Risso, Andrew W. Moore, Gianni Antichi
Automatic optimization of software data planes. SIGCOMM Posters and Demos (2020)
Tamás Lévai, Felicián Németh, Barath Raghavan, Gábor Rétvári
Batchy: Batch-scheduling Data Flow Graphs with Service-level Objectives. NSDI (2020)
Gianni Antichi, Gábor Rétvári
Full-stack SDN: The Next Big Challenge? SOSR (2020)
Levente Csikor, Márk Szalay, Gábor Rétvári, Gergely Pongrácz, Dimitrios P. Pezaros, László Toka
Transition to SDN is HARMLESS: Hybrid Architecture for Migrating Legacy Ethernet Switches to SDN. IEEE/ACM Trans. Netw. 28 (1) (2020)
Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel S. Menasché
Cooperative Rule Caching for SDN Switches. CloudNet (2020)
Leonardo Linguaglossa, Stanislav Lange, Salvatore Pontarelli, Gábor Rétvári, Dario Rossi, Thomas Zinner, Roberto Bifulco, Michael Jarschel, Giuseppe Bianchi
Survey of Performance Acceleration Techniques for Network Function Virtualization. Proc. IEEE 107 (4) (2019)
János Tapolcai, Gábor Rétvári, Péter Babarczi, Erika R. Bérczi-Kovács
Scalable and Efficient Multipath Routing via Redundant Trees. IEEE J. Sel. Areas Commun. 37 (5) (2019)
Márk Szalay, Máté Nagy, Daniel Gehberger, Zoltán Lajos Kis, Péter Mátray, Felicián Németh, Gergely Pongrácz, Gábor Rétvári, László Toka
Industrial-Scale Stateless Network Functions. CLOUD (2019)
Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári, Stefan Schmid
MTS: Bringing Multi-Tenancy to Virtual Networking. USENIX Annual Technical Conference (2019)
Tamás Lévai, Gábor Rétvári
Resilient Dataflow Graph Embedding for Programmable Software Switches. RNDM (2019)
Johannes Zerwas, Patrick Kalmbach, Laurenz Henkel, Gábor Rétvári, Wolfgang Kellerer, Andreas Blenk, Stefan Schmid
NetBOA: Self-Driving Network Benchmarking. NetAI@SIGCOMM (2019)
Levente Csikor, Dinil Mon Divakaran, Min Suk Kang, Attila Korösi, Balázs Sonkoly, Dávid Haja, Dimitrios P. Pezaros, Stefan Schmid, Gábor Rétvári
Tuple space explosion: a denial-of-service attack against a software packet classifier. CoNEXT (2019)
Felicián Németh, Marco Chiesa, Gábor Rétvári
Normal forms for match-action programs. CoNEXT (2019)
Kashyap Thimmaraju, Gábor Rétvári, Stefan Schmid
Virtual Network Isolation: Are We There Yet? SecSoN@SIGCOMM (2018)
Roberto Bifulco, Gábor Rétvári
A Survey on the Programmable Data Plane: Abstractions, Architectures, and Open Problems. HPSR (2018)
Marco Chiesa, Gábor Rétvári, Michael Schapira
Oblivious Routing in IP Networks. IEEE/ACM Trans. Netw. 26 (3) (2018)
Levente Csikor, László Toka, Márk Szalay, Gergely Pongrácz, Dimitrios P. Pezaros, Gábor Rétvári
HARMLESS: Cost-Effective Transitioning to SDN for Small Enterprises. Networking (2018)
Máté Nagy, János Tapolcai, Gábor Rétvári
Node Virtualization for IP Level Resilience. IEEE/ACM Trans. Netw. 26 (3) (2018)
Levente Csikor, Christian Esteve Rothenberg, Dimitrios P. Pezaros, Stefan Schmid, László Toka, Gábor Rétvári
Policy Injection: A Cloud Dataplane DoS Attack. SIGCOMM Posters and Demos (2018)
Tamás Lévai, Gergely Pongrácz, Péter Megyesi, Peter Vörös, Sándor Laki, Felician Németh, Gábor Rétvári
The Price for Programmability in the Software Data Plane: The Vendor Perspective. IEEE J. Sel. Areas Commun. 36 (12) (2018)
Krisztián Németh, Attila Korösi, Gábor Rétvári
Optimal resource pooling over legacy equal-split load balancing schemes. Comput. Networks 127 (2017)
Attila Csoma, Attila Korösi, Gábor Rétvári, Zalán Heszberger, József Bíró, Mariann Slíz, Andrea Avena-Koenigsberger, Alessandra Griffa, Patric Hagmann, András Gulyás
Routes Obey Hierarchy in Complex Networks. CoRR (2017)
Mark Szalay, László Toka, Gábor Rétvári, Gergely Pongrácz, Levente Csikor, Dimitrios P. Pezaros
HARMLESS: Cost-Effective Transitioning to SDN. SIGCOMM Posters and Demos (2017)
Marco Chiesa, Gábor Rétvári, Michael Schapira
Lying Your Way to Better Traffic Engineering. CoNEXT (2016)
Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. IEEE/ACM Trans. Netw. 24 (1) (2016)
Marco Chiesa, Gábor Rétvári, Michael Schapira
Lying Your Way to Better Traffic Engineering. CoRR (2016)
Sergey I. Nikolenko, Kirill Kogan, Gábor Rétvári, Erika R. Bérczi-Kovács, Alexander Shalimov
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes. INFOCOM Workshops (2016)
László Molnár, Gergely Pongrácz, Gábor Enyedi, Zoltán Lajos Kis, Levente Csikor, Ferenc Juhász, Attila Korösi, Gábor Rétvári
Dataplane Specialization for High-performance OpenFlow Software Switching. SIGCOMM (2016)
Gábor Németh, Gábor Rétvári
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures. Networks 66 (2) (2015)
Levente Csikor, Gábor Rétvári
On providing fast protection with remote loop-free alternates - Analyzing and Optimizing Unit Cost Networks. Telecommun. Syst. 60 (4) (2015)
János Tapolcai, Gábor Rétvári, Péter Babarczi, Erika R. Bérczi-Kovács, Panna Kristof, Gábor Enyedi
Scalable and Efficient Multipath Routing: Complexity and Algorithms. ICNP (2015)
András Gulyás, Gábor Rétvári, Zalán Heszberger, Rachit Agarwal
On the Scalability of Routing With Policies. IEEE/ACM Trans. Netw. 23 (5) (2015)
Máté Nagy, János Tapolcai, Gábor Rétvári
Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates. Telecommun. Syst. 56 (1) (2014)
Attila Korösi, János Tapolcai, Bence Mihálka, Gábor Mészáros, Gábor Rétvári
Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously. ICNP (2014)
Máté Nagy, János Tapolcai, Gábor Rétvári
On the design of Resilient IP Overlays. DRCN (2014)
Márton Zubor, Attila Korösi, András Gulyás, Gábor Rétvári
On the Computational Complexity of Policy Routing. EUNICE (2014)
András Majdán, Gábor Rétvári, János Tapolcai
Development and Performance Evaluation of Fast Combinatorial Unranking Implementations. EUNICE (2014)
Gábor Rétvári, Dávid Szabó, András Gulyás, Attila Korösi, János Tapolcai
An Information-Theoretic Approach to Routing Scalability. HotNets (2014)
Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. CoRR (2014)
Bence Mihálka, Attila Korösi, Gábor Rétvári
Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm. EUNICE (2014)
András Gulyás, József Bíró, Attila Korösi, Gábor Rétvári, Dmitri Krioukov
Complex Networks as Nash Equilibria of Navigation Games. CoRR (2014)
János Tapolcai, Gábor Rétvári, Attila Körösi
Memory size bounds of prefix DAGs CoRR (2013)
János Tapolcai, Zalán Heszberger, Gábor Rétvári, József Biró
Reduced information scenario for Shared Segment Protection. CogInfoCom (2013)
János Tapolcai, Gábor Rétvári
Router virtualization for improving IP-level resilience. INFOCOM (2013)
Levente Csikor, János Tapolcai, Gábor Rétvári
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates. Comput. Commun. 36 (6) (2013)
Krisztián Németh, Attila Körösi, Gábor Rétvári
Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing. Networking (2013)
Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró
Compact policy routing. Distributed Comput. 26 (5-6) (2013)
Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger
Compressing IP forwarding tables: towards entropy bounds and beyond. SIGCOMM (2013)
Levente Csikor, Gábor Rétvári, János Tapolcai
High Availability in the Future Internet. Future Internet Assembly (2013)
András Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó
Brief announcement: network formation games can give rise to realistic networks. PODC (2012)
Gábor Rétvári, Zoltán Csernátony, Attila Korösi, János Tapolcai, András Császár, Gábor Enyedi, Gergely Pongrácz
Compressing IP forwarding tables for fun and profit. HotNets (2012)
Levente Csikor, Gábor Rétvári
IP fast reroute with remote Loop-Free Alternates: The unit link cost case. ICUMT (2012)
Gábor Németh, Gábor Rétvári
Towards a statistical characterization of the competitiveness of oblivious routing. SIGMETRICS (2012)
Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró
Compact policy routing. PODC (2011)
Csaba Simon, Felician Németh, Ferenc Uzsak, Gábor Rétvári, Ferenc Ficsor, Rolland Vida
Autonomic DHCPv6 Architecture. GLOBECOM Workshops (2011)
Gábor Rétvári, János Tapolcai, Gábor Enyedi, András Császár
IP fast ReRoute: Loop Free Alternates revisited. INFOCOM (2011)
Gábor Rétvári, Levente Csikor, János Tapolcai, Gábor Enyedi, András Császár
Optimizing IGP link costs for improving IP-level resilience. DRCN (2011)
Máté Nagy, Gábor Rétvári
An evaluation of approximate network optimization methods for improving ip-level fast protection with loop-free alternates. ICUMT (2011)
Gábor Rétvári, Gábor Németh
Demand-Oblivious Routing: Distributed vs. Centralized Approaches. INFOCOM (2010)
Márton Csernai, András Gulyás, Gábor Rétvári, Zalán Heszberger, András Császár
The Skeleton of the Internet. GLOBECOM (2010)
Gábor Németh, Gábor Rétvári
Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds. BROADNETS (2010)
Gábor Rétvári, Gábor Németh
On optimal multipath rate-adaptive routing. ISCC (2010)
Péter Fodor, Gábor Enyedi, Gábor Rétvári, Tibor Cinkler
Layer-preference policies in multi-layer GMPLS networks. Photonic Netw. Commun. 18 (3) (2009)
Gábor Rétvári, Felician Németh, Ranganai Chaparadza, Róbert Szabó
OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. MACE (2009)
Gábor Enyedi, Péter Szilágyi, Gábor Rétvári, András Császár
IP Fast ReRoute: Lightweight Not-Via without Additional Addresses. INFOCOM (2009)
Gábor Enyedi, Gábor Rétvári, Péter Szilágyi, András Császár
IP Fast ReRoute: Lightweight Not-Via. Networking (2009)
Gábor Enyedi, Gábor Rétvári, András Császár
On Finding maximally redundant trees in strictly linear time. ISCC (2009)
Gábor Rétvári, József Bíró, Tibor Cinkler
Routing-Independent Fairness in Capacitated Networks. ICC (2007)
Gábor Enyedi, Gábor Rétvári, Tibor Cinkler
A Novel Loop-Free IP Fast Reroute Algorithm. EUNICE (2007)
Gábor Rétvári, József Bíró, Tibor Cinkler
On shortest path representation. IEEE/ACM Trans. Netw. 15 (6) (2007)
András Császár, Gábor Enyedi, Gábor Rétvári, Markus Hidell, Peter Sjödin
Converging the Evolution of Router Architectures and IP Networks. IEEE Netw. 21 (4) (2007)
Gábor Rétvári, József Bíró, Tibor Cinkler
Fairness in Capacitated Networks: A Polyhedral Approach. INFOCOM (2007)
Gábor Rétvári, József Bíró, Tibor Cinkler
On Improving the Accuracy of OSPF Traffic Engineering. Networking (2006)
Gábor Rétvári, József Bíró, Tibor Cinkler, Tamás Henk
A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm. INFOCOM (2005)
Gábor Rétvári, Tibor Cinkler
Practical OSPF traffic engineering. IEEE Commun. Lett. 8 (11) (2004)
Gábor Rétvári, József Bíró, Tibor Cinkler
A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. ISCC (2004)
Gábor Rétvári, Róbert Szabó, József Bíró
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. NETWORKING (2004)
Gábor Rétvári
Minimum Interference Routing: The Precomputation Perspective. MMNS (2003)
János Levendovszky, Alpár Fancsali, Csaba Végsö, Gábor Rétvári
QoS Routing with Incomplete Information by Analog Computing Algorithms. QofIS (2001)