Gábor Rétvári

Gábor Rétvári
Office:
I.E. 327/B
+36 (1) 463-1060
E-mail:
retvari_at_tmit_dot_bme_dot_hu
CV:
download pdf
[shorter version]

Current Research

  • Routing and addressing in large-scale hop-by-hop routing
  • Compressed data structures
  • Traffic engineering
  • Resilient routing
  • Unconventional approaches to networking problems

Awards

  • Google Faculty Award 2013
  • Best Paper award at IEEE Design of Reliable Communication Networks 2011
  • János Bolyai Research Scholarship by the Hungarian Academy of Sciences 2007-2010
  • Best Paper award at EUNICE’07 2007

Technical Program Committee Member

  • INFOCOM’16,’15,’14,’13
  • IEEE ICC CQRM symposium ’15, ’14, '13

Scientific Membership

  • ACM Special Interest Group on Data Communication (ACM SIGCOMM) 
  • Hungarian Academy of Sciences, Telecommunications Scientific Committee (MTA TTB) 
  • Institute of Electrical and Electronics Engineers (IEEE) 
  • IEEE Communications Society (ComSoc) 
  • Scientific Association for Infocommunications Hungary (HTE) 

Publications

2020

  • [PDF] [DOI] L. Csikor, M. Szalay, G. Rétvári, G. Pongrácz, D. P. Pezaros, and L. Toka, “Transition to SDN is HARMLESS: Hybrid Architecture for Migrating Legacy Ethernet Switches to SDN,” IEEE/ACM Trans. Netw., vol. 28, iss. 1, p. 275–288, 2020.
    [Bibtex]
    @article{csikor2020ton_harmless,
    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}},
    title = {Transition to SDN is HARMLESS: Hybrid Architecture for Migrating Legacy Ethernet Switches to SDN},
    year = {2020},
    issue_date = {Feb. 2020},
    publisher = {IEEE Press},
    volume = {28},
    number = {1},
    issn = {1063-6692},
    url = {https://doi.org/10.1109/TNET.2019.2958762},
    doi = {10.1109/TNET.2019.2958762},
    journal = {IEEE/ACM Trans. Netw.},
    month = feb,
    pages = {275–288},
    numpages = {14}
    }

