default search action
Gábor Rétvári
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j24]Sebastiano Miano
, Alireza Sanaee
Morpheus: A Run Time Compiler and Optimizer for Software Data Planes. IEEE/ACM Trans. Netw. 32(3): 2269-2284 (2024) - [j23]Balázs Vass
Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches. IEEE/ACM Trans. Netw. 32(5): 4519-4534 (2024) - [c64]Tamás Lévai, Balázs Vass, Gábor Rétvári:
Programmable Real-Time Scheduling of Disaggregated Network Functions. IFIP Networking 2024: 1-7 - [i11]Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári, Stefan Schmid
MTS: Bringing Multi-Tenancy to Virtual Networking. CoRR abs/2403.01862 (2024) - 2023
- [c63]Vamsi Addanki, Maciej Pacut, Arash Pourdamghani
Self-Adjusting Partially Ordered Lists. INFOCOM 2023: 1-10 - [c62]Tamás Lévai
Supercharge WebRTC: Accelerate TURN Services with eBPF/XDP. eBPF@SIGCOMM 2023: 70-76 - [i10]Albert Gran Alcoz, Balázs Vass, Gábor Rétvári, Laurent Vanbever:
Everything Matters in Programmable Packet Scheduling. CoRR abs/2308.00797 (2023) - 2022
- [j22]Oliver Michel
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications. ACM Comput. Surv. 54(4): 82:1-82:36 (2022) - [j21]Ori Rottenstreich
Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. 19(3): 2092-2106 (2022) - [c61]Sebastiano Miano
Domain specific run time optimization for software data planes. ASPLOS 2022: 1148-1164 - [c60]Balázs Vass
Compiling packet programs to dRMT switches: theory and algorithms. EuroP4@CoNEXT 2022: 26-32 - [c59]Balázs Vass
Programmable Packet Scheduling With SP-PIFO: Theory, Algorithms and Evaluation. INFOCOM Workshops 2022: 1-6 - [c58]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: 1-9 - 2021
- [j20]Marco Chiesa
A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks. IEEE Commun. Surv. Tutorials 23(2): 1253-1301 (2021) - [i9]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Online List Access with Precedence Constraints. CoRR abs/2104.08949 (2021) - [i8]Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, Gianni Antichi:
Dynamic Recompilation of Software Network Services with Morpheus. CoRR abs/2106.08833 (2021) - [i7]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Self-Adjusting Packet Classification. CoRR abs/2109.15090 (2021) - [i6]Oliver Michel, Roberto Bifulco, Gábor Rétvári, Stefan Schmid:
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications. CoRR abs/2110.00631 (2021) - 2020
- [j19]Levente Csikor
Transition to SDN is HARMLESS: Hybrid Architecture for Migrating Legacy Ethernet Switches to SDN. IEEE/ACM Trans. Netw. 28(1): 275-288 (2020) - [j18]Attila Korösi, András Gulyás
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces. IEEE/ACM Trans. Netw. 28(3): 1353-1363 (2020) - [c57]Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford
Cooperative Rule Caching for SDN Switches. CloudNet 2020: 1-7 - [c56]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: 28-35 - [c55]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: 633-649 - [c54]Sebastiano Miano
Automatic optimization of software data planes. SIGCOMM Posters and Demos 2020: 27-29 - [c53]Gianni Antichi
Full-stack SDN: The Next Big Challenge? SOSR 2020: 48-54
2010 – 2019
- 2019
- [j17]János Tapolcai
Scalable and Efficient Multipath Routing via Redundant Trees. IEEE J. Sel. Areas Commun. 37(5): 982-996 (2019) - [j16]Leonardo Linguaglossa, Stanislav Lange, Salvatore Pontarelli
Survey of Performance Acceleration Techniques for Network Function Virtualization. Proc. IEEE 107(4): 746-764 (2019) - [c52]Márk Szalay
Industrial-Scale Stateless Network Functions. CLOUD 2019: 383-390 - [c51]Felicián Németh, Marco Chiesa
Normal forms for match-action programs. CoNEXT 2019: 44-50 - [c50]Levente Csikor, Dinil Mon Divakaran, Min Suk Kang, Attila Korösi, Balázs Sonkoly
Tuple space explosion: a denial-of-service attack against a software packet classifier. CoNEXT 2019: 292-304 - [c49]Tamás Lévai, Gábor Rétvári:
Resilient Dataflow Graph Embedding for Programmable Software Switches. RNDM 2019: 1-8 - [c48]Johannes Zerwas, Patrick Kalmbach, Laurenz Henkel, Gábor Rétvári, Wolfgang Kellerer
NetBOA: Self-Driving Network Benchmarking. NetAI@SIGCOMM 2019: 8-14 - [c47]Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári, Stefan Schmid:
MTS: Bringing Multi-Tenancy to Virtual Networking. USENIX ATC 2019: 521-536 - 2018
- [j15]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): 2621-2630 (2018) - [j14]Máté Nagy, János Tapolcai
Node Virtualization for IP Level Resilience. IEEE/ACM Trans. Netw. 26(3): 1250-1263 (2018) - [j13]Marco Chiesa
Oblivious Routing in IP Networks. IEEE/ACM Trans. Netw. 26(3): 1292-1305 (2018) - [c46]Roberto Bifulco, Gábor Rétvári:
A Survey on the Programmable Data Plane: Abstractions, Architectures, and Open Problems. HPSR 2018: 1-7 - [c45]Levente Csikor, László Toka, Márk Szalay
HARMLESS: Cost-Effective Transitioning to SDN for Small Enterprises. Networking 2018: 208-216 - [c44]Kashyap Thimmaraju, Gábor Rétvári, Stefan Schmid
Virtual Network Isolation: Are We There Yet? SecSoN@SIGCOMM 2018: 1-7 - [c43]Levente Csikor, Christian Esteve Rothenberg
Policy Injection: A Cloud Dataplane DoS Attack. SIGCOMM Posters and Demos 2018: 147-149 - 2017
- [j12]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: 243-265 (2017) - [c42]Mark Szalay
HARMLESS: Cost-Effective Transitioning to SDN. SIGCOMM Posters and Demos 2017: 91-93 - [i5]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 abs/1702.05912 (2017) - 2016
- [j11]Gábor Rétvári, János Tapolcai
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. IEEE/ACM Trans. Netw. 24(1): 149-162 (2016) - [c41]Marco Chiesa
Lying Your Way to Better Traffic Engineering. CoNEXT 2016: 391-398 - [c40]Sergey I. Nikolenko
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes. INFOCOM Workshops 2016: 521-526 - [c39]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: 539-552 - [i4]Marco Chiesa, Gábor Rétvári, Michael Schapira:
Lying Your Way to Better Traffic Engineering. CoRR abs/1610.02728 (2016) - 2015
- [j10]Gábor Németh, Gábor Rétvári:
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures. Networks 66(2): 118-135 (2015) - [j9]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): 485-502 (2015) - [j8]András Gulyás, Gábor Rétvári, Zalán Heszberger
On the Scalability of Routing With Policies. IEEE/ACM Trans. Netw. 23(5): 1610-1618 (2015) - [c38]János Tapolcai
Scalable and Efficient Multipath Routing: Complexity and Algorithms. ICNP 2015: 376-385 - 2014
- [j7]Máté Nagy, János Tapolcai
Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates. Telecommun. Syst. 56(1): 103-119 (2014) - [c37]Máté Nagy, János Tapolcai
On the design of Resilient IP Overlays. DRCN 2014: 1-8 - [c36]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: 2:1-2:7 - [c35]Attila Korösi, János Tapolcai
Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously. ICNP 2014: 332-343 - [c34]András Majdán, Gábor Rétvári, János Tapolcai
Development and Performance Evaluation of Fast Combinatorial Unranking Implementations. EUNICE 2014: 97-108 - [c33]Bence Mihálka, Attila Korösi, Gábor Rétvári:
Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm. EUNICE 2014: 121-133 - [c32]Márton Zubor, Attila Korösi, András Gulyás, Gábor Rétvári:
On the Computational Complexity of Policy Routing. EUNICE 2014: 202-214 - [i3]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 abs/1402.1194 (2014) - [i2]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 abs/1412.7229 (2014) - 2013
- [j6]Levente Csikor, János Tapolcai
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates. Comput. Commun. 36(6): 645-655 (2013) - [j5]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): 309-320 (2013) - [c31]János Tapolcai
Reduced information scenario for Shared Segment Protection. CogInfoCom 2013: 589-594 - [c30]Levente Csikor, Gábor Rétvári, János Tapolcai
High Availability in the Future Internet. Future Internet Assembly 2013: 64-76 - [c29]János Tapolcai
Router virtualization for improving IP-level resilience. INFOCOM 2013: 935-943 - [c28]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: 1-9 - [c27]Gábor Rétvári, János Tapolcai
Compressing IP forwarding tables: towards entropy bounds and beyond. SIGCOMM 2013: 111-122 - [i1]János Tapolcai, Gábor Rétvári, Attila Körösi:
Memory size bounds of prefix DAGs. CoRR abs/1305.5662 (2013) - 2012
- [c26]Gábor Rétvári, Zoltán Csernátony, Attila Korösi, János Tapolcai
Compressing IP forwarding tables for fun and profit. HotNets 2012: 1-6 - [c25]Levente Csikor, Gábor Rétvári:
IP fast reroute with remote Loop-Free Alternates: The unit link cost case. ICUMT 2012: 663-669 - [c24]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: 329-330 - [c23]Gábor Németh, Gábor Rétvári:
Towards a statistical characterization of the competitiveness of oblivious routing. SIGMETRICS 2012: 387-388 - 2011
- [c22]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: 62-69 - [c21]Csaba Simon, Felician Németh
Autonomic DHCPv6 Architecture. GLOBECOM Workshops 2011: 620-624 - [c20]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: 1-7 - [c19]Gábor Rétvári, János Tapolcai
IP fast ReRoute: Loop Free Alternates revisited. INFOCOM 2011: 2948-2956 - [c18]Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró:
Compact policy routing. PODC 2011: 149-158 - 2010
- [c17]Gábor Németh, Gábor Rétvári:
Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds. BROADNETS 2010: 84-100 - [c16]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: 1-5 - [c15]Gábor Rétvári, Gábor Németh:
Demand-Oblivious Routing: Distributed vs. Centralized Approaches. INFOCOM 2010: 1217-1225 - [c14]Gábor Rétvári, Gábor Németh:
On optimal multipath rate-adaptive routing. ISCC 2010: 605-610
2000 – 2009
- 2009
- [j4]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): 300-313 (2009) - [c13]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: 2771-2775 - [c12]Gábor Enyedi, Gábor Rétvári, András Császár:
On Finding maximally redundant trees in strictly linear time. ISCC 2009: 206-211 - [c11]Gábor Rétvári, Felician Németh
OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. MACE 2009: 72-85 - [c10]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: 157-168 - 2007
- [j3]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): 8-14 (2007) - [j2]Gábor Rétvári, József Bíró, Tibor Cinkler:
On shortest path representation. IEEE/ACM Trans. Netw. 15(6): 1293-1306 (2007) - [c9]Gábor Rétvári, József Bíró, Tibor Cinkler:
Routing-Independent Fairness in Capacitated Networks. ICC 2007: 6344-6349 - [c8]Gábor Enyedi, Gábor Rétvári, Tibor Cinkler:
A Novel Loop-Free IP Fast Reroute Algorithm. EUNICE 2007: 111-119 - [c7]Gábor Rétvári, József Bíró, Tibor Cinkler:
Fairness in Capacitated Networks: A Polyhedral Approach. INFOCOM 2007: 1604-1612 - 2006
- [c6]Gábor Rétvári, József Bíró, Tibor Cinkler:
On Improving the Accuracy of OSPF Traffic Engineering. Networking 2006: 51-62 - 2005
- [c5]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: 260-268 - 2004
- [j1]Gábor Rétvári, Tibor Cinkler:
Practical OSPF traffic engineering. IEEE Commun. Lett. 8(11): 689-691 (2004) - [c4]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: 957-962 - [c3]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: 1180-1191 - 2003
- [c2]Gábor Rétvári:
Minimum Interference Routing: The Precomputation Perspective. MMNS 2003: 246-258 - 2001
- [c1]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: 127-137
Coauthor Index
Attila Korösi
aka: Attila Körösi
aka: Attila Körösi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: