Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, and Gianni Antichi. Morpheus: A run time compiler and optimizer for software data planes. IEEE/ACM Transactions on Networking, (1):1--16, 2023. [ bib | paper [PDF] ]
Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gabor Rétvári, Stefan Schmid, and Juan Vanerio. Self-adjusting partially ordered lists. In IEEE INFOCOM 2023-IEEE Conference on Computer Communications, pages 1--10. IEEE, 2023. [ bib | paper [PDF] ]
Sebastiano Miano, Alireza Sanaee, Fulvio Risso, Gábor Rétvári, and Gianni Antichi. Domain specific run time optimization for software data planes. In Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2022, pages 1148--1164. Association for Computing Machinery, 2022. [ bib | DOI | paper [PDF] ]
Oliver Michel, Roberto Bifulco, Gábor Rétvári, and Stefan Schmid. The programmable data plane: Abstractions, architectures, algorithms, and applications. ACM Comput. Surv., 54(4), May 2021. [ bib | DOI | paper [PDF] ]
Marco Chiesa, Andrzej Kamisiński, Jacek Rak, Gábor Rétvári, and Stefan Schmid. A survey of fast-recovery mechanisms in packet-switched networks. IEEE Communications Surveys Tutorials, 23(2):1253--1301, 2021. [ bib | DOI | paper [PDF] ]
András Gulyás, József Bíró, Gábor Rétvári, Márton Novák, Attila Kőrösi, Mariann Slíz, and Zalán Heszberger. The role of detours in individual human navigation patterns of complex networks. Scientific reports, 10(1):1--10, 2020. [ bib | paper [PDF] ]
G. Antichi and G. Rétvári. Full-stack SDN: The next big challenge? In Proceedings of the Symposium on SDN Research, SOSR ’20, page 48–54, New York, NY, USA, 2020. Association for Computing Machinery. [ bib | DOI | slides [PDF] | paper [PDF] | http ]
T. Lévai, F. Németh, B. Raghavan, and G. Rétvári. Batchy: Batch-scheduling data flow graphs with service-level objectives. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20), pages 633--649, Santa Clara, CA, 2020. USENIX Association. [ bib | paper [PDF] | http ]
Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári, and Stefan Schmid. MTS: Bringing multi-tenancy to virtual networking. In 2019 USENIX Annual Technical Conference (USENIX ATC 19), pages 521--536, Renton, WA, July 2019. USENIX Association. [ bib | slides [PDF] | paper [PDF] ]
J. Tapolcai, G. Rétvári, P. Babarczi, and E. R. Bérczi-Kovács. Scalable and efficient multipath routing via redundant trees. IEEE Journal on Selected Areas in Communications, 37(5):982--996, May 2019. [ bib | DOI | paper [PDF] ]
F. Németh, M. Chiesa, and G. Rétvári. Normal forms for match-action programs. In ACM CoNEXT, pages 44--50, 2019. [ bib | DOI | paper [PDF] ]
L. Csikor, D.M. Divakaran, M.S. Kang, A. Kőrösi, B. Sonkoly, D. Haja, D. Pezaros, S. Schmid, and G. Rétvári. Tuple space explosion: A denial-of-service attack against a software packet classifier. In ACM CoNEXT, pages 292--304, 2019. [ bib | DOI | paper [PDF] ]
L. Linguaglossa, S. Lange, S. Pontarelli, G. Rétvári, D. Rossi, T. Zinner, R. Bifulco, M. Jarschel, and G. Bianchi. Survey of performance acceleration techniques for Network Function Virtualization. Proceedings of the IEEE, 107(4):746--764, 2019. [ bib | DOI | paper [PDF] ]
T. Lévai, G. Pongrácz, P. Megyesi, P. Vörös, S. Laki, F. Németh, and G. Rétvári. The price for programmability in the software data plane: The vendor perspective. IEEE Journal on Selected Areas in Communications, 36(12):2621--2630, December 2018. [ bib | DOI | paper [PDF] ]
Marco Chiesa, Gabor Retvari, and Michael Schapira. Oblivious routing in IP networks. IEEE/ACM Transactions on Networking, 26(3):1292--1305, June 2018. [ bib | DOI | paper [PDF] ]
Máté Nagy, János Tápolcai, and Gábor Rétvári. Node virtualization for IP level resilience. IEEE/ACM Transactions of Networking, 26(3):1250--1263, June 2018. [ bib | DOI | paper [PDF] ]
A. Csoma, A. Kőrösi, G. Rétvári, Z. Heszberger, J. 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, 7, 2017. [ bib | paper [PDF] ]
G. Rétvári, L. Molnár, G. Pongrácz, and G. Enyedi. Dynamic compilation and optimization of packet processing programs. In ACM SIGCOMM 2017 The Third Workshop on Networking and Programming Languages (NetPL), 2017. [ bib | slides [PDF] | paper [PDF] ]
L. Molnár, G. Pongrácz, G. Enyedi, Z. L. 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, pages 539--552, 2016. [ bib | DOI | slides [PDF] | paper [PDF] ]
M. Chiesa, G. Rétvári, and M. Schapira. Lying your way to better traffic engineering. In ACM CoNEXT, pages 391--398, 2016. [ bib | DOI | paper [PDF] ]
András Gulyás, Gábor Rétvári, Zalán Heszberger, and Rachit Agarwal. On the scalability of routing with policies. IEEE/ACM Transactions on Networking, 23(5):1610--1618, October 2015. [ bib | DOI | paper [PDF] ]
A. Gulyás, J. J. Bíró, A. Kőrösi, G. Rétvári, and D. Krioukov. Navigable networks as Nash equilibria of navigation games. Nature Communications, 6(7651), July 2015. [ bib | DOI | paper [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), pages 1--10, San Francisco, CA, USA, 2015. [ bib | paper [PDF] ]
G. Németh and G. Rétvári. Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures. Networks, pages 1--12, 2015. [ bib | DOI | paper [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. [ bib | paper [PDF] ]
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-XIII, pages 1--7, 2014. [ bib | DOI | slides [PDF] | paper [PDF] ]
J. Tapolcai and G. Rétvári. Router virtualization for improving IP-level resilience. In IEEE INFOCOM, pages 935--943, April 2013. [ bib | DOI | slides [PDF] | paper [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, pages 111--122, 2013. [ bib | DOI | slides [PDF] | paper [PDF] ]
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-XI. ACM, October 2012. [ bib | slides [PDF] | paper [PDF] ]
G. Rétvári, A. Gulyás, Z. Heszberger, M. Csernai, and J.J. Bíró. Compact policy routing. In ACM PODC 2011, pages 149--158, New York, NY, USA, 2011. ACM. [ bib | DOI | slides [PDF] | paper [PDF] ]
G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár. IP Fast ReRoute: Loop Free Alternates revisited. In IEEE INFOCOM 2011, pages 2948--2956, 2011. [ bib | DOI | slides [PDF] | paper [PDF] ]
G. Rétvári and G. Németh. Demand-oblivious routing: Distributed vs. centralized approaches. In IEEE INFOCOM 2010, March 2010. [ bib | DOI | slides [PDF] | paper [PDF] ]
G. Enyedi, P. Szilágyi, G. Rétvári, and A Császár. IP fast reroute: Lightweight Not-Via without additional addresses. In IEEE INFOCOM'09 Mini-Conference, pages 2771--2775, Rio de Janeiro, Brasil, 2009. [ bib | DOI | paper [PDF] ]
G. Rétvári, J. J. Bíró, and T. Cinkler. On shortest path representation. IEEE/ACM Transactions on Networking, 15(6):1293--1306, December 2007. [ bib | DOI | paper [PDF] ]
A. Császár, G. Enyedi, M. Hidell, G. Rétvári, and P. Sjödin. Converging the evolution of router architectures and IP networks. IEEE Network Magazine, Special Issue on Advances in Network Systems Architecture, 21(4):8--14, July 2007. [ bib | DOI | paper [PDF] ]
G. Rétvári, J. J. Bíró, and T. Cinkler. Fairness in capacitated networks: a polyhedral approach. In IEEE INFOCOM 2007, Anchorage, Alaska, USA, May 2007. [ bib | DOI | slides [PDF] | paper [PDF] ]
G. Rétvári, J. J. Bíró, T. Cinkler, and T. Henk. A precomputation scheme for minimum interference routing: the Least-Critical-Path-First algorithm. In IEEE INFOCOM 2005, Miami, Florida, USA, March 2005. [ bib | DOI | paper [PDF] ]
G. Rétvári and T. Cinkler. Practical OSPF traffic engineering. IEEE Commununications Letters, 8:689--691, November 2004. [ bib | DOI | paper [PDF] ]
This file was generated by bibtex2html 1.99.
last modified: Tue Jan 2 02:49:45 PM CET 2024