2019

  • [PDF] [DOI] L. Csikor, D. M. Divakaran, M. S. Kang, A. Kőrösi, B. Sonkoly, D. Haja, D. P. Pezaros, S. Schmid, and G. Rétvári, “Tuple Space Explosion: A Denial-of-Service Attack against a Software Packet Classifier,” in Proc. International Conference on Emerging Networking Experiments And Technologies, New York, NY, USA, 2019, p. 292–304.
    [Bibtex]
    @inproceedings{csikor2019tse,
    author = {Csikor, Levente and Divakaran, Dinil Mon and Kang, Min Suk and K\H{o}r\"{o}si, Attila and Sonkoly, Bal\'{a}zs and Haja, D\'{a}vid and Pezaros, Dimitrios P. and Schmid, Stefan and R\'{e}tv\'{a}ri, G\'{a}bor},
    title = {Tuple Space Explosion: A Denial-of-Service Attack against a Software Packet Classifier},
    year = {2019},
    isbn = {9781450369985},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    url = {https://doi.org/10.1145/3359989.3365431},
    doi = {10.1145/3359989.3365431},
    abstract = {Efficient and highly available packet classification is fundamental for various security primitives. In this paper, we evaluate whether the de facto Tuple Space Search (TSS) packet classification algorithm used in popular software networking stacks such as the Open vSwitch is robust against low-rate denial-of-service attacks. We present the Tuple Space Explosion (TSE) attack that exploits the fundamental space/time complexity of the TSS algorithm.TSE can degrade the switch performance to 12\% of its full capacity with a very low packet rate (0.7 Mbps) when the target only has simple policies such as, "allow some, but drop others". Worse, an adversary with additional partial knowledge of these policies can virtually bring down the target with the same low attack rate. Interestingly, TSE does not generate any specific traffic patterns but only requires arbitrary headers and payloads which makes it particularly hard to detect.Due to the fundamental complexity characteristics of TSS, unfortunately, there seems to be no complete mitigation to the problem. As a long-term solution, we suggest the use of other algorithms (e.g., HaRP) that are not vulnerable to the TSE attack. As a short-term countermeasure, we propose MFCGuard that carefully manages the tuple space and keeps packet classification fast.},
    booktitle = {Proc. International Conference on Emerging Networking Experiments And Technologies},
    pages = {292–304},
    numpages = {13},
    keywords = {packet classifier, denial-of-service, algorithmic complexity, data plane, tuple space search, security, software-defined networking, open vswitch},
    location = {Orlando, Florida},
    series = {CoNEXT '19}
    }
  • [PDF] Máté. Nagy, J. Tapolcai, and G. Rétvári, “R3D3: A doubly opportunistic data structure for compressing and indexing massive data,” Infocommunications Journal, vol. 11, iss. 2, pp. 58-66, 2019.
    [Bibtex]
    @article{nagy2019r3d3,
    title = "R3D3: A doubly opportunistic data structure for compressing and indexing massive data",
    abstract = "Opportunistic data structures are used extensively in big data practice to break down the massive storage space requirements of processing large volumes of information. A data structure is called (singly) opportunistic if it takes advantage of the redundancy in the input in order to store it in information-theoretically minimum space. Yet, efficient data processing re-quires a separate index alongside the data, whose size often substantially exceeds that of the compressed information. In this paper, we introduce doubly opportunistic data structures to not only attain best possible compression on the input data but also on the index. We present R3D3 that encodes a bitvector of length n and Shannon entropy H0 to nH0 bits and the accompanying index to nH0(1/2 + O(log C/C)) bits, thus attaining provably minimum space (up to small error terms) on both the data and the index, and supports a rich set of queries to arbitrary position in the compressed bitvector in O(C) time when C = o(log n). Our R3D3 prototype attains several times space reduction beyond known compression techniques on a wide range of synthetic and real data sets, while it supports operations on the compressed data at comparable speed.",
    keywords = "IP Fib Compression",
    author = "M{\'a}t{\'e} Nagy and J. Tapolcai and G{\'a}bor R{\'e}tv{\'a}ri",
    year = "2019",
    month = "1",
    day = "1",
    language = "English",
    volume = "11",
    pages = "58--66",
    journal = "Infocommunications Journal",
    issn = "2061-2079",
    publisher = "Scientific Association for Infocommunications",
    number = "2",
    }
  • [PDF] J. Tapolcai, G. Rétvári, P. Babarczi, and E. Bérczi-Kovács, “Scalable and Efficient Multipath Routing via Redundant Trees,” IEEE Journal on Selected Areas in Communications – Special Issue on Network Softwarization & Enablers, 2019. impact factor 7.17
    [Bibtex]
    @ARTICLE{tapolcai2019jsac,
    AUTHOR="J{\'a}nos Tapolcai and G{\'a}bor {R{\'e}tv{\'a}ri} and P{\'e}ter Babarczi
    and Erika {B{\'e}rczi-Kov{\'a}cs}",
    TITLE="Scalable and Efficient Multipath Routing via Redundant Trees",
    JOURNAL="IEEE Journal on Selected Areas in Communications - Special Issue on Network
    Softwarization \& Enablers",
    ADDRESS=", USA",
    DAYS=3,
    MONTH=jan,
    YEAR=2019,
    KEYWORDS="Software Defined Networking and IP Fast ReRoute and Routing and top and Redundant Trees and multipath routing",
    comment = {impact factor 7.17}
    }

2018

  • [PDF] L. Csikor and G. Rétvári, “The Discrepancy of the Megaflow Cache in OVS,” in Open vSwitch Fall Conference, Club Auto Sport, Santa Clara, CA, 2018.
    [Bibtex]
    @INPROCEEDINGS{csikor_ovs,
    AUTHOR={Levente Csikor and G\'abor R\'etv\'ari},
    TITLE={The Discrepancy of the Megaflow Cache in OVS},
    BOOKTITLE={Open vSwitch Fall Conference},
    ADDRESS={Club Auto Sport, Santa Clara, CA},
    YEAR={2018},
    KEYWORDS={ovs and dos and denial of service and attack and cloud and dataplane}
    }
  • [PDF] [DOI] Máté. Nagy, J. Tapolcai, and G. Rétvári, “Node Virtualization for IP Level Resilience,” IEEE/ACM Transactions on Networking, pp. 1-14, 2018. impact factor 2.18
    [Bibtex]
    @ARTICLE{nagy2018ton,
    author={M\'at\'e Nagy and J\'anos Tapolcai and G\'abor Rétvári},
    journal={IEEE/ACM Transactions on Networking},
    title={Node Virtualization for IP Level Resilience},
    year={2018},
    volume={},
    number={},
    pages={1-14},
    keywords={IP Fast ReRoute and top},
    doi={10.1109/TNET.2018.2829399},
    ISSN={1063-6692},
    month={},
    comment = {impact factor 2.18}
    }
  • [PDF] L. Csikor, L. Toka, M. Szalay, G. Pongrácz, D. P. Pezaros, and G. Rétvári, “HARMLESS: Cost-Effective Transitioning to SDN for Small Enterprises,” in Proceedings of IFIP Netwoking, 2018.
    [Bibtex]
    @inproceedings{csikor2018networking,
    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},
    title = {HARMLESS: Cost-Effective Transitioning to SDN for Small Enterprises},
    booktitle = {Proceedings of IFIP Netwoking},
    year = {2018},
    keywords = {Software Defined Networking and Switch design and Migration}
    }
  • [DOI] L. Csikor, C. Rothenberg, D. P. Pezaros, S. Schmid, L. Toka, and G. Rétvári, “Policy Injection: A Cloud Dataplane DoS Attack,” in Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos, New York, NY, USA, 2018, pp. 147-149.
    [Bibtex]
    @inproceedings{csikor2018sigcomm2,
    author = {Csikor, Levente and Rothenberg, Christian and Pezaros, Dimitrios P. and Schmid, Stefan and Toka, L\'{a}szl\'{o} and R{\'e}tv\'{a}ri, G\'{a}bor},
    title = {Policy Injection: A Cloud Dataplane DoS Attack},
    booktitle = {Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos},
    series = {SIGCOMM '18},
    year = {2018},
    isbn = {978-1-4503-5915-3},
    location = {Budapest, Hungary},
    pages = {147--149},
    numpages = {3},
    url = {http://doi.acm.org/10.1145/3234200.3234250},
    doi = {10.1145/3234200.3234250},
    acmid = {3234250},
    publisher = {ACM},
    address = {New York, NY, USA},
    keywords = {Cloud security and DoS and OVS and policy injection},
    }

2017

  • [DOI] M. Szalay, L. Toka, G. Rétvári, G. Pongrácz, L. Csikor, and D. P. Pezaros, “HARMLESS: Cost-Effective Transitioning to SDN,” in Proceedings of the SIGCOMM Posters and Demos, New York, NY, USA, 2017, pp. 91-93.
    [Bibtex]
    @inproceedings{csikor2017sigcomm,
    author = {Szalay, M\'{a}rk and Toka, L\'{a}szl\'{o} and R{\'e}tv\'{a}ri, G\'{a}bor and Pongr\'{a}cz, Gergely and Csikor, Levente and Pezaros, Dimitrios P.},
    title = {HARMLESS: Cost-Effective Transitioning to SDN},
    booktitle = {Proceedings of the SIGCOMM Posters and Demos},
    series = {SIGCOMM Posters and Demos '17},
    year = {2017},
    isbn = {978-1-4503-5057-0},
    location = {Los Angeles, CA, USA},
    pages = {91--93},
    numpages = {3},
    url = {http://doi.acm.org/10.1145/3123878.3131997},
    doi = {10.1145/3123878.3131997},
    acmid = {3131997},
    publisher = {ACM},
    address = {New York, NY, USA},
    keywords = {Migration and Software Defined Networking and Switch design}
    }
  • A. Csoma, A. Kőrösi, G. Rétvári, Z. Heszberger, J. Bíró, M. Slíz, A. Avena-Koenigsberger, A. Griffa, P. Hagmann, and A. Gulyás, “Routes Obey Hierarchy in Complex Networks,” Nature Scientific Reports, vol. 7, 2017. impact factor 4.26
    [Bibtex]
    @article{csoma2017routes,
    title={Routes Obey Hierarchy in Complex Networks},
    author={Csoma, Attila and K{\H{o}}r{\"o}si, Attila and R{\'e}tv{\'a}ri, G{\'a}bor and Heszberger, Zal{\'a}n and B{\'i}r{\'o}, J{\'o}zsef and Sl{\'i}z, Mariann and Avena-Koenigsberger, Andrea and Griffa, Alessandra and Hagmann, Patric and Guly{\'a}s, Andr{\'a}s},
    journal={Nature Scientific Reports},
    volume={7},
    year={2017},
    keywords = {complex networks},
    comment = {impact factor 4.26}
    }

2016

  • M. Chiesa, G. Rétvári, and M. Schapira, “Lying Your Way to Better Traffic Engineering,” in Proc. ACM CoNEXT, Short paper, 2016.
    [Bibtex]
    @INPROCEEDINGS{chiesa2016lying,
    title={Lying Your Way to Better Traffic Engineering},
    author={Chiesa, Marco and R{\'e}tv{\'a}ri, G{\'a}bor and Schapira, Michael},
    BOOKTITLE={Proc. ACM CoNEXT, Short paper},
    url={https://arxiv.org/pdf/1610.02728.pdf},
    year={2016},
    KEYWORDS="traffic engineering and top"
    }
  • L. Molnár, G. Pongrácz, G. Enyedi, Z. Kis, L. Csikor, F. Juhász, A. Kőrösi, and G. Rétvári, “Dataplane Specialization for High-performance OpenFlow Software Switching,” in ACM SIGCOMM, 2016.
    [Bibtex]
    @INPROCEEDINGS{molnar2016sigcomm,
    author = {L\'{a}szl\'{o} Moln\'{a}r and Gergely Pongr\'{a}cz and G\'{a}bor Enyedi and Zolt\'{a}n Kis and Levente Csikor and Ferenc Juh\'{a}sz and Attila K\H{o}r\"osi and G\'{a}bor R\'{e}tv\'{a}ri},
    title = {Dataplane Specialization for High-performance OpenFlow Software Switching},
    booktitle = {ACM SIGCOMM},
    year = {2016},
    keywords = {Software Defined Networking and top}
    }
  • G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, and Z. Heszberger, “Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond,” IEEE/ACM Transactions on Networking, vol. 24, iss. 1, pp. 149-162, 2016. impact factor 2.284
    [Bibtex]
    @ARTICLE{retvari2014sigcomm,
    author = {G. R\'etv\'ari and J. Tapolcai and A. K\H{o}r\"osi and A. Majd\'an and Z. Heszberger},
    title = {Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond},
    journal = {IEEE/ACM Transactions on Networking},
    volume={24},
    number={1},
    pages={149--162},
    year={2016},
    comment = {impact factor 2.284},
    keywords = {IP Fib Compression and top},
    url = {http://arxiv.org/abs/1402.1194}
    }

2015

  • [DOI] G. Németh and G. Rétvári, “Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures,” Wiley Networks, vol. 66, iss. 2, pp. 118-135, 2015. impact factor 0.943
    [Bibtex]
    @article {nemeth_retvari_networks_2015,
    author = {N\'emeth, G\'abor and R\'etv\'ari, G\'abor},
    title = {Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures},
    journal = {Wiley Networks},
    issn = {1097-0037},
    url = {http://dx.doi.org/10.1002/net.21617},
    doi = {10.1002/net.21617},
    volume={66},
    number={2},
    pages={118--135},
    keywords = {rate-adaptive routing and multipath routing and traffic engineering and convex geometry},
    year = {2015},
    comment = {impact factor 0.943}
    }
  • A. Gulyás, J. Bíró, A. Kőrösi, G. Rétvári, and D. Krioukov, “Navigable networks as Nash equilibria of navigation games,” Nature communications, vol. 6, 2015.
    [Bibtex]
    @article{gulyas2015navigable,
    title={Navigable networks as Nash equilibria of navigation games},
    author={Guly{\'a}s, Andr{\'a}s and J. B\'ir\'o and K{\H{o}}r{\"o}si, Attila and R{\'e}tv{\'a}ri, G{\'a}bor and Krioukov, Dmitri},
    journal={Nature communications},
    volume={6},
    year={2015},
    publisher={Nature Publishing Group},
    keywords = {top and complex networks}
    }
  • [PDF] J. Tapolcai, G. Rétvári, P. Babarczi, E. Bérczi-Kovács, P. Kristóf, and G. Enyedi, “Scalable and Efficient Multipath Routing: Complexity and Algorithms,” in 23rd IEEE International Conference on Network Protocols (ICNP), San Francisco, CA, USA, 2015, pp. 1-10.
    [Bibtex]
    @INPROCEEDINGS{tapolcai_2015_icnp_multipath,
    author = {J\'anos Tapolcai and G\'abor R\'etv\'ari and P\'eter Babarczi and Erika B\'erczi-Kov\'acs and Panna Krist\'of and G\'abor Enyedi},
    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},
    keywords = {future internet architectures and top}
    }
  • [DOI] A. Gulyás, G. Rétvári, Z. Heszberger, and R. Agarwal, “On the scalability of routing with policies,” IEEE/ACM Transactions on Networking, vol. 23, iss. 5, pp. 1610-1618, 2015.
    [Bibtex]
    @ARTICLE{gulyas2014scalability,
    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},
    year = {2015},
    volume = {23},
    pages = {1610--1618},
    number = {5},
    doi = {10.1109/TNET.2014.2345839},
    issn = {1063-6692},
    keywords = {compact routing and top},
    publisher = {IEEE}
    }
  • [PDF] [DOI] L. Csikor and G. Rétvári, “On Providing Fast Protection with Remote Loop-Free Alternates,” Telecommunication Systems Journal, vol. 60, iss. 4, pp. 485-502, 2015.
    [Bibtex]
    @ARTICLE{csikor_telsys2014,
    author = {Levente Csikor and G. R\'etv\'ari},
    title = {On Providing Fast Protection with Remote Loop-Free Alternates},
    journal = {Telecommunication Systems Journal},
    volume={60},
    number={4},
    publisher = {Springer US},
    doi = {10.1007/s11235-015-0006-9},
    issn = {1572-9451},
    year = {2015},
    month = {March},
    pages={485-502},
    keywords = {IP Fast ReRoute}
    }

2014

  • [DOI] G. Rétvári, D. Szabó, A. Gulyás, A. Kőrösi, and J. Tapolcai, “An Information-Theoretic Approach to Routing Scalability,” in ACM HotNets, 2014, p. 2:1–2:7.
    [Bibtex]
    @inproceedings{retvari2014information,
    author = {R{\'e}tv\'{a}ri, G\'{a}bor and Szab\'{o}, D\'{a}vid and Guly\'{a}s, Andr\'{a}s and K\H{o}r\"{o}si, Attila and Tapolcai, J\'{a}nos},
    title = {An Information-Theoretic Approach to Routing Scalability},
    booktitle = {ACM HotNets},
    year = {2014},
    location = {Los Angeles, CA, USA},
    pages = {2:1--2:7},
    articleno = {2},
    numpages = {7},
    url = {http://doi.acm.org/10.1145/2670518.2673863},
    doi = {10.1145/2670518.2673863},
    acmid = {2673863},
    keywords = {IP FIB Compression and top and Internet scalability and entropy and forwarding table and hop-by-hop routing}
    }
  • [PDF] A. Kőrösi, J. Tapolcai, B. Mihálka, G. Mészáros, and G. Rétvári, “Compressing IP Forwarding Tables: Realizing Information-theoretical Space Bounds and Fast Lookups Simultaneously,” in Proc. IEEE ICNP, 2014.
    [Bibtex]
    @INPROCEEDINGS{korosi2014icnp,
    author = {A. K\H{o}r\"osi and J. Tapolcai and Bence Mih\'alka and G\'abor 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},
    keywords = {IP Fib Compression and top}
    }
  • A. Majdán, G. Rétvári, J. Tapolcai, and A. Kőrösi, “Development and Performance Evaluation of Fast Combinatorial Unranking Implementations,” in IFIP EUNICE, Rennes, France, 2014.
    [Bibtex]
    @INPROCEEDINGS{majdan2014unice,
    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},
    keywords = {IP Fib Compression}
    }

2013

  • [PDF] L. Csikor, G. Rétvári, and J. Tapolcai, “Optimizing IGP Link Costs for Improving IP-level Resilience with Loop-Free Alternates,” Computer Communications Journal, vol. 36, iss. 6, pp. 645-655, 2013. Special Issue on Reliable Network-based Services
    [Bibtex]
    @ARTICLE{csikor2012cc,
    author = {L. Csikor and G. R\'etv\'ari and J. Tapolcai},
    title = {Optimizing {IGP} Link Costs for Improving {IP}-level Resilience with
    Loop-Free Alternates},
    journal = {Computer Communications Journal},
    year = {2013},
    volume = {36},
    pages = {645--655},
    number = {6},
    comment = {Special Issue on Reliable Network-based Services},
    keywords = {IP Fast ReRoute},
    publisher = {Elsevier}
    }
  • [PDF] L. Csikor, G. Rétvári, and J. Tapolcai, “High Availability in the Future Internet,” in The Future Internet, Springer, 2013, pp. 64-76.
    [Bibtex]
    @INCOLLECTION{csikor2013high,
    author = {L. Csikor and G. R\'etv\'ari and J. Tapolcai},
    title = {High Availability in the Future Internet},
    booktitle = {The Future Internet},
    publisher = {Springer},
    year = {2013},
    pages = {64--76},
    keywords = {IP Fast ReRoute}
    }
  • G. Rétvári, A. Gulyás, Z. Heszberger, M. Csernai, and J. J. Bíró, “Compact policy routing,” Distributed computing, vol. 26, iss. 5-6, pp. 309-320, 2013.
    [Bibtex]
    @ARTICLE{retvari2013compact,
    author = {R\'etv\'ari, G\'abor and Guly\'as, Andr\'as and Heszberger, Zal\'an and Csernai, M\'arton and B{\'i}r\'o, J\'ozsef J},
    title = {Compact policy routing},
    journal = {Distributed computing},
    year = {2013},
    volume = {26},
    pages = {309--320},
    number = {5-6},
    keywords = {compact routing},
    publisher = {Springer Berlin Heidelberg}
    }
  • [PDF] G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, and Z. Heszberger, “Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond,” in ACM SIGCOMM, 2013.
    [Bibtex]
    @INPROCEEDINGS{retvari2013sigcomm,
    author = {G. R\'etv\'ari and J. Tapolcai and A. K\H{o}r\"osi and A. Majd\'an and Z. Heszberger},
    title = {Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond},
    booktitle = {ACM SIGCOMM},
    year = {2013},
    keywords = {IP Fib Compression and top},
    url = {http://arxiv.org/abs/1402.1194}
    }
  • [PDF] J. Tapolcai and G. Rétvári, “Router Virtualization for Improving IP-level Resilience,” in Proc. IEEE INFOCOM, Turin, Italy, 2013.
    [Bibtex]
    @INPROCEEDINGS{tapolcai2013router_virt_lfa,
    author = {J. Tapolcai and G. R\'etv\'ari},
    title = {Router Virtualization for Improving {IP-level} Resilience},
    booktitle = {Proc. IEEE INFOCOM},
    year = {2013},
    address = {Turin, Italy},
    month = apr,
    days = {14},
    demo = {demo/?lfa-vn},
    keywords = {IP Fast ReRoute and top}
    }

2012

  • [PDF] L. Csikor and G. Rétvári, “IP Fast Reroute with Remote Loop-Free Alternates: the Unit Link Cost Case,” in Proc. RNDM, 2012, pp. 16-22.
    [Bibtex]
    @INPROCEEDINGS{csikor_rndm2012,
    author = {L. Csikor and G. R\'etv\'ari},
    title = {{IP} Fast Reroute with Remote Loop-Free Alternates: the Unit Link
    Cost Case},
    booktitle = {Proc. RNDM},
    year = {2012},
    pages = {16-22},
    month = {Oct},
    issn = {2157-0221},
    keywords = {IP Fast ReRoute}
    }
  • A. Gulyás, A. Kőrösi, G. Rétvári, J. Bíró, and D. Szabó, “Brief announcement: network formation games can give rise to realistic networks,” in Proc. ACM symposium on Principles of Distributed Computing (PODC), brief announcement, 2012, pp. 329-330.
    [Bibtex]
    @INPROCEEDINGS{gulyas2012brief,
    author = {Guly\'as, Andr\'as and K{\H{o}}r{\"o}si, Attila and R\'etv\'ari, G\'abor and B\'ir\'o, J\'ozsef and Szab\'o, D\'avid},
    title = {Brief announcement: network formation games can give rise to realistic
    networks},
    booktitle = {Proc. ACM symposium on Principles of Distributed
    Computing (PODC), brief announcement},
    year = {2012},
    pages = {329--330},
    organization = {ACM},
    keywords = {complex networks and top}
    }
  • G. Rétvári, Z. Csernátony, A. Kőrösi, J. Tapolcai, A. Császár, G. Enyedi, and G. Pongrácz, “Compressing IP Forwarding Tables for Fun and Profit,” in ACM HotNets, 2012.
    [Bibtex]
    @INPROCEEDINGS{retvari2012hotnets,
    author = {G. R\'etv\'ari and Z. Csern\'atony and A. K\H{o}r\"osi and J. Tapolcai and A. Cs\'asz\'ar and G. Enyedi and G. Pongr\'acz},
    title = {Compressing {IP} Forwarding Tables for Fun and Profit},
    booktitle = {ACM HotNets},
    year = {2012},
    keywords = {IP Fib Compression and top}
    }

2011

  • [PDF] L. Csikor, M. Nagy, and G. Rétvári, “Network Optimization Techniques for Improving Fast IP-level Resilience with Loop-Free Alternates,” Infocommunications Journal, vol. 3, iss. 4, pp. 2-10, 2011.
    [Bibtex]
    @ARTICLE{csikor_combined_method,
    author = {L. Csikor and M. Nagy and G. R\'etv\'ari},
    title = {Network Optimization Techniques for Improving Fast IP-level Resilience
    with Loop-Free Alternates},
    journal = {Infocommunications Journal},
    year = {2011},
    volume = {3},
    pages = {2--10},
    number = {4},
    address = {Budapest, Kossuth Lajos sqr., Hungary},
    issn = {2061-2079},
    keywords = {IP Fast ReRoute}
    }
  • [PDF] G. Rétvári, L. Csikor, J. Tapolcai, G. Enyedi, and A. Császár, “Optimizing IGP Link Costs for Improving IP-level Resilience,” in Proc. International Workshop on Design Of Reliable Communication Networks (DRCN), Krakow, Poland, 2011, pp. 62-69. winner of Best Paper Award
    [Bibtex]
    @INPROCEEDINGS{retvari2011lfa_drcn,
    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},
    booktitle = {Proc. International Workshop on Design Of Reliable Communication
    Networks (DRCN)},
    year = {2011},
    pages = {62--69},
    address = {Krakow, Poland},
    comment = {winner of Best Paper Award},
    keywords = {IP Fast ReRoute}
    }
  • [PDF] G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár, “IP Fast ReRoute: Loop Free Alternates Revisited,” in Proc. IEEE INFOCOM, Shanghai, P.R. China, 2011.
    [Bibtex]
    @INPROCEEDINGS{retvari2011lfa_infocom,
    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 = {Proc. IEEE INFOCOM},
    year = {2011},
    address = {Shanghai, P.R. China},
    month = {4},
    days = {10},
    keywords = {IP Fast ReRoute and top}
    }

2005

  • G. Rétvári, P. Fodor, J. Tapolcai, and T. Cinkler, “Multi-layer Traffic Engineering Schemes in GMPLS Networks,” in Proc. International Conference on Transparent Optical Networks (ICTON), Barcelona, Spain, 2005.
    [Bibtex]
    @INPROCEEDINGS{retvari05icton,
    author = {G. R\'etv\'ari and P. Fodor and J. Tapolcai and T. Cinkler},
    title = {Multi-layer Traffic Engineering Schemes in GMPLS Networks},
    booktitle = {Proc. International Conference on Transparent Optical Networks (ICTON)},
    year = {2005},
    address = {Barcelona, Spain},
    month = jul,
    keywords = {traffic engineering and wdm, grooming}
    }
  • J. Tapolcai, P. Fodor, G. Rétvári, M. Maliosz, and T. Cinkler, “Class-based minimum interference routing for traffic engineering in optical networks,” in Proc. Next Generation Internet Networks (EURO-NGI), Rome, Italy, 2005, pp. 31-38.
    [Bibtex]
    @INPROCEEDINGS{tapolcai05miro,
    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. Next Generation Internet Networks (EURO-NGI)},
    year = {2005},
    pages = {31--38},
    address = {Rome, Italy},
    month = apr,
    keywords = {traffic engineering}
    }

2004

  • J. Szigeti, J. Tapolcai, G. Rétvári, L. Láposi, and T. Cinkler, Routing and traffic by-pass in multidomain optical switched networks, 2004.
    [Bibtex]
    @MISC{szigeti04hiradastechnika,
    author = {J. Szigeti and J. Tapolcai and G. R\'etv\'ari and L. L\'aposi and T. Cinkler},
    title = { Routing and traffic by-pass in
    multidomain optical switched networks},
    year = {2004},
    comment = {Communications - H\'irad\'astechnika},
    pages = {42--49},
    volume = {2}
    }