@article{commlet2004,
author = {G. R\'etv\'ari and T. Cinkler},
title = {Practical {OSPF} Traffic Engineering},
journal = {IEEE Commununications Letters},
volume = 8,
issue = 11,
month = {November},
year = {2004},
pages = {689-691},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/pote_commlet_2004.pdf},
doi = {10.1109/LCOMM.2004.837629},
abstract = {Open Shortest Path First (OSPF) traffic engineering (TE) is
intended to bring long-awaited traffic management
capabilities into IP networks, which still rely on today's
prevailing routing protocols: OSPF or IS-IS. In OSPF,
traffic is forwarded along, and split equally between,
equal cost shortest paths. In this letter, we formulate the
basic requirements placed on a practical TE architecture
built on top of OSPF and present a theoretical framework
meeting these requirements of practicality. The main
contribution of our work comes from the recognition that
coupled with an instance of the maximum throughput problem
there exists a related inverse shortest-path problem
yielding optimal OSPF link weights.}
}
@inproceedings{infocom2005,
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler and T. Henk},
title = {A Precomputation Scheme for Minimum Interference Routing: the {Least-Critical-Path-First} Algorithm},
booktitle = {IEEE INFOCOM 2005},
address = {Miami, Florida, USA},
month = {March},
year = {2005},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2005.pdf},
doi = {10.1109/INFCOM.2005.1497897},
abstract = {This paper focuses on the selection of bandwidth-guaranteed
channels for communication sessions that require it. The
basic idea comes from Minimum Interference Routing: select
a feasible path that puts the least possible restriction on
the available transmission capacity of other communicating
parties. This is achieved by circumventing some critical
bottleneck links. The main contribution of the paper is a
novel characterization of link criticality, the criticality
threshold, which can be readily precomputed for routing
dozens of subsequent calls. Based on this finding we define
a generic precomputation framework for minimum interference
routing, the Least-Critical-Path-First rout- ing
algorithm. We show by means of extensive simulations that
efficient route precomputation is possible even in the
case, when accurate resource availability information is
not immediately available.}
}
@article{ton2005,
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
title = {On Shortest Path Representation},
journal = {IEEE/ACM Transactions on Networking},
year = {2007},
month = {December},
volume = {15},
number = {6},
pages = {1293-1306},
issn = {1063-6692},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2005.pdf},
doi = {10.1109/TNET.2007.900708},
abstract = {Lately, it has been proposed to use shortest path first routing
to implement Traffic Engineering in IP networks. The idea
is to set the link weights so that the shortest paths, and
the traffic thereof, follow the paths designated by the
operator. Clearly, only certain shortest path representable
path sets can be used in this setting, that is, paths which
become shortest paths over some appropriately chosen
positive, integer-valued link weights. Our main objective
in this paper is to distill and unify the theory of
shortest path representability under the umbrella of a
novel flow-theoretic framework. In the first part of the
paper, we introduce our framework and state a descriptive
necessary and sufficient condition to characterize shortest
path representable paths. Unfortunately, traditional
methods to calculate the corresponding link weights usually
produce a bunch of superfluous shortest paths, often
leading to congestion along the unconsidered paths. Thus,
the second part of the paper is devoted to reducing the
number of paths in a representation to the bare minimum. To
the best of our knowledge, this is the first time that an
algorithm is proposed, which is not only able to find a
minimal representation in polynomial time, but also assures
link weight integrality. Moreover, we give a necessary and
sufficient condition to the existence of a one-to-one
mapping between a path set and its shortest path
representation. However, as revealed by our simulation
studies, this condition seems overly restrictive and
instead, minimal representations prove much more
beneficial.}
}
@inproceedings{infocom2007,
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
title = {Fairness in Capacitated Networks: a Polyhedral Approach},
booktitle = {IEEE INFOCOM 2007},
year = {2007},
month = {May},
address = {Anchorage, Alaska, USA},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2007.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2007.slides.pdf},
doi = {10.1109/INFCOM.2007.188},
abstract = {Abstract - The problem of fair and feasible allocation of user
throughputs in capacitated networks is investigated. The
main contribution of the paper is a novel geometric
approach, which facilitates to generalize several
throughput allocation strategies, most importantly max-min
fairness, from the traditional "fixed-path" model to a more
versatile, routing-independent model. We show that the set
of throughput configurations realizable in a capacitated
network makes up a polyhedron, which gives rise to a
max-min fair allocation completely analogous to the
conventional one. An algorithm to compute this polyhedron
is also presented, whose viability is demonstrated by
comprehensive evaluation studies.}
}
@article{network2007,
author = {A. Cs\'asz\'ar and G. Enyedi and M. Hidell and G. R\'etv\'ari and P. Sj\"odin},
title = {Converging the Evolution of Router Architectures and {IP} Networks},
journal = {IEEE Network Magazine, Special Issue on Advances in Network Systems Architecture},
year = {2007},
month = {July},
volume = {21},
number = {4},
pages = {8-14},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/network_2007.pdf},
doi = {10.1109/MNET.2007.386464},
abstract = {Although IP is widely recognized as the platform for
next-generation converged networks, it is, unfortunately,
heavily burdened by its heritage of almost 30
years. Nowadays, network operators must devote significant
resources to carry out tasks so essential like traffic
engineering, policy enforcement and security. In this
paper, we argue that one of the principal reasons for this
lies in the way control and forwarding planes are
interspersed in today's IP networks. We review the
architectural developments that led to the present
situation and we reason that centralization of network
control functionality can constitute a solution to the
pressing problems of contemporary Internet.}
}
@inproceedings{notvia_infocommini2009,
author = {G. Enyedi and P. Szil\'agyi and G. R\'etv\'ari and A Cs\'asz\'ar},
title = {{IP} Fast ReRoute: {Lightweight Not-Via} without Additional Addresses},
booktitle = {IEEE INFOCOM'09 Mini-Conference},
address = {Rio de Janeiro, Brasil},
year = {2009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/notvia_infocommini_2009.pdf},
pages = {2771-2775},
doi = {10.1109/INFCOM.2009.5062229},
abstract = {In order for IP to become a full-fledged carrier-grade
transport technology, a native IP failure-recovery scheme
is necessary that can correct failures in the order of
milliseconds. IP fast reroute (IPFRR) intends to fill this
gap, providing fast, local and proactive handling of
failures right in the IP layer. Building on experiences and
extensive measurement results collected with a prototype
implementation of the prevailing IPFRR technique, Not-via,
in this paper we identify high address management burden
and computational complexity as the major causes of why
commercial IPFRR deployment still lags behind, and we
present a lightweight not-via scheme, which, according to
our measurements, improves these issues.}
}
@inproceedings{hybrid_obl_infocom2010,
author = {G. R\'etv\'ari and G. N\'emeth},
month = {March},
title = {Demand-Oblivious Routing: Distributed vs. Centralized Approaches},
booktitle = {IEEE INFOCOM 2010},
year = {2010},
location = {San Diego, CA, USA},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2010.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2010.slides.pdf},
doi = {10.1109/INFCOM.2010.5461925},
abstract = {Until recent years, it was more or less undisputed
common-sense that an accurate view on traffic demands is
indispensable for optimizing the flow of traffic through a
network. Lately, this premise has been questioned sharply:
it was shown that setting just a single routing, the so
called demand-oblivious routing, is sufficient to
accommodate any admissible traffic matrix in the network
with moderate link overload, so no prior information on
demands is absolutely necessary for efficient traffic
engineering. Demand-oblivious routing lends itself to
distributed implementations, so it scales well. In this
paper, we generalize demand-oblivious routing in a new way:
we show that, in contrast to the distributed case,
centralized demand-oblivious routing can eliminate link
overload completely. What is more, our centralized scheme
allows for optimizing the routes with respect to arbitrary
linear or quadratic objective function. We realize,
however, that a centralized scheme can become prohibitively
complex, therefore, we propose a hybrid
distributed-centralized algorithm, which, according to our
simulations, strikes a good balance between efficiency,
scalability and complexity.}
}
@inproceedings{infocom_2011,
author = {G. R\'etv\'ari and J. Tapolcai and G. Enyedi and A. Cs\'asz\'ar},
title = {{IP Fast ReRoute: Loop Free Alternates} Revisited},
booktitle = {IEEE INFOCOM 2011},
year = {2011},
pages = {2948-2956},
location = {Shanghai, China},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2011.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2011.slides.pdf},
doi = {10.1109/INFCOM.2011.5935135},
abstract = {IP Fast ReRoute (IPFRR) is the IETF standard for providing
fast failure protection in IP and MPLS/LDP networks and
Loop Free Alternates (LFA) is a basic specification for
implementing it. Even though LFA is simple and
unobtrusive, it has a significant drawback: it does not
guarantee protection for all possible failure cases.
Consequently, many IPFRR proposals have appeared lately,
promising full failure coverage at the price of added
complexity and non-trivial modifications to IP hardware and
software. Meanwhile, LFA remains the only commercially
available, and therefore, the only deployable IPFRR
solution. Deployment, however, crucially depends on the
extent to which LFA can protect failures in operational
networks. In this paper, therefore, we revisit LFA in
order to give theoretical insights and practical hints to
LFA failure coverage analysis. First, we identify the
topological properties a network must possess to profit
from good failure coverage. Then, we study how coverage
varies as new links are added to a network, we show how to
do this optimally and, through extensive simulations, we
arrive to the conclusion that cleverly adding just a couple
of new links can improve the quality of LFA protection
drastically.}
}
@inproceedings{podc_2011,
author = {G. R\'{e}tv\'{a}ri and A. Guly\'{a}s and Z. Heszberger and M. Csernai and J.J. B\'{i}r\'{o}},
title = {Compact policy routing},
booktitle = {ACM PODC 2011},
year = {2011},
isbn = {978-1-4503-0719-2},
location = {San Jose, California, USA},
pages = {149-158},
numpages = {10},
doi = {http://doi.acm.org/10.1145/1993806.1993828},
acmid = {1993828},
publisher = {ACM},
address = {New York, NY, USA},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/podc_2011.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/podc_2011.slides.pdf},
abstract = {This paper takes a first step towards generalizing compact
routing to arbitrary routing policies that favor a broader
set of path attributes beyond path length. Using the
formalism of routing algebras we identify the algebraic
requirements for a routing policy to be realizable with
sublinear size routing tables and we show that a wealth of
practical policies can be classified by our results. By
generalizing the notion of stretch, we also discover the
algebraic validity of compact routing schemes considered so
far and we show that there are routing policies for which
one cannot expect sublinear scaling even if permitting
arbitrary constant stretch.}
}
@inproceedings{hotnets_2012,
author = {G. R{\'{e}}tv{\'{a}}ri and Z. Csern{\'{a}}tony and
A. K\H{o}r\"{o}si and J. Tapolcai and
A. Cs{\'{a}}sz{\'{a}}r and G. Enyedi and G. Pongr{\'{a}}cz},
title = {Compressing {IP} Forwarding Tables for Fun and Profit},
booktitle = {ACM HotNets-XI},
year = {2012},
month = {October},
location = {Redmond, WA},
organization = {ACM},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/hotnets_2012.slides.pdf},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/hotnets_2012.pdf},
abstract = {About what is the smallest size we can compress an IP Forwarding
Information Base (FIB) down to, while still guaranteeing
fast lookup? Is there some notion of FIB entropy that could
serve as a compressibility metric? As an initial step in
answering these questions, we present a FIB data structure,
called Multibit Burrows-Wheeler transform (MBW), that is
fundamentally pointerless, can be built in linear time,
guarantees theoretically optimal longest prefix match, and
compresses to higher-order entropy. Measurements on a Linux
prototype provide a first glimpse of the applicability of
MBW.}
}
@inproceedings{sigcomm_2013,
author = {G. R{\'e}tv\'{a}ri and J. Tapolcai and A. K\H{o}r\"{o}si and A. Majd\'{a}n and Z. Heszberger},
title = {Compressing {IP} forwarding tables: Towards entropy bounds and beyond},
booktitle = {ACM SIGCOMM},
year = {2013},
pages = {111-122},
numpages = {12},
doi = {10.1145/2486001.2486009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/sigcomm_2013_tech_rep.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/sigcomm_2013.slides.pdf}
}
@inproceedings{infocom_2013,
author = {J. Tapolcai and G. R\'etv\'ari},
booktitle = {IEEE INFOCOM},
title = {Router virtualization for improving {IP}-level resilience},
year = {2013},
volume = {},
number = {},
pages = {935-943},
doi = {10.1109/INFCOM.2013.6566882},
location = {Turin, Italy},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2013.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2013.slides.pdf},
month = {April}
}
@inproceedings{hotnets_2014,
author = {G. R{\'e}tv\'{a}ri and D. Szab\'{o} and A. Guly\'{a}s and A. K\H{o}r\"{o}si and J. Tapolcai},
title = {An Information-Theoretic Approach to Routing Scalability},
booktitle = {ACM HotNets-XIII},
year = {2014},
location = {Los Angeles, CA, USA},
pages = {1-7},
articleno = {2},
numpages = {7},
doi = {10.1145/2670518.2673863},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/hotnets_2014.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/hotnets_2014.slides.pdf}
}
@article{ton_2014,
author = {Guly\'{a}s, Andr\'{a}s and R{\'e}tv\'{a}ri, G\'{a}bor and Heszberger, Zal\'{a}n and Agarwal, Rachit},
title = {On the Scalability of Routing with Policies},
journal = {IEEE/ACM Transactions on Networking},
issue_date = {October 2015},
volume = {23},
number = {5},
month = oct,
year = {2015},
issn = {1063-6692},
pages = {1610-1618},
numpages = {9},
doi = {10.1109/TNET.2014.2345839},
acmid = {2872510},
abstract = {Today's ever-growing networks call for routing schemes with sound
theoretical scalability guarantees. In this context, a
routing scheme is scalable if the amount of memory needed
to implement it grows significantly slower than the network
size. Unfortunately, theoretical scalability
characterizations only exist for shortest path routing, but
for general policy routing that current and future networks
increasingly rely on, very little understanding is
available. In this paper, we attempt to fill this gap. We
define a general framework for policy routing, and we study
the theoretical scaling properties of three fundamental
policy models within this framework. Our most important
contributions are the finding that, contrary to shortest
path routing, there exist policies that inherently scale
well, and a separation between the class of policies that
admit compact routing tables and those that do
not. Finally, we ask to what extent memory size can be
decreased by allowing paths to contain a certain bounded
number of policy violations and, surprisingly, we conclude
that most unscalable policies remain unscalable under the
relaxed model as well.},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2014.pdf}
}
@inproceedings{icnp_2014,
author = {A.~K\H{o}r\"osi and J.~Tapolcai and B.~Mih\'alka and G.~M\'esz\'aros and G. R\'etv\'ari},
title = {Compressing {IP} Forwarding Tables: Realizing Information-theoretical
Space Bounds and Fast Lookups Simultaneously},
booktitle = {Proc. IEEE ICNP},
year = {2014},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/icnp_2014.pdf}
}
@article{networks_2015,
author = {N{\'e}meth, G. and R{\'e}tv\'{a}ri, G.},
title = {Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures},
journal = {Networks},
doi = {10.1002/net.21617},
pages = {1-12},
year = {2015},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/networks_2015.pdf}
}
@article{nat_comm_2015,
author = {Guly\'as, A. and B\'ir\'o, J. J. and K\H{o}r\"osi, A. and
R\'etv\'ari, G. and Krioukov, D.},
title = {Navigable networks as {Nash} equilibria of navigation games},
journal = {Nature Communications},
volume = {6},
number = {7651},
doi = {10.1038/ncomms8651},
year = {2015},
month = {July},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/nat_comm_2015.pdf}
}
@inproceedings{icnp_2015,
author = {Tapolcai, J. and R\'etv\'ari, G. and Babarczi, P. and B\'erczi-Kov\'acs, E. and Krist\'of, P. and Enyedi, G.},
title = {Scalable and Efficient Multipath Routing: Complexity and Algorithms},
booktitle = {23rd IEEE International Conference on Network Protocols (ICNP)},
year = {2015},
pages = {1-10},
address = {San Francisco, CA, USA},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/icnp_2015.pdf}
}
@inproceedings{conext_2016,
author = {M. Chiesa and G. R{\'e}tv{\'a}ri and M. Schapira},
title = {Lying Your Way to Better Traffic Engineering},
booktitle = {ACM CoNEXT},
pages = {391-398},
numpages = {8},
doi = {10.1145/2999572.2999585},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/conext_2016.pdf},
year = {2016}
}
@inproceedings{sigcomm_2016,
author = {L. Moln{\'a}r and G. Pongr{\'a}cz and G. Enyedi and Z. L. Kis and
L. Csikor and F. Juh{\'a}sz and A. K\H{o}r\"{o}si and
G. R{\'e}tv\'{a}ri},
title = {Dataplane Specialization for High Performance {OpenFlow} Software Switching},
booktitle = {ACM SIGCOMM},
year = {2016},
pages = {539-552},
numpages = {14},
acmid = {2934887},
doi = {10.1145/2934872.2934887},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/sigcomm_2016.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/sigcomm_2016.slides.pdf}
}
@inproceedings{netpl_2017,
author = {G. R{\'e}tv\'{a}ri and L. Moln{\'a}r and G. Pongr{\'a}cz and G. Enyedi},
title = {Dynamic Compilation and Optimization of Packet Processing Programs},
booktitle = {ACM SIGCOMM 2017 The Third Workshop on Networking and Programming Languages (NetPL)},
year = {2017},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/netpl_2017.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/netpl_2017.slides.pdf}
}
@article{scientific_reports_2017,
title = {Routes Obey Hierarchy in Complex Networks},
author = {A. Csoma and A. K{\H{o}}r{\"o}si and G. R{\'e}tv{\'a}ri and Z. Heszberger and J. J. B{\'\i}r{\'o} and M. Sl{\'\i}z and A. Avena-Koenigsberger and A. Griffa and P. Hagmann and A. Guly{\'a}s},
journal = {Nature Scientific Reports},
volume = {7},
year = {2017},
comment = {impact factor 4.26},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/scientific_reports_2017.pdf}
}
@article{ton_2018_1,
author = {Nagy, M{\'a}t{\'e} and T{\'a}polcai, J{\'a}nos and R{\'e}tv{\'a}ri, G{\'a}bor},
title = {Node Virtualization for {IP} Level Resilience},
journal = {IEEE/ACM Transactions of Networking},
issue_date = {June 2018},
volume = {26},
number = {3},
month = jun,
year = {2018},
issn = {1063-6692},
pages = {1250-1263},
numpages = {14},
doi = {10.1109/TNET.2018.2829399},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2018_1.pdf},
acmid = {3281053},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA}
}
@article{ton_2018_2,
author = {Chiesa, Marco and Retvari, Gabor and Schapira, Michael},
title = {Oblivious Routing in {IP} Networks},
journal = {IEEE/ACM Transactions on Networking},
issue_date = {June 2018},
volume = {26},
number = {3},
month = jun,
year = {2018},
issn = {1063-6692},
pages = {1292-1305},
numpages = {14},
doi = {10.1109/TNET.2018.2832020},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2018_2.pdf},
acmid = {3281066},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA}
}
@article{jsac_2018,
author = {T. L{\'e}vai and G. Pongr{\'a}cz and P. Megyesi and P. V{\"o}r{\"o}s and S. Laki and F. N{\'e}meth and G. R{\'e}tv{\'a}ri},
journal = {IEEE Journal on Selected Areas in Communications},
title = {The Price for Programmability in the Software Data Plane: The Vendor Perspective},
year = {2018},
volume = {36},
number = {12},
pages = {2621-2630},
doi = {10.1109/JSAC.2018.2871307},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/jsac_2018.pdf},
issn = {0733-8716},
month = dec
}
@inproceedings{atc_2019,
author = {Kashyap Thimmaraju and Saad Hermak and G{\'a}bor R{\'e}tv{\'a}ri and Stefan Schmid},
title = {{MTS}: Bringing Multi-Tenancy to Virtual Networking},
booktitle = {2019 {USENIX} Annual Technical Conference ({USENIX} {ATC} 19)},
year = 2019,
isbn = {978-1-939133-03-8},
address = {Renton, WA},
pages = {521-536},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/atc_2019.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/atc_2019.slides.pdf},
publisher = {{USENIX} Association},
month = jul
}
@article{jsac_2019,
author = {J. {Tapolcai} and G. R{\'e}tv{\'a}ri and P. {Babarczi} and E. R. B{\'e}rczi-Kov{\'a}cs},
journal = {IEEE Journal on Selected Areas in Communications},
title = {Scalable and Efficient Multipath Routing via Redundant Trees},
year = {2019},
volume = {37},
number = {5},
pages = {982-996},
doi = {10.1109/JSAC.2019.2906742},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/jsac_2019.pdf},
month = {May}
}
@article{procieee_2019,
author = {L. {Linguaglossa} and S. {Lange} and S. {Pontarelli} and G. {R{\'e}tv{\'a}ri} and D. {Rossi} and T. {Zinner} and R. {Bifulco} and M. {Jarschel} and G. {Bianchi}},
journal = {Proceedings of the IEEE},
title = {Survey of Performance Acceleration Techniques for {Network Function Virtualization}},
year = {2019},
volume = {107},
number = {4},
pages = {746-764},
doi = {10.1109/JPROC.2019.2896848},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/procieee_2019.pdf}
}
@inproceedings{conext_2019_1,
author = {L. Csikor and D.M. Divakaran and M.S. Kang and A. K\H{o}r\"{o}si and B. Sonkoly and D. Haja and D. Pezaros and S. Schmid and G. R{\'e}tv\'{a}ri},
title = {Tuple Space Explosion: A Denial-of-service Attack Against a Software Packet Classifier},
booktitle = {ACM CoNEXT},
year = {2019},
pages = {292-304},
numpages = {13},
doi = {10.1145/3359989.3365431},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/conext_2019_2.pdf}
}
@inproceedings{conext_2019_2,
author = {F. N{\'e}meth and M. Chiesa and G. R{\'e}tv\'{a}ri},
title = {Normal Forms for Match-action Programs},
booktitle = {ACM CoNEXT},
year = {2019},
pages = {44-50},
numpages = {7},
doi = {10.1145/3359989.3365417},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/conext_2019_1.pdf}
}
@inproceedings{nsdi_2020,
author = {T. L{\'e}vai and F. N{\'e}meth and B. Raghavan and G. R{\'e}tv{\'a}ri},
title = {Batchy: Batch-scheduling Data Flow Graphs with Service-level Objectives},
booktitle = {17th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 20)},
year = {2020},
address = {Santa Clara, CA},
pages = {633-649},
url = {https://www.usenix.org/conference/nsdi20/presentation/levai},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/nsdi_2020.pdf},
publisher = {{USENIX} Association}
}
@inproceedings{sosr_2020,
author = {G. Antichi and G. R\'{e}tv\'{a}ri},
title = {Full-Stack {SDN}: The Next Big Challenge?},
year = {2020},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
booktitle = {Proceedings of the Symposium on SDN Research},
pages = {48–54},
numpages = {7},
location = {San Jose, CA, USA},
series = {SOSR ’20},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/sosr_2020.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/sosr_2020.slides.pdf},
url = {https://doi.org/10.1145/3373360.3380834},
doi = {10.1145/3373360.3380834}
}
@article{scientific_reports_2020,
title = {The role of detours in individual human navigation patterns of complex networks},
author = {Guly{\'a}s, Andr{\'a}s and B{\'\i}r{\'o}, J{\'o}zsef and R{\'e}tv{\'a}ri, G{\'a}bor and Nov{\'a}k, M{\'a}rton and K{\H{o}}r{\"o}si, Attila and Sl{\'\i}z, Mariann and Heszberger, Zal{\'a}n},
journal = {Scientific reports},
volume = {10},
number = {1},
pages = {1-10},
year = {2020},
publisher = {Nature Publishing Group},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/scientific_reports_2020.pdf}
}
@article{csur_2021,
author = {Michel, Oliver and Bifulco, Roberto and R\'{e}tv\'{a}ri, G\'{a}bor and Schmid, Stefan},
title = {The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications},
year = {2021},
issue_date = {April 2021},
publisher = {Association for Computing Machinery},
volume = {54},
number = {4},
doi = {10.1145/3447868},
journal = {ACM Comput. Surv.},
month = may,
articleno = {82},
numpages = {36},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/csur_2021.pdf}
}
@article{comst_2021,
author = {Chiesa, Marco and Kamisiński, Andrzej and Rak, Jacek and R\'{e}tv\'{a}ri, G\'{a}bor and Schmid, Stefan},
journal = {IEEE Communications Surveys Tutorials},
title = {A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks},
year = {2021},
volume = {23},
number = {2},
pages = {1253-1301},
doi = {10.1109/COMST.2021.3063980},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/comst_2021.pdf}
}
@inproceedings{asplos_2022,
author = {Miano, Sebastiano and Sanaee, Alireza and Risso, Fulvio and R\'{e}tv\'{a}ri, G\'{a}bor and Antichi, Gianni},
title = {Domain Specific Run Time Optimization for Software Data Planes},
year = {2022},
publisher = {Association for Computing Machinery},
doi = {10.1145/3503222.3507769},
booktitle = {Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems},
pages = {1148-1164},
numpages = {17},
series = {ASPLOS 2022},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/asplos_2022.pdf}
}
@inproceedings{infocom_2023,
title = {Self-adjusting partially ordered lists},
author = {Addanki, Vamsi and Pacut, Maciej and Pourdamghani, Arash and R{\'e}tv{\'a}ri, Gabor and Schmid, Stefan and Vanerio, Juan},
booktitle = {IEEE INFOCOM 2023-IEEE Conference on Computer Communications},
pages = {1-10},
year = {2023},
organization = {IEEE},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_2023.pdf}
}
@article{ton_2023,
title = {Morpheus: A Run Time Compiler and Optimizer for Software Data Planes},
author = {Miano, Sebastiano and Sanaee, Alireza and Risso, Fulvio and R\'{e}tv\'{a}ri, G\'{a}bor and Antichi, Gianni},
journal = {IEEE/ACM Transactions on Networking},
number = {1},
pages = {1-16},
year = {2023},
publisher = {IEEE Computer Society},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2023.pdf}
}
This file was generated by bibtex2html 1.99.
last modified: Tue Jan 2 02:49:45 PM CET 2024