@article{magytav1999,
author = {K. Kiss and G. R\'etv\'ari},
title = {Multicast \'{u}tvonalv\'{a}laszt\'{a}s {ATM} feletti {IP} h\'{a}l\'{o}zatokban (hungarian)},
journal = {Magyar T\'avk{\"{o}}zl\'es},
month = {May},
year = 1999
}
@inproceedings{eunice1999,
author = {K. Kiss and G. R\'etv\'ari},
title = {Verification of a new scalable {IP/ATM} multicast routing protocol},
booktitle = {Proceedings of {EUNICE '99}},
address = {Barcelona, Spain},
pages = {89-94},
month = {September},
year = {1999},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/eunice_1999.pdf},
abstract = {This paper summarizes the work for defining and starting to
verify a new protocol. The goal was to create a multicast
routing protocol, which works in an IP over ATM network
and, unlike the existing ones, is truly scalable. After
studying the literature, we realized that no existing
protocol is fully suitable for these requirements, so
modifying an existing one we created a new routing
protocol, and started to verify it using a formal
description tool. In the first chapter we discuss the
necessity of developing such a protocol. Next we provide
the goals for the new protocol and the results of the
studies of the existing proposals moreover some words are
told about the essentials of our new protocol. In the third
chapter we summarize the pros and the contras of the most
scalable proposal: SEAM. In the fourth part of this
documentation we show, how to manage the multicast tree in
order to reach the best efficiency of network resource
utilization. In the fifth chapter we provide a brief
summary of the formal description of the new
protocol. Finally in the sixth chapter we summarize the
results of our verification studies.}
}
@inproceedings{eunice1999-2,
author = {G. R\'etv\'ari and R. Szab\'o},
title = {{QoS}-based routing and {IP} multicasting: a framework},
booktitle = {Proceedings of {EUNICE '99}},
address = {Barcelona, Spain},
pages = {51-56},
month = {September},
year = {1999},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/eunice_1999-2.pdf}
}
@inproceedings{vtc1999,
author = {K. Kiss and G. R\'etv\'ari},
title = {{SEAM} and {MNS}: a new scalable multicast routing protocol in {IP} over {ATM} networks},
booktitle = {Proceedings of Vehicular Technology Conference, 1999. VTC 1999 - Fall. IEEE VTS 50th},
volume = {2},
pages = {1268-1272},
year = {1999}
}
@inproceedings{eunice2000,
author = {G. R\'etv\'ari},
title = {Issues on {QoS} based routing in the {Integrated Services Internet}},
booktitle = {Proceedings of {EUNICE '00}},
address = {Enschede, Netherlands},
pages = {69-76},
month = {September},
year = {2000},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/eunice_2000.pdf},
abstract = {Given today's need for transmitting multimedia data over the
Internet, large efforts have been made to specify and
implement various service classes (Integrated Services:
IntServ) over the well-known Internet Protocol (IP)
infrastructure. Distinguishing service classes introduces
the necessity of providing privileged treatment (QoS:
Quality of Service) to a subset of data packets. Network
resources dedicated to particular IP flows must be
allocated at the initial phase of a QoS communication at
each network node along the forwarding path. Calculation of
this forwarding path is the responsibility of a separate
routing module. While current routing protocols are not
capable of considering QoS requirements when selecting
paths, QoS enabled routing protocols increase the
likelihood of accommodating a particular IP flow in the
network according to its resource demands. Although the
components of an IntServ platform are given, attempting to
establish a functional testbed fails due to numerous design
and implementation reasons. A brief investigation of the
issues affecting the co-existence of resource reservation
and QoS routing is provided in this paper. As currently
IntServ can not take advantage of QoS routing, it is
restricted to utilize traditional best-effort routing
functionality. Several solutions are covered in this paper
to avoid this limitation. A series of fundamental
measurements are presented as well to demonstrate the
efficiency of the QoS-routing enabled IntServ platform.}
}
@inproceedings{hsn2001,
author = {J. Levendovszky and A. Fancsali and Cs. V\'egs\H{o} and G. R\'etv\'ari},
title = {Quadratic Optimization Algorithms for {QoS} Routing with Incomplete Information},
booktitle = {Proceedings of High Speed Networking 2001 Spring Workshop},
address = {Balatonf{\"{u}}red, Hungary},
pages = {113-119},
month = {May},
year = {2001}
}
@inproceedings{pch2001,
author = {G. R\'etv\'ari and R. Szab\'o and \'A. Marquetant},
title = {A novel approach to traffic engineering - core state limited load sharing},
booktitle = {Proceedings of PCH 2001 - 2001 Polish-Czech-Hungarian
Workshop on Circuit Theory, Signal Processing, and
Telecommunication Networks},
address = {Budapest, Hungary},
pages = {114-122},
year = {2001}
}
@inproceedings{ifip2001,
author = {J. Levendovszky and T. D\'avid and A. Fancsali and G. R\'etv\'ari and Cs. V\'egs\H{o}},
title = {{QoS} routing in packet switched networks -- novel algorithms for routing with incomplete information},
booktitle = {Proceedings of 9th IFIP Conference on Performance Modelling and Evaluation of ATM \& IP Networks},
address = {Budapest, Hungary},
pages = {249-260},
month = {June},
year = {2001},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ifip_2001.pdf},
abstract = {This paper investigates QoS routing in IP networks. The major
concern is to select paths to fulfill end-to-end delay and
minimum bandwidth requirements. Novel algorithms are
developed to tackle routing with incomplete information,
when link measures are subject to random fluctuations
described by some given p.d.f.-s. The new algorithms are
based on either assuming Gaussian link delay distribution
or using large deviation theory to find the most likely
path. The proposed methods are capable of QoS routing in
polynomial time.}
}
@inproceedings{qofis2001,
author = {J. Levendovszky and A. Fancsali and G. R\'etv\'ari and Cs. V\'egs\H{o}},
title = {{QoS} routing with incomplete information by analog computing algorithms},
booktitle = {Proceedings of 2nd International Workshop on Quality of future Internet Services},
address = {Coimbra, Portugal},
volume = 56,
pages = {127-137},
month = {September},
year = {2001},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/qofis_2001.pdf},
doi = {10.1007/3-540-45412-8_10},
abstract = {The paper proposes novel algorithms for Quality of Service
(QoS) routing in IP networks. The new algorithms can handle
incomplete information, when link measures (e.g. link
delays, bandwidths... etc.) are assumed to be random
variables. Incomplete information can arise due to
aggregated information in PNNI and OSPF routing protocols,
which make link measures characterized by their
corresponding p.d.f. It will be demonstrated that the task
of QoS routing can be viewed as quadratic
optimization. Therefore, neural based optimization
algorithms implemented on an analog computer (CNN) can
provide fast routing algorithms even in the case of
incomplete information. As a result, real-time routing can
be carried out to meet end-to-end QoS (such as end-to-end
delay) requirements.}
}
@article{hirad2001,
author = {J. Levendovszky and G. R\'etv\'ari and Cs. V\'egs\H{o}},
title = {Statisztikus {egyenl\H{o}tlens\'egek} elm\'elet\'en alapul\'o {QoS} \'utvonalkeres\'es hi\'anyos linkinform\'aci\'o eset\'en (hungarian)},
journal = {H\'irad\'astechnika},
volume = 56,
issue = 11,
pages = {3-13},
month = {November},
year = {2001},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/hiradastech_2001.pdf}
}
@article{hirad2002,
author = {T. Sz\'en\'asi and G. R\'etv\'ari},
title = {Design and Implementation of a Traffic management Functionality for {RSVP}},
journal = {H\'irad\'astechnika (Communications)},
volume = 57,
issue = 12,
month = {December},
year = {2002},
pages = {21-27}
}
@inproceedings{hsn2002,
author = {J. Levendovszky and R. Szab\'o and G. R\'etv\'ari and \'A. Marquetant and Cs. V\'egs\H{o}},
title = {Novel Approach to Traffic Engineering in Packet Switched Networks -- An Analytic Approach},
booktitle = {Proceedings of High Speed Networking 2002 Spring Workshop},
address = {Budapest, Hungary},
pages = {27-28},
month = {May},
year = {2002}
}
@inproceedings{mmns2003,
author = {G. R\'etv\'ari},
title = {Minimum Interference Routing: The Precomputation Perspective},
booktitle = {Proc., 6th IFIP/IEEE International Conference on Management of Multimedia Networks and Services (MMNS)},
series = {Lecture Notes in Computer Science},
pages = {246-258},
month = {September},
year = {2003},
address = {Belfast, UK},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/mmns_2003.pdf},
doi = {10.1007/978-3-540-39404-4_19},
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 transmission capacity offered by the network for other
communicating parties. This is achieved by circumventing
certain critical bottleneck links. The main contribution of
the paper is a method to assess the degree of link
criticality facilitating efficient route precomputation
even in the case, when up to date resource availability
information is not immediately available.}
}
@inproceedings{networking2004,
author = {G. R\'etv\'ari and R. Szab\'o and J. J. B\'ir\'o},
title = {On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity},
booktitle = {Lecture Notes in Computer Science: Proceedings of the Third International IFIP-TC6 Networking Conference},
address = {Athens, Greece},
pages = {1180-1191},
month = {May},
year = {2004},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/networking_2004.pdf},
doi = {10.1007/978-3-540-24693-0_97},
abstract = {The question, whether an optional set of routes can be
represented as shortest paths, and if yes, then how, has
been a rather scarcely investigated problem up until
now. In turn, an algorithm that, given an arbitrary set of
trafic engineered paths, can efficiently compute OSPF link
weights as to map the given paths to shortest paths may be
of huge importance in today's IP networks, which still rely
on legacy shortest-path-first routing protocols. This
article establishes the fundamental theory and algorithms
of shortest path representability, and concludes that in
general it is much more dificult task to compute shortest
path representable paths than to actually calculate link
weights for such paths.}
}
@inproceedings{iscc2004,
author = { G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
title = {A Novel {Lagrangian-relaxation} to the Minimum Cost Multicommodity
Flow Problem and its Application to {OSPF} Traffic
Engineering},
booktitle = {Proceedings of the The Ninth IEEE Symposium on Computers and Communications (ISCC'2004)},
address = {Alexandria, Egypt},
pages = {957-962},
volume = {2},
month = {June},
year = {2004},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/iscc_2004.pdf},
doi = {10.1109/ISCC.2004.1358664},
abstract = {The Minimum Cost Multicommodity Flow problem plays a central
role in today's operations research theory with
applications ranging from transportation and logistics to
telecommunications network routing. In this paper, we
introduce a novel Lagrangian-relaxation technique, which,
given an initial feasible solution, can solve the minimum
cost multicommodity flow problem as a sequence of
single-commodity flow problems. Our methodology is best
suited for OSPF traffic engineering, because it can rapidly
improve a given path set towards approximate optimality
while simultaneously provides the link weights, which
implement the paths as shortest paths.}
}
@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.}
}
@article{hirad2004,
author = {J. Szigeti and J. Tapolcai and G. R\'etv\'ari and L. L\'aposi and T. Cinkler},
title = {{\'U}tvonalkijel\"{o}l\'es \'es forgalomelvezet\'es t\"{o}bb tartom\'any\'u kapcsolt optikai h\'al\'ozatokban
(hungarian)},
journal = {H\'irad\'astechnika},
pages = {42-49},
volume = 59,
issue = 2,
month = {February},
year = {2004}
}
@inproceedings{hsn2004,
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
title = {Minimum Interference Routing: The Precomputation Perspective},
booktitle = {Proceedings of High Speed Networking 2004 Spring Workshop},
address = {Budapest, Hungary},
pages = {106-109},
month = {May},
year = {2004},
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 transmission capacity offered by the network for other
communicating parties. This is achieved by circumventing
certain critical bottleneck links. The main contribution of
the paper is a method to assess the degree of link
criticality facilitating efficient route precomputation
even in the case, when up to date resource availability
information is not immediately available.}
}
@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{eurongi2005,
author = {J. Tapolcai and P. Fodor and G. R\'etv\'ari and M. Maliosz and T. Cinkler},
title = {Class-based Minimum Interference Routing for Traffic Engineering in Optical Networks},
booktitle = {Proc., 1st EuroNGI Conference on Next Generation Internet Networks Traffic Engineering},
year = {2005},
month = {April},
address = {Rome, Italy}
}
@inproceedings{networking2006,
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
title = {On Improving the Accuracy of {OSPF Traffic Engineering}},
booktitle = {Lecture Notes in Computer Science: Proceedings of the Fifth International IFIP-TC6 Networking Conference},
address = {Coimbra, Portugal},
year = {2006},
pages = {51-62},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/mspr_networing_2006.pdf},
doi = {10.1007/11753810_5},
abstract = {The conventional forwarding rule used by IP networks is to
always choose the path with the shortest length -- in terms
of administrative link weights assigned to the links -- to
forward traffic. Lately, it has been proposed to use
shortest-path-first routing to implement Traffic
Engineering in IP networks, promising with a big boost in
the profitability of the legacy network infrastructure. The
idea is to set the link weights so that the shortest paths,
and the traffic thereof, follow the paths designated by the
operator. Unfortunately, traditional methods to calculate
the link weights usually produce a bunch of superfluous
shortest paths, often leading to congestion along the
unconsidered paths. In this paper, we introduce and
develop novel methods to increase the accuracy of this
process and, by means of extensive simulations, we show
that our proposed solution produces remarkably high quality
link weights.}
}
@inproceedings{wtc2006,
title = {Novel Methods For Traffic Engineering In Legacy {IP} Networks},
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
booktitle = {Proc., World Telecommunications Congress (WTC)},
year = {2006},
month = {May},
address = {Budapest, Hungary},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/wtc_2006.pdf},
abstract = {Abstract - A short introduction, a comprehensive survey of the
current state-of-the-art and an overview of some recent
progress in the field of OSPF Traffic Engineering (TE) is
given. Particularly, we study a multi-stage approach, where
the original problem is divided into three subsequent and
independent phases. This approach promises with breaking
down the intractability of OSPF TE and also to provide
interesting further insights. Finally, a simple heuristic
is proposed, whose viability is demonstrated by simulation
studies.}
}
@inproceedings{hsn2007,
author = {G. R\'etv\'ari},
title = {The geometry of networking, part {I}},
booktitle = {Proceedings of High Speed Networking 2007 Spring Workshop},
address = {Balatonkenese, Hungary},
month = {May},
year = {2007}
}
@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.}
}
@inproceedings{icc2007,
title = {Routing-independent Fairness in Capacitated Networks},
author = {G. R\'etv\'ari and J. J. B\'ir\'o and T. Cinkler},
booktitle = {Proc., IEEE International Conference on Communications (ICC 2007)},
year = {2007},
month = {June},
address = {Glasgow, Scotland},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/icc_2007.pdf},
doi = {10.1109/ICC.2007.1050},
abstract = {The problem of fair and feasible allocation of user
throughputs in capacitated networks is investigated. The
main contribution of the paper is an extension of network
fairness, and in particular, 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.}
}
@inproceedings{eunice_2007,
title = {A Novel Loop-free {IP Fast Reroute} Algorithm},
author = {G. Enyedi and G. R\'etv\'ari and T. Cinkler},
booktitle = {Proc., 13th EUNICE Open European Summer School},
year = {2007},
month = {July},
doi = {10.1007/978-3-540-73530-4_14},
abstract = {Although providing reliable network services is getting more
and more important, currently used methods in IP networks
are typically reactive and error correcting can take a long
time. One of the most interesting solutions is interface
based fast rerouting, where not only the destination
address but also the incoming interface is taken into
account during the forwarding. Unfortunately, current
methods can not handle all the possible situations as they
are prone to form loops and make parts of the network with
no failure unavailable. In this paper we propose a new
interface based routing method, which always avoids loops
for the price of a bit longer paths. We also present
extensive simulation results to compare current and
proposed algorithms.}
}
@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{ngi_2008,
author = {Enyedi, G. and R\'etv\'ari, G.},
title = {A Loop-Free Interface-Based Fast Reroute Technique},
booktitle = {Next Generation Internet Networks, 2008. NGI 2008},
year = {2008},
month = {April},
pages = {39-44},
doi = {10.1109/NGI.2008.12}
}
@inproceedings{networks2008,
author = {P. Fodor and G. Enyedi and G. R\'etv\'ari and T. Cinkler},
title = {An Efficient and Practical Layer-preference Policy for Routing in {GMPLS} Networks},
booktitle = {the 13th International Telecommunications Network Strategy
and Planning Symposium, (Networks 2008)},
year = {2008},
month = {September},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/networks_2008.pdf},
doi = {10.1109/NETWKS.2008.4763706},
abstract = {We address the problem of routing Label Switched Paths
(LSPs) in multi-layer networks based on the Generalized
MultiProtocol Label Switching (GMPLS) paradigm. In
particular, we pursue strategies for choosing the
appropriate layer to host a new LSP request, since choosing
this policy has enormous impact on the eventual performance
of the network. Therefore, we developed a mixed strategy,
the Min-phys-hop routing and wavelength assignment
algorithm, as a policy to govern the selection of the best
layer of a multi-layer network in which to host new LSP
requests. In this paper, we discuss the practical issues
concerning the deployment of this algorithm in modern GMPLS
networks. Firstly, we discuss the applicability of the
algorithm with respect to the state-of-the-art GMPLS
standards, above all, the GMPLS routing extensions to
OSPF-TE. We also sketch two possible reference deployment
scenarios. Secondly, we present simulation studies to
demonstrate that (1) there does not exist a universally
optimal static layer-preference policy and (2) the
Min-phys-hop algorithm realizes an adequate heuristics even
considering the realistic limitations of contemporary
network devices. We found that the Min-phys-hop algorithm
produces close-to-optimal blocking and resource consumption
under almost all possible selections of input parameters,
and this is regardless of the wavelength and
Optical-Electrical-Optical (OEO) conversion capability
present in the network.}
}
@inproceedings{hsn2009,
author = {G. R\'etv\'ari},
title = {The geometry of networking, part {II}},
booktitle = {Proceedings of High Speed Networking 2009 Spring Workshop},
address = {Balatonkenese, Hungary},
month = {May},
year = {2009}
}
@article{phot_net_2009,
author = {P. Fodor and G. Enyedi and G. R\'{e}tv\'{a}ri and T. Cinkler},
title = {Layer-preference policies in multi-layer {GMPLS} networks},
journal = {Photonic Network Communications},
volume = {18},
issue = {3},
pages = {300-313},
year = {2009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/photonic_net_com_2009.pdf},
doi = {10.1007/s11107-009-0193-y},
abstract = {We address the problem of routing Label Switched Paths (LSPs)
in multi-layer networks based on the Generalized
MultiProtocol Label Switching (GMPLS) paradigm. In
particular, we pursue policies for choosing the appropriate
layer to host a new LSP request, as we find that such
layer-preference policies have significant impact on
network performance. We discuss several simple
layer-preference policies and we reveal why these simple
policies ruin network performance in the long run.
Consequently, we develop an efficient heuristics, the
Min-phys-hop routing and wavelength assignment algorithm,
to govern the selection of the best layer of a multi-layer
network in which to host new LSP requests. We discuss the
applicability of this algorithm with respect to the
state-of-the-art GMPLS standards, above all, the GMPLS
routing extensions to OSPF-TE. By extensive simulations, we
justify that the Min-phys-hop algorithm produces
close-to-optimal blocking and resource consumption under
almost all possible selections of input parameters, and
this is regardless of the wavelength and
Optical-Electrical-Optical (OEO) conversion capability
present in the network.}
}
@article{hirad2009,
author = {G. Enyedi and G. R\'etv\'ari},
title = {Gyors hibajav\'it\'as {IP} h\'al\'ozatokban (in hungarian)},
journal = {H\'irad\'astechnika},
volume = 64,
issue = {3-4},
pages = {20-24},
year = {2009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/hiradastech_2009.pdf}
}
@inproceedings{efipsans_09,
author = {F. N\'emeth and G. R\'etv\'ari and Z. Heszberber and A. Guly\'as},
title = {Demystifying Self-awareness of Autonomic Systems},
booktitle = {Proc., ICT Mobile and Wireless Communications Summit (MobileSummit)},
year = {2009},
month = {June},
address = {Santander, Spain},
abstract = {Self-awareness is a much discussed property of autonomic and
self-managed networks. Attempting to demystify this
property we show that it can be captured by a Self
Awareness Function (SAF) that stems from the assessment of
process correctness of autonomic and cognitive
networks. Based on multiple position papers that were
written in isolation we are able to identify various SAFs
(for trust, security, dynamics control, service
deployment), as well as associated research issues
(information modelling, higher contextualisation,
convergence, etc.). We show that multiple issues of self
-management that create a tangled hierarchy of control
loops can be systematically addressed with SAF in mind.}
}
@inproceedings{networking2009,
author = {G. Enyedi and P. Szil\'agyi and G. R\'etv\'ari and A Cs\'asz\'ar},
title = {{IP} Fast ReRoute: {Lightweight Not-Via}},
booktitle = {Lecture Notes in Computer Science: Proceedings of the IFIP Networking'09},
address = {Aachen, Germany},
year = {2009},
pages = {157-168},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/notvia_networking_2009.pdf},
doi = {10.1007/978-3-642-01399-7_13},
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{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{redtrees_iscc2009,
author = {G. Enyedi and G. R\'etv\'ari and A Cs\'asz\'ar},
title = {On Finding Maximally Redundant Trees in Strictly Linear Time},
booktitle = {IEEE Symposium on Computers and Communications (ISCC 2009) },
address = {Tunesia},
year = {2009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/redtrees_iscc_2009.pdf},
doi = {10.1109/ISCC.2009.5202302},
pages = {206-211},
abstract = {Redundant trees are commonly used for protection and
restoration in communications networks. Zhang et
al. presented a linear time algorithm to compute
node-redundant trees in 2-node-connected networks, which
has become widely cited in the literature. In this paper,
we show that it is difficult to implement this algorithm
providing both correctness and linear complexity at the
same time. Therefore, we present a revised algorithm with
strict linear time complexity. Moreover, we generalize the
concept of node-redundant trees from 2-node-connected
networks to arbitrary topologies, a crucial development
since real networks can not always satisfy 2-connectedness,
especially after a failure.}
}
@inproceedings{ospf_mace09,
author = {G. R\'etv\'ari and F. N\'emeth and C. Ranganai and R. Szab\'o},
month = {October},
title = {{OSPF} for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study},
booktitle = {MACE'09, the 4th International Workshop on Modelling Autonomic Communications Environments},
year = {2009},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ospf_mace_2009.pdf},
doi = {10.1007/978-3-642-05006-0_6},
abstract = {Autonomicity, realized through control-loop structures
operating within network devices and the network as a
whole, is an enabler for advanced and enriched
self-manageability of network devices and networks. In this
paper, we argue that the degree of self-management and
self-adaptation embedded by design into existing protocols
needs to be well understood before one can enhance or
integrate such protocols into self-managing network
architectures that exhibit more advanced autonomic
behaviors. We justify this claim through an illustrative
case study: we show that the well-known and extensively
used intra-domain IP routing protocol, OSPF, is itself a
quite capable self-managing entity, complete with all the
basic components of an autonomic networking element like
embedded control-loops, decision-making modules,
distributed knowledge repositories, etc. We describe these
components in detail, concentrating on the numerous
control-loops inherent to OSPF, and discuss how some of the
control-loops can be enriched with external decision making
logics to implement a truly self-adapting routing
functionality.}
}
@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{optimal_control_iscc2010,
author = {G. R{\'{e}}tv{\'{a}}ri and G. N{\'{e}}meth},
month = {June},
title = {On Optimal Multipath Rate-adaptive Routing},
booktitle = {15th IEEE Symposium on Computers and Communications (ISCC 2010)},
year = {2010},
address = {Riccione, Italy},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/iscc_2010.pdf},
doi = {10.1109/ISCC.2010.5546757},
abstract = {A centralized rate-adaptive routing algorithm is presented
that, in contrast to the distributed ones available in the
literature, achieves provable stability, optimalilty with
respect to optional linear or quadratic objective
functions, and feasibility in that it can accommodate any
admissible traffic matrix in the network without violating
link capacities. We recast the routing problem in the
framework of constrained optimal control theory to obtain
optimal state feedback routing controllers, and we present
simulations confirming that our routing controllers are
viable in small- and middle-sized networks.}
}
@inproceedings{broadnets2010,
author = {G. N\'emeth and G. R\'etv\'ari},
title = {Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds},
booktitle = {7th International ICST Conference on Broadband Communications, Networks, and Systems (BROADNETS 2010)},
year = {2010},
pages = {25-27},
location = {Athens, Greece},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/broadnets_2010.pdf},
doi = {10.1007/978-3-642-30376-0_7}
}
@inproceedings{globecom2010,
author = {M. Csernai and A. Guly{\'a}s and G. R{\'e}tv{\'a}ri and Z. Heszberger and
A. Cs{\'a}sz{\'a}r},
title = {The Skeleton of the Internet},
booktitle = {IEEE GLOBECOM},
year = {2010},
month = {November},
pages = {1-5},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/globecom_2010.pdf},
doi = {10.1109/GLOCOM.2010.5684319},
abstract = {Research works concerning AS (Autonomous Systems) level
Internet topology measurements typically aim at obtaining
near-complete maps of the AS structure. In this paper, we
take a fundamentally different approach by inspecting
several concurrently visible local views of the AS graph
stored at individual BGP route servers. We find that each
of these views exhibits the characteristic properties of
complex graphs having power-law degree distribution, large
clustering coefficient and the small world property. As a
main contribution, the intersection of these views is
investigated to identify the skeleton of the Internet
consisting of edges seen by most of the ASes. Our
measurements support the surprising claim that this
skeleton is a scale-free complex network, having a giant
connected component with a dense part in its heart forming
the critical AS level core. We identify the edges in the
skeleton as critical infrastructure, any changes of which
induces an Internet-wide effect with BGP updates
propagating to all ASes. Finally, we reinterpret the path
inflation metric using the local view approach and show
that local path inflation can be very diverse in different
ASes.}
}
@article{pp_2010,
author = {G. Enyedi and G. R\'etv\'ari},
title = {Finding Multiple Maximally Redundant Trees in Linear Time},
journal = {Periodica Polytechnica},
volume = 54,
issue = {1-2},
pages = {29-40},
year = {2010},
doi = {10.3311/pp.ee.2010-1-2.04},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/periodica_poly_2010.pdf},
abstract = {Redundant trees are directed spanning trees, which provide
disjoint paths towards their roots. Therefore, this concept
is widely applied in the literature both for providing
protection and load sharing. The fastest algorithm can find
multiple redundant trees, a pair of them rooted at each
vertex, in linear time. Unfortunately, edge- or
vertex-redundant trees can only be found in 2-edge- or
2-vertex-connected graphs respectively. Therefore, the
concept of maximally redundant trees was introduced, which
can overcome this problem, and provides maximally disjoint
paths towards the common root. In this paper, we propose
the first linear time algorithm, which can compute a pair
of maximally redundant trees rooted at not only one, but at
each vertex.}
}
@incollection{igi_2011,
author = {G. R\'etv\'ari and F. N\'emeth and I. Hokelek and M. Fecko and A. Prakash and R. Chaparadza and M. Wodzak and B. Vidalenc},
title = {A guideline for realizing the vision on {Autonomic Networking}: Implementing self-adaptive routing on top of {OSPF}},
booktitle = {Formal and Practical Aspects of Autonomic Computing and Networking: Specification, Development, and Verification},
editor = {Cong-vinh, Phan},
year = {2011},
isbn = {1609608453, 9781609608453},
edition = {1st},
publisher = {Information Science Reference - Imprint of: IGI Publishing},
address = {Hershey, PA}
}
@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{drcn_2011,
author = {G. R\'etv\'ari and L. Csikor and J. Tapolcai and G. Enyedi and A. Cs\'asz\'ar},
title = {Optimizing {IGP} link costs for improving {IP-level} resilience (Best Paper Award)},
booktitle = {Design of Reliable Communication Networks (DRCN), 2011 8th International Workshop on the},
year = {2011},
month = {October},
pages = {62-69},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/drcn_2011.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/drcn_2011.slides.pdf},
doi = {10.1109/DRCN.2011.6076886},
abstract = {Recently, major vendors have introduced new router platforms
to the market that support fast IP-level failure protection
out of the box. The implementations are based on the IP
Fast ReRoute-Loop Free Alternates (LFA) standard. LFA is
simple, unobtrusive, and easily deployable. This
simplicity, however, comes at a severe price, in that LFA
usually cannot protect all possible failure scenarios. In
this paper, we give new graph theoretical tools for
analyzing LFA failure case coverage and we seek ways for
improvement. In particular, we investigate how to optimize
IGP link costs to maximize the number of protected failure
scenarios, we show that this problem is NP-complete even in
a very restricted formulation, and we give exact and
approximate algorithms to solve it. Our simulation studies
show that a deliberate selection of IGP costs can bring
many networks close to complete LFA-based protection.}
}
@inproceedings{globecom_2011,
author = {Cs. Simon and F. N\'emeth and F. Uzs\'ak and G. R\'etv\'ari and F. Ficsor and R. Vida},
booktitle = {GLOBECOM Workshops, 2011 IEEE},
title = {Autonomic {DHCPv6} Architecture},
year = {2011},
month = {December},
volume = {},
number = {},
pages = {620-624},
doi = {10.1109/GLOCOMW.2011.6162526}
}
@inproceedings{rndm_2011,
author = {M. Nagy and G. R\'etv\'ari},
title = {An evaluation of approximate network optimization methods for
improving {IP}-level fast protection with {Loop-free
Alternates}},
booktitle = {Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2011 3rd International Congress on},
year = {2011},
month = {October},
pages = {1-7},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/rndm_2011.pdf},
issn = {2157-0221}
}
@inproceedings{rndm_2012,
author = {L. Csikor and G. R\'etv\'ari},
title = {{IP Fast Reroute} with {Remote Loop-Free Alternates}: The Unit Link Cost Case},
booktitle = {Proceedings of RNDM 2012, the 4th International Workshop on
Reliable Networks Design and Modeling},
year = {2012},
month = {October},
pages = {16-22},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/rndm_2012.pdf}
}
@article{dist_comp_2012,
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},
journal = {Distributed Computing},
year = {2013},
volume = {26},
number = {5},
pages = {309-320},
issn = {1432-0452},
doi = {10.1007/s00446-012-0181-9},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/dist_comp_2012.pdf},
publisher = {Springer-Verlag},
abstract = {The main concern in this paper is to generalize 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. Finally, we apply our
methodology to the routing policies used in Internet
inter-domain routing, and we show that our algebraic
approach readily generalizes to this setting as well.}
}
@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{networks_2012,
author = {K. N\'emeth and G. R\'etv\'ari},
title = {Traffic Splitting Algorithms in Multipath Networks: Is the Present Practice Good Enough?},
booktitle = {the 15th International Telecommunications Network Strategy
and Planning Symposium, (Networks 2012)},
year = {2012},
month = {October}
}
@article{sigmetrics_2012,
author = {G. N{\'e}meth and G. R{\'e}tv\'{a}ri},
title = {Towards a statistical characterization of the competitiveness of oblivious routing (short paper)},
journal = {SIGMETRICS Perform. Eval. Rev.},
issue_date = {June 2012},
volume = {40},
number = {1},
month = {June},
year = {2012},
issn = {0163-5999},
pages = {387-388},
numpages = {2},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/sigmetrics_2012.pdf},
doi = {10.1145/2318857.2254806},
acmid = {2254806},
publisher = {ACM},
address = {New York, NY, USA}
}
@article{telsys_2012,
author = {M. Nagy and J. Tapolcai and G. R\'etv\'ari},
title = {Optimization Methods for Improving {IP}-level Fast Protection for
Local {Shared Risk Groups} with {Loop-Free Alternates}},
journal = {Telecommunication Systems},
year = {2012},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/tel_sys_2012.pdf}
}
@article{comp_comm_2012,
author = {L. Csikor and J. Tapolcai and G. R\'etv\'ari},
title = {Optimizing {IGP} link costs for improving {IP}-level resilience with {Loop-Free Alternates}},
journal = {Computer Communications},
volume = {},
number = {},
pages = {},
year = {2012},
issn = {0140-3664},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/comp_comm_2012.pdf},
doi = {10.1016/j.comcom.2012.09.004},
abstract = {The IP Fast ReRoute-Loop-Free Alternates (LFA) standard is a
simple and easily deployable technique to provide fast
failure protection right in the IP layer. To our days, most
major IP device vendors have products on the market that
support LFA out of the box. Unfortunately, LFA usually
cannot protect all possible failure scenarios in a general
network topology. Therefore, it is crucial to develop
LFA-based network optimization tools in order to assist
operators in deciding whether deploying LFA in their
network will supply sufficient resiliency. In this paper,
we give a new graph theoretical framework for analyzing LFA
failure case coverage, and then we investigate how to
optimize the Interior Gateway Protocol (IGP) link costs in
order to maximize the number of protected failure
scenarios. We show that this problem is NP-complete even in
a very restricted formulation, and we give an exact
algorithm as well as a complete family of heuristics to
solve it. Our simulation studies indicate that a deliberate
tuning of the approximation strategy can significantly
improve the quality of the IGP link costs, and we conclude
that LFA cost optimization has the potential for boosting
LFA-based resilience in most operational networks
significantly.}
}
@incollection{fia_chapter_2013,
author = {L. Csikor and G. R\'etv\'ari and J. Tapolcai},
title = {High Availability in the {Future Internet}},
booktitle = {The Future Internet},
volume = {7858},
series = {Lecture Notes in Computer Science},
editor = {Galis, Alex and Gavras, Anastasius},
doi = {10.1007/978-3-642-38082-2_6},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/fia_chapter_2013.pdf},
publisher = {Springer Berlin Heidelberg},
pages = {64-76},
year = {2013},
isbn = {978-3-642-38081-5}
}
@inproceedings{networking_2013,
author = {K. N{\'{e}}meth and A. K{\"{o}}r{\"{o}}si and G. R{\'{e}}tv{\'{a}}ri},
title = {Optimal {OSPF} traffic engineering using legacy {Equal Cost Multipath}
load balancing},
booktitle = {{IFIP} Networking Conference 2013},
pages = {1-9},
year = 2013
}
@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}
}
@inproceedings{eunice_2014,
author = {A. Majd\'an and G. R\'etv\'ari and J. Tapolcai and A. K\H{o}r\"osi},
title = {Development and Performance Evaluation of Fast Combinatorial Unranking
Implementations},
booktitle = {IFIP EUNICE},
year = {2014},
address = {Rennes, France}
}
@incollection{eunice_2014_2,
author = {Bence Mih{\'{a}}lka and
Attila K\H{o}r\"osi and
G{\'{a}}bor R{\'{e}}tv{\'{a}}ri},
title = {Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm},
booktitle = {Advances in Communication Networking},
volume = {8846},
series = {Lecture Notes in Computer Science},
editor = {Kermarrec, Yvon},
doi = {10.1007/978-3-319-13488-8_12},
publisher = {Springer International Publishing},
pages = {121-133},
year = {2014}
}
@inproceedings{eunice_2014_3,
author = {M{\'{a}}rton Zubor and
Attila Kor{\"{o}}si and
Andr{\'{a}}s Guly{\'{a}}s and
G{\'{a}}bor R{\'{e}}tv{\'{a}}ri},
title = {On the Computational Complexity of Policy Routing},
booktitle = {Advances in Communication Networking},
volume = {8846},
series = {Lecture Notes in Computer Science},
editor = {Kermarrec, Yvon},
publisher = {Springer International Publishing},
pages = {202-214},
year = {2014},
doi = {10.1007/978-3-319-13488-8\_19},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/eunice_2014_3.pdf}
}
@article{ton_2014_2,
author = {R\'etv\'ari, G. and Tapolcai, J. and K\H{o}r\"{o}si, A. and Majd\'an, A. and Heszberger, Z.},
journal = {IEEE/ACM Transactions on Networking},
title = {Compressing {IP} Forwarding Tables: Towards Entropy Bounds and Beyond},
year = {2016},
volume = {24},
number = {1},
pages = {149-162},
abstract = {Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information-theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB update. First, we adopt the state of the art in compressed data structures, yielding a static entropy-compressed FIB representation with asymptotically optimal lookup. Then, we redesign the venerable prefix tree, used commonly for IP lookup for at least 20 years in IP routers, to also admit entropy bounds and support lookup in optimal time and update in nearly optimal time. Evaluations on a Linux kernel prototype indicate that our compressors encode an FIB comprising more than 440 K prefixes to just about 100-400 kB of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2014_2.pdf},
doi = {10.1109/TNET.2014.2357051}
}
@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{tel_sys_2015,
author = {Csikor, L. and R\'etv\'ari, G.},
title = {On Providing Fast Protection with Remote Loop-Free Alternates -- Analyzing and Optimizing Unit Cost Networks},
journal = {Telecommunication Systems Journal},
publisher = {Springer US},
doi = {10.1007/s11235-015-0006-9},
issn = {1572-9451},
year = {2015},
month = {March},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/tel_sys_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{gi_2016,
author = {S. Nikolenko and K. Kogan and G. R{\'e}tv{\'a}ri and E. B{\'e}rczi-Kov{\'a}cs and A. Shalimov},
title = {How to Represent {IPv6} Forwarding Tables on {IPv4} or {MPLS} Dataplanes},
booktitle = {Proc. 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS): GI 2016: 19th IEEE Global Internet Symposium},
year = {2016},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/gi_2016.pdf}
}
@article{comnets_2017,
author = {K. N{\'{e}}meth and A. K{\"{o}}r{\"{o}}si and G. R{\'{e}}tv{\'{a}}ri},
title = {Optimal resource pooling over legacy equal-split load balancing schemes},
journal = {Computer Networks},
volume = {127},
number = {},
pages = {243-265},
year = {2017},
doi = {https://doi.org/10.1016/j.comnet.2017.08.017},
abstract = {Abstract Splitting traffic flows to different data paths is crucial in current and future networks. Traffic division serves as the basis for load balancing between application servers, optimal Traffic Engineering, using multiple paths in data centers, and several other places of an end-to-end connection. Unfortunately, by allowing only equal division amongst the parallel resources, existing technologies often cannot realize the optimal traffic splitting, which can have serious negative consequences on the network performance. In this paper we present a flexible and effective traffic splitting method that is incrementally deployable and fully compatible with practically all existing protocols and data planes. Our proposal, called Virtual Resource Allocation (VRA), is based on setting up virtual resources alongside existing ones, thereby tricking the legacy equal traffic splitting technology into realizing the required non-equal traffic division over the physical media. We propose several \{VRA\} schemes, give theoretical bounds on their performance, and also show that the full-fledged \{VRA\} problem is NP-complete in general. Accordingly, we provide solution algorithms, including an optimal, but necessarily slow method and several quick heuristics. Our simulations show that \{VRA\} has huge practical potential as it allows approaching an ideal traffic split using only a very limited set of virtual resources. Based on the results, we also give detailed suggestions on which algorithm to apply in different scenarios.},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/comnets_2017.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{sdata_2018,
title = {A dataset on human navigation strategies in foreign networked systems},
author = {K{\H{o}}r{\"o}si, Attila and Csoma, Attila and R{\'e}tv{\'a}ri, G{\'a}bor and Heszberger, Zal{\'a}n and B{\'\i}r{\'o}, J{\'o}zsef and Tapolcai, J{\'a}nos and Pelle, Istv{\'a}n and Klajb{\'a}r, D{\'a}vid and Nov{\'a}k, M{\'a}rton and Halasi, Valentina and others},
journal = {Scientific data},
volume = {5},
pages = {180037},
year = {2018},
publisher = {Nature Publishing Group},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/sdata_2018.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{networking_2018,
title = {HARMLESS: Cost-effective transitioning to {SDN} for small enterprises},
author = {Csikor, Levente and Toka, L{\'a}szl{\'o} and Szalay, M{\'a}rk and Pongr{\'a}cz, Gergely and Pezaros, Dimitrios P and R{\'e}tv{\'a}ri, G{\'a}bor},
booktitle = {Proc. IFIP Netw.},
pages = {1-9},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/networking_2018.pdf},
year = {2018}
}
@inproceedings{hpsr_2018,
author = {Bifulco, Roberto and R{\'e}tv{\'a}ri, G{\'a}bor},
title = {A survey on the programmable data plane: Abstractions architectures and open problems},
booktitle = {Proc. IEEE HPSR},
year = {2018},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/hpsr_2018.pdf}
}
@inproceedings{secson_2018,
author = {K. Thimmaraju and G. R{\'e}tv{\'a}ri and S. Schmid},
title = {Virtual Network Isolation: Are We There Yet?},
booktitle = {Proc. ACM SIGCOMM 2018 Workshop on Security in Softwarized Networks: Prospects and Challenges (SecSon)},
year = {2018}
}
@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}
}
@article{bolyai_2019_1,
author = {J. B{\'\i}r{\'o} and A. Guly{\'a}s and G. R{\'e}tv{\'a}ri and A. K{\H{o}}r{\"o}si and Z. Heszberger and A. Majd\'{a}n},
title = {Navig\'{a}ci\'{o} h\'{a}l\'{o}zatokban {Bolyai J\'{a}nos} geometri\'{a}ja seg\'{i}ts\'{e}g\'{e}vel},
journal-iso = {ALK MAT LAP},
journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
volume = {36},
num = {1},
year = {2019}
}
@article{bolyai_2019_2,
author = {A. K{\H{o}}r{\"o}si and G. R{\'e}tv{\'a}ri},
title = {A csomagtov\'abb\'{i}t\'{a}s sk\'{a}l\'{a}zhat\'{o}s\'{a}ga: korl\'{a}tok \'{e}s optimumok},
journal-iso = {ALK MAT LAP},
journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
volume = {36},
num = {2},
year = {2019},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/bolyai_2019_2.pdf}
}
@inproceedings{netai_2019,
author = {Zerwas, Johannes and Kalmbach, Patrick and Henkel, Laurenz and R\'{e}tv\'{a}ri, G\'{a}bor and Kellerer, Wolfgang and Blenk, Andreas and Schmid, Stefan},
title = {NetBOA: Self-Driving Network Benchmarking},
year = {2019},
doi = {10.1145/3341216.3342207},
booktitle = {Proceedings of the 2019 Workshop on Network Meets AI \& ML},
pages = {8–14},
numpages = {7}
}
@article{infocom_journal_2019,
author = {M. Nagy and J. Tapolcai and G. R{\'e}tv{\'a}ri},
title = {{R3D3}: A doubly opportunistic data structure for compressing and indexing massive data},
year = {2019},
month = jan,
day = {1},
language = {English},
volume = {11},
pages = {58-66},
journal = {Infocommunications Journal},
issn = {2061-2079},
publisher = {Scientific Association for Infocommunications},
number = {2},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_journal_2019.pdf}
}
@article{ton_2020_1,
author = {A. K{\H{o}}r{\"o}si and A. Guly{\'a}s and Z. Heszberger and J. B{\'\i}r{\'o} and G. R{\'e}tv{\'a}ri},
journal = {IEEE/ACM Transactions on Networking},
title = {On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces},
year = {2020},
volume = {},
number = {},
pages = {1-11},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ton_2020_1.pdf},
doi = {10.1109/TNET.2020.2984761}
}
@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}
}
@inproceedings{europ4_2020,
author = {Vass, Bal\'{a}zs and B\'{e}rczi-Kov\'{a}cs, Erika and Raiciu, Costin and R\'{e}tv\'{a}ri, G\'{a}bor},
title = {Compiling Packet Programs to Reconfigurable Switches: Theory and Algorithms},
year = {2020},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3426744.3431332},
doi = {10.1145/3426744.3431332},
booktitle = {Proceedings of the 3rd P4 Workshop in Europe},
pages = {28-35},
numpages = {8},
location = {Barcelona, Spain},
series = {EuroP4'20},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/europ4_2020.pdf},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/europ4_2020.slides.pdf}
}
@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{ton_2020_2,
title = {Transition to {SDN} is {HARMLESS}: Hybrid Architecture for Migrating Legacy Ethernet Switches to {SDN}},
author = {Csikor, Levente and Szalay, M{\'a}rk and R{\'e}tv{\'a}ri, G{\'a}bor and Pongr{\'a}cz, Gergely and Pezaros, Dimitrios P and Toka, L{\'a}szl{\'o}},
journal = {IEEE/ACM Transactions on Networking},
volume = {28},
number = {1},
pages = {275-288},
year = {2020},
publisher = {IEEE}
}
@misc{servicemeshcon_2020,
author = {G{\'a}bor R{\'e}tv{\'a}ri},
title = {{L7mp}: A Multiprotocol Service Mesh for Legacy Applications},
year = {2020},
howpublished = {ServiceMeshCon NA 2020, colocated with KubeCon + CloudNativeCon North America},
url = {https://sched.co/fJEm},
slides = {http://lendulet.tmit.bme.hu/~retvari/publications/servicemeshcon_2020.slides.pdf},
note = {video available at https://www.youtube.com/watch?v=4oTP91yfF3g}
}
@inproceedings{cloudnet_2020,
author = {Rottenstreich, Ori and Kulik, Ariel and Joshi, Ananya and Rexford, Jennifer and R\'{e}tv\'{a}ri, G\'{a}bor and Menasch\'{e}, Daniel S.},
booktitle = {2020 IEEE 9th International Conference on Cloud Networking (CloudNet)},
title = {Cooperative Rule Caching for {SDN} Switches},
year = {2020},
volume = {},
number = {},
pages = {1-7},
doi = {10.1109/CloudNet51028.2020.9335795},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/cloudnet_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{tnsm_2021,
author = {Rottenstreich, Ori and Kulik, Ariel and Joshi, Ananya and Rexford, Jennifer and R\'{e}tv\'{a}ri, G\'{a}bor and Menasch\'{e}, Daniel},
journal = {IEEE Transactions on Network and Service Management},
title = {Data Plane Cooperative Caching with Dependencies},
year = {2021},
volume = {},
number = {},
pages = {1-1},
doi = {10.1109/TNSM.2021.3132275},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/tnsm_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}
}
@article{infocom_journal_2022,
title = {Batch-scheduling Data Flow Graphs with Service-level Objectives on Multicore Systems},
author = {L{\'e}vai, Tam{\'a}s and R{\'e}tv{\'a}ri, G{\'a}bor},
journal = {Infocommunications Journal},
volume = {14},
number = {1},
pages = {43-50},
year = {2022},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_journal_2022.pdf}
}
@inproceedings{infocom_ws_2022,
title = {Programmable Packet Scheduling With {SP-PIFO}: {Theory}, Algorithms and Evaluation},
author = {Vass, Bal{\'a}zs and Sarkadi, Csaba and R{\'e}tv{\'a}ri, G{\'a}bor},
booktitle = {IEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)},
pages = {1-6},
year = {2022},
organization = {IEEE},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/infocom_ws_2022.pdf}
}
@inproceedings{networking_2022,
title = {Routing on the Shortest Pairs of Disjoint Paths},
author = {Babarczi, P{\'e}ter and R{\'e}tv{\'a}ri, G{\'a}bor and R{\'o}nyai, Lajos and Tapolcai, J{\'a}nos},
booktitle = {IFIP Networking Conference},
pages = {1-9},
year = {2022},
organization = {IFIP},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/networking_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}
}
@inproceedings{ebpf_2023,
author = {L\'{e}vai, Tam\'{a}s and Kreith, Bal\'{a}zs and R\'{e}tv\'{a}ri, G\'{a}bor},
title = {Supercharge {WebRTC:} {Accelerate TURN} Services with {eBPF/XDP}},
year = {2023},
url = {https://doi.org/10.1145/3609021.3609296},
doi = {10.1145/3609021.3609296},
booktitle = {Proceedings of the 1st Workshop on EBPF and Kernel Extensions},
pages = {70-76},
numpages = {7},
series = {eBPF'23},
paper = {http://lendulet.tmit.bme.hu/~retvari/publications/ebpf_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:44 PM CET 2024