|
|
Research Interest
Awards
Research and Educational Grant
|
Publications
2019
-
![[PDF]](http://lendulet.tmit.bme.hu/lendulet_website/wp-content/plugins/papercite/img/pdf.png)
![[DOI]](http://lendulet.tmit.bme.hu/lendulet_website/wp-content/plugins/papercite/img/external.png)
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} }
2017
- 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} } - Máté. Csigi, A. Kőrösi, J. Bíró, Z. Heszberger, Y. Malkov, and A. Gulyás, “Geometric explanation of the rich-club phenomenon in complex networks,” Nature Scientific Reports, vol. 7, 2017. impact factor 4.26
[Bibtex]@article{csigi2017geometric, title={Geometric explanation of the rich-club phenomenon in complex networks}, author={Csigi, M\'at\'e and K{\H{o}}r{\"o}si, Attila and B{\'i}r{\'o}, J{\'o}zsef and Heszberger, Zal{\'a}n and Malkov, Yury and Guly{\'a}s, Andr{\'a}s}, journal={Nature Scientific Reports}, volume={7}, year={2017}, keywords = {complex networks}, comment = {impact factor 4.26} } - J. Yallouz, J. Tapolcai, A. Kőrösi, Kristof Berczi, L. Gyimóthi, and A. Orda, “Packing Strictly-Shortest Paths in a Tree for QoS-Aware Routing,” in IFIP Networking Conference (Networking), Stockholm, Sweden, 2017.
[Bibtex]@INPROCEEDINGS{yallouz2017packing, AUTHOR={Jose Yallouz and J{\'a}nos Tapolcai and Attila {Kőr{\"o}si} and Kristof Berczi and L{\'a}szló {Gyimóthi} and Ariel Orda}, TITLE="Packing {Strictly-Shortest} Paths in a Tree for {QoS-Aware} Routing", BOOKTITLE="IFIP Networking Conference (Networking)", ADDRESS="Stockholm, Sweden", DAYS=11, MONTH=jun, YEAR=2017, keywords = {Routing and top} } - A. Pašić, P. Babarczi, and A. Kőrösi, “Diversity coding-based survivable routing with QoS and differential delay bounds,” Optical Switching and Networking, vol. 23, pp. 118-128, 2017.
[Bibtex]@ARTICLE{pasic2016osn, author = {A. Pa\v{s}i\'c and P. Babarczi and A. K\H{o}r\"{o}si}, title = "Diversity coding-based survivable routing with QoS and differential delay bounds ", journal = "Optical Switching and Networking ", volume={23}, pages={118--128}, year={2017}, issn = "1573-4277", doi = "http://dx.doi.org/10.1016/j.osn.2016.06.005", keywords={network coding}, }
2016
- 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
- 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} }
2014
- 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} } - 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
- M. Csernai, A. Gulyás, A. Kőrösi, B. Sonkoly, and G. Biczók, “Incrementally upgradable data center architecture using hyperbolic tessellations,” Computer Networks, vol. 57, iss. 6, pp. 1373-1393, 2013.
[Bibtex]@ARTICLE{csernai2013incrementally, author = {Csernai, M\'arton and Guly\'as, Andr\'as and K{\H{o}}r{\"o}si, Attila and Sonkoly, Bal\'azs and Bicz\'ok, Gergely}, title = {Incrementally upgradable data center architecture using hyperbolic tessellations}, journal = {Computer Networks}, year = {2013}, volume = {57}, pages = {1373--1393}, number = {6}, keywords = {data center}, publisher = {Elsevier} } - 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} }
2012
- A. Gulyás, A. Kőrösi, B. Sonkoly, G. Biczók, and others, “Poincare: a hyperbolic data center architecture,” in International Conference on Distributed Computing Systems Workshops (ICDCSW), 2012, pp. 8-16.
[Bibtex]@INPROCEEDINGS{guly2012poincare, author = {Andr\'as Guly\'as and Attila K\H{o}r{\"o}si and Bal\'azs Sonkoly and Gergely Bicz\'ok and others}, title = {Poincare: a hyperbolic data center architecture}, booktitle = {International Conference on Distributed Computing Systems Workshops (ICDCSW)}, year = {2012}, pages = {8--16}, organization = {IEEE}, keywords = {data center} } - 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} }
