Gábor Rétvári

Orcid: 0000-0002-5958-7817

According to our database1, Gábor Rétvári authored at least 90 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Everything Matters in Programmable Packet Scheduling.
CoRR, 2023

Supercharge WebRTC: Accelerate TURN Services with eBPF/XDP.
Proceedings of the 1st Workshop on eBPF and Kernel Extensions, 2023

Self-Adjusting Partially Ordered Lists.
Proceedings of the IEEE INFOCOM 2023, 2023

2022
Data Plane Cooperative Caching With Dependencies.
IEEE Trans. Netw. Serv. Manag., 2022

The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications.
ACM Comput. Surv., 2022

Routing on the Shortest Pairs of Disjoint Paths.
Proceedings of the IFIP Networking Conference, 2022

Programmable Packet Scheduling With SP-PIFO: Theory, Algorithms and Evaluation.
Proceedings of the IEEE INFOCOM 2022, 2022

Compiling packet programs to dRMT switches: theory and algorithms.
Proceedings of the 5th International Workshop on P4 in Europe, 2022

Domain specific run time optimization for software data planes.
Proceedings of the ASPLOS '22: 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, 28 February 2022, 2022

2021
Self-Adjusting Packet Classification.
CoRR, 2021

Dynamic Recompilation of Software Network Services with Morpheus.
CoRR, 2021

Online List Access with Precedence Constraints.
CoRR, 2021

A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks.
IEEE Commun. Surv. Tutorials, 2021

2020
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces.
IEEE/ACM Trans. Netw., 2020

Transition to SDN is HARMLESS: Hybrid Architecture for Migrating Legacy Ethernet Switches to SDN.
IEEE/ACM Trans. Netw., 2020

Full-stack SDN: The Next Big Challenge?
Proceedings of the SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, 2020

Automatic optimization of software data planes.
Proceedings of the SIGCOMM '20: ACM SIGCOMM 2020 Conference, 2020

Batchy: Batch-scheduling Data Flow Graphs with Service-level Objectives.
Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation, 2020

Compiling Packet Programs to Reconfigurable Switches: Theory and Algorithms.
Proceedings of the EuroP4@CoNEXT 2020: Proceedings of the 3rd P4 Workshop in Europe, 2020

Cooperative Rule Caching for SDN Switches.
Proceedings of the 9th IEEE International Conference on Cloud Networking, 2020

2019
Survey of Performance Acceleration Techniques for Network Function Virtualization.
Proc. IEEE, 2019

Scalable and Efficient Multipath Routing via Redundant Trees.
IEEE J. Sel. Areas Commun., 2019

MTS: Bringing Multi-Tenancy to Virtual Networking.
Proceedings of the 2019 USENIX Annual Technical Conference, 2019

NetBOA: Self-Driving Network Benchmarking.
Proceedings of the 2019 Workshop on Network Meets AI & ML, 2019

Resilient Dataflow Graph Embedding for Programmable Software Switches.
Proceedings of the 11th International Workshop on Resilient Networks Design and Modeling, 2019

Normal forms for match-action programs.
Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, 2019

Tuple space explosion: a denial-of-service attack against a software packet classifier.
Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, 2019

Industrial-Scale Stateless Network Functions.
Proceedings of the 12th IEEE International Conference on Cloud Computing, 2019

2018
Node Virtualization for IP Level Resilience.
IEEE/ACM Trans. Netw., 2018

Oblivious Routing in IP Networks.
IEEE/ACM Trans. Netw., 2018

The Price for Programmability in the Software Data Plane: The Vendor Perspective.
IEEE J. Sel. Areas Commun., 2018

Virtual Network Isolation: Are We There Yet?
Proceedings of the 2018 Workshop on Security in Softwarized Networks: Prospects and Challenges, 2018

Policy Injection: A Cloud Dataplane DoS Attack.
Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos, 2018

HARMLESS: Cost-Effective Transitioning to SDN for Small Enterprises.
Proceedings of the 17th International IFIP TC6 Networking Conference, 2018

A Survey on the Programmable Data Plane: Abstractions, Architectures, and Open Problems.
Proceedings of the IEEE 19th International Conference on High Performance Switching and Routing, 2018

2017
Routes Obey Hierarchy in Complex Networks.
CoRR, 2017

Optimal resource pooling over legacy equal-split load balancing schemes.
Comput. Networks, 2017

HARMLESS: Cost-Effective Transitioning to SDN.
Proceedings of the Posters and Demos Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

2016
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond.
IEEE/ACM Trans. Netw., 2016

Dataplane Specialization for High-performance OpenFlow Software Switching.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes.
Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

Lying Your Way to Better Traffic Engineering.
Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016

2015
On the Scalability of Routing With Policies.
IEEE/ACM Trans. Netw., 2015

On providing fast protection with remote loop-free alternates - Analyzing and Optimizing Unit Cost Networks.
Telecommun. Syst., 2015

Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures.
Networks, 2015

Scalable and Efficient Multipath Routing: Complexity and Algorithms.
Proceedings of the 23rd IEEE International Conference on Network Protocols, 2015

2014
Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates.
Telecommun. Syst., 2014

Complex Networks as Nash Equilibria of Navigation Games.
CoRR, 2014

On the Computational Complexity of Policy Routing.
Proceedings of the Advances in Communication Networking, 2014

Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm.
Proceedings of the Advances in Communication Networking, 2014

Development and Performance Evaluation of Fast Combinatorial Unranking Implementations.
Proceedings of the Advances in Communication Networking, 2014

Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously.
Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

An Information-Theoretic Approach to Routing Scalability.
Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 2014

On the design of Resilient IP Overlays.
Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014

2013
Compact policy routing.
Distributed Comput., 2013

Memory size bounds of prefix DAGs
CoRR, 2013

Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates.
Comput. Commun., 2013

Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing.
Proceedings of the IFIP Networking Conference, 2013, Brooklyn, 2013

Router virtualization for improving IP-level resilience.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

High Availability in the Future Internet.
Proceedings of the Future Internet, 2013

Reduced information scenario for Shared Segment Protection.
Proceedings of the IEEE 4th International Conference on Cognitive Infocommunications, 2013

2012
Towards a statistical characterization of the competitiveness of oblivious routing.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012

Brief announcement: network formation games can give rise to realistic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

IP fast reroute with remote Loop-Free Alternates: The unit link cost case.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Compressing IP forwarding tables for fun and profit.
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

2011
IP fast ReRoute: Loop Free Alternates revisited.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

An evaluation of approximate network optimization methods for improving ip-level fast protection with loop-free alternates.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

Autonomic DHCPv6 Architecture.
Proceedings of the Workshops Proceedings of the Global Communications Conference, 2011

Optimizing IGP link costs for improving IP-level resilience.
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011

2010
On optimal multipath rate-adaptive routing.
Proceedings of the 15th IEEE Symposium on Computers and Communications, 2010

Demand-Oblivious Routing: Distributed vs. Centralized Approaches.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

The Skeleton of the Internet.
Proceedings of the Global Communications Conference, 2010

Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds.
Proceedings of the Broadband Communications, Networks, and Systems, 2010

2009
Layer-preference policies in multi-layer GMPLS networks.
Photonic Netw. Commun., 2009

IP Fast ReRoute: Lightweight Not-Via.
Proceedings of the NETWORKING 2009, 2009

OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study.
Proceedings of the Modelling Autonomic Communications Environments, 2009

On Finding maximally redundant trees in strictly linear time.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

IP Fast ReRoute: Lightweight Not-Via without Additional Addresses.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2007
On shortest path representation.
IEEE/ACM Trans. Netw., 2007

Converging the Evolution of Router Architectures and IP Networks.
IEEE Netw., 2007

Fairness in Capacitated Networks: A Polyhedral Approach.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

A Novel Loop-Free IP Fast Reroute Algorithm.
Proceedings of the Dependable and Adaptable Networks and Services, 2007

Routing-Independent Fairness in Capacitated Networks.
Proceedings of IEEE International Conference on Communications, 2007

2006
On Improving the Accuracy of OSPF Traffic Engineering.
Proceedings of the NETWORKING 2006, 2006

2005
A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Practical OSPF traffic engineering.
IEEE Commun. Lett., 2004

On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
Proceedings of the NETWORKING 2004, 2004

A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

2003
Minimum Interference Routing: The Precomputation Perspective.
Proceedings of the Management of Multimedia Networks and Services, 2003

2001
QoS Routing with Incomplete Information by Analog Computing Algorithms.
Proceedings of the Quality of Future Internet Services, 2001


  Loading...