TY - PAT AU - Kersch, Péter AU - Kőrösi, Attila AU - Toka, László TI - Technique For Generating Near Real-Time Transport Modality Statistics CY - Country:10017(13) PY - 2021 UR - https://m2.mtmt.hu/api/publication/31897418 ID - 31897418 LA - English DB - MTMT ER - TY - JOUR AU - Toka, László AU - Zubor, Márton AU - Kőrösi, Attila AU - Darzanos, George AU - Rottenstreich, Ori AU - Sonkoly, Balázs TI - Pricing games of NFV infrastructure providers JF - TELECOMMUNICATION SYSTEMS J2 - TELECOMMUN SYST VL - 76 PY - 2021 IS - 2 SP - 219 EP - 232 PG - 14 SN - 1018-4864 DO - 10.1007/s11235-020-00706-5 UR - https://m2.mtmt.hu/api/publication/31404676 ID - 31404676 LA - English DB - MTMT ER - TY - PAT AU - Kersch, Péter AU - Bokányi, Eszter AU - P, Bognár AU - Kőrösi, Attila AU - Toka, László AU - T, Zambo TI - Timetables for Public Transport Lines from Mobile Network Handovers CY - Country:10017(13) PY - 2020 UR - https://m2.mtmt.hu/api/publication/31897427 ID - 31897427 LA - English DB - MTMT ER - TY - JOUR AU - Kőrösi, Attila AU - Gulyás, András AU - Heszberger, Zalán AU - Bíró, József AU - Rétvári, Gábor TI - On the Memory Requirement of Hop-by-hop Routing: Tight Bounds and Optimal Address Spaces JF - IEEE-ACM TRANSACTIONS ON NETWORKING J2 - IEEE ACM T NETWORK VL - 28 PY - 2020 IS - 3 SP - 1353 EP - 1363 PG - 11 SN - 1063-6692 DO - 10.1109/TNET.2020.2984761 UR - https://m2.mtmt.hu/api/publication/31238475 ID - 31238475 AB - We formulate the optimal address space design problem as the task to set node addresses in order to minimize certain network-wide entropy-related measures. We derive tight space bounds for many well-known graph families and we propose a simple heuristic to find optimal address spaces for general graphs. Our evaluations suggest that in structured graphs, including most practically important network topologies, significant memory savings can be attained by forwarding table compression over our optimized address spaces. According to our knowledge, our work is the first to bridge the gap between computer network scalability and information-theory. LA - English DB - MTMT ER - TY - JOUR AU - Kőrösi, Attila AU - Rétvári, Gábor TI - A csomagtovábbítás skálázhatósága: korlátok és optimumok JF - ALKALMAZOTT MATEMATIKAI LAPOK J2 - ALK MAT LAP VL - 36 PY - 2019 IS - 2 SP - 279 EP - 286 PG - 8 SN - 0133-3399 DO - 10.37070/AML.2019.36.2.12 UR - https://m2.mtmt.hu/api/publication/32838866 ID - 32838866 LA - Hungarian DB - MTMT ER - TY - CHAP AU - Toka, László AU - Haja, Dávid AU - Kőrösi, Attila AU - Sonkoly, Balázs ED - Paulo, Simoes TI - Resource provisioning for highly reliable and ultra-responsive edge applications T2 - 2019 IEEE 8th International Conference on Cloud Networking (CloudNet) PB - IEEE CY - Piscataway (NJ) SN - 9781728148328 PY - 2019 PG - 6 DO - 10.1109/CloudNet47604.2019.9064131 UR - https://m2.mtmt.hu/api/publication/31903704 ID - 31903704 N1 - MTA-BME Information Systems Research Group, Hungary Budapest University of Technology and Economics, Hungary Conference code: 159227 Export Date: 7 March 2021 Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFIH, 2018-2.1.17-TT-KR-2018-00012 Funding details: National Research, Development and Innovation Office Funding text 1: ACKNOWLEDGMENT This work was supported by the National Research, Development and Innovation Office (NKFIH) under the research and development project in Hungarian-Korean cooperation (project identifier: 2018-2.1.17-TT-KR-2018-00012). AB - Edge and fog computing are emerging concepts extending traditional cloud computing by deploying compute resources closer to the users. This approach, closely integrated with carrier-networks, enables several future services, such as tactile internet, 5G and beyond telco services, and extended reality applications. The emphasis is on integration: The rigorous delay constraints, ensuring reliability on the distributed remote nodes, and the sheer scale altogether call for a powerful provisioning platform that offers the applications the best out of the underlying infrastructure. In this paper we investigate the resource provisioning problem in the edge infrastructure with the consideration of probable failures. Our goal is to support high reliability of services with the minimum amount of edge resources reserved to provide the necessary redundancy in the system. We design a resource provisioning algorithm, which takes into account network latency when pinpointing backup placeholders for virtual functions of edge applications. We implement the proposed solution in a simulation environment and show the efficient resource utilization results achieved by our fast heuristic algorithm. © 2019 IEEE. LA - English DB - MTMT ER - TY - CHAP AU - Csikor, Levente AU - Divakaran, Dinil Mon AU - Kang, Min Suk AU - Kőrösi, Attila AU - Sonkoly, Balázs AU - Haja, Dávid AU - Pezaros, Dimitrios P. AU - Schmid, Stefan AU - Rétvári, Gábor ED - ACM, null TI - Tuple Space Explosion: A Denial-of-Service Attack Against a Software Packet Classifier T2 - CoNEXT '19: Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies PB - Association for Computing Machinery (ACM) CY - New York, New York SN - 9781450369985 PY - 2019 SP - 292 EP - 304 PG - 13 DO - 10.1145/3359989.3365431 UR - https://m2.mtmt.hu/api/publication/31577812 ID - 31577812 N1 - ACM SIGCOMM National University of Singapore, Singapore Trustwave Budapest University of Technology and Economics MTA-BME Network Softwarization Research Group University of Glasgow, United Kingdom Faculty of Computer Science, University of Vienna, Austria Conference code: 155734 Cited By :2 Export Date: 5 March 2021 Funding details: FK-17, KH-18 Funding details: CA 15127 Funding details: Engineering and Physical Sciences Research Council, EPSRC, 123957, 124171, 129589, EP/N033957/1, EP/P004024/1 Funding details: National University of Singapore, NUS Funding text 1: This research is supported by the National Research Foundation, Prime Minister's Office, Singapore under its Corporate Laboratory@ University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS - Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Retvari has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes Funding text 2: This research is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Corporate Laboratory@University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS – Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Rétvári has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes. ACM SIGCOMM National University of Singapore, Singapore Trustwave Budapest University of Technology and Economics MTA-BME Network Softwarization Research Group University of Glasgow, United Kingdom Faculty of Computer Science, University of Vienna, Austria Conference code: 155734 Cited By :2 Export Date: 7 March 2021 Funding details: FK-17, KH-18 Funding details: CA 15127 Funding details: Engineering and Physical Sciences Research Council, EPSRC, 123957, 124171, 129589, EP/N033957/1, EP/P004024/1 Funding details: National University of Singapore, NUS Funding text 1: This research is supported by the National Research Foundation, Prime Minister's Office, Singapore under its Corporate Laboratory@ University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS - Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Retvari has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes Funding text 2: This research is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Corporate Laboratory@University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS – Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Rétvári has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes. ACM SIGCOMM National University of Singapore, Singapore Trustwave Budapest University of Technology and Economics MTA-BME Network Softwarization Research Group University of Glasgow, United Kingdom Faculty of Computer Science, University of Vienna, Austria Conference code: 155734 Cited By :2 Export Date: 12 March 2021 Funding details: FK-17, KH-18 Funding details: CA 15127 Funding details: Engineering and Physical Sciences Research Council, EPSRC, 123957, 124171, 129589, EP/N033957/1, EP/P004024/1 Funding details: National University of Singapore, NUS Funding text 1: This research is supported by the National Research Foundation, Prime Minister's Office, Singapore under its Corporate Laboratory@ University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS - Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Retvari has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes Funding text 2: This research is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Corporate Laboratory@University Scheme, National University of Singapore, and Singapore Telecommunications Ltd. This research has also been supported by European Cooperation in Science and Technology (COST) Action CA 15127: RECODIS – Resilient communication and service, the UK Engineering and Physical Sciences Research Council (EPSRC) projects EP/N033957/1, and EP/P004024/1. G. Rétvári has been supported by project no. 123957, 129589 and 124171 with the support provided from the National Research, Development and Innovation Fund of Hungary under the FK-17, KH-18 and K-17 funding schemes. AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Bíró, József AU - Gulyás, András AU - Rétvári, Gábor AU - Kőrösi, Attila AU - Heszberger, Zalán AU - Majdán, András TI - Navigáció hálózatokban Bolyai János geometriája segítségével JF - ALKALMAZOTT MATEMATIKAI LAPOK J2 - ALK MAT LAP VL - 36 PY - 2019 IS - 2 SP - 263 EP - 269 PG - 8 SN - 0133-3399 DO - 10.37070/AML.2019.36.2.10 UR - https://m2.mtmt.hu/api/publication/3265934 ID - 3265934 LA - Hungarian DB - MTMT ER - TY - JOUR AU - Kőrösi, Attila AU - Csoma, Attila AU - Rétvári, Gábor AU - Heszberger, Zalán AU - Bíró, József AU - Tapolcai, János AU - Pelle, István AU - Dávid, Klajbár AU - Márton, Novák AU - Valentina, Halasi AU - Gulyás, András TI - A dataset on human navigation strategies in foreign networked systems JF - SCIENTIFIC DATA J2 - SCI DATA VL - 5 PY - 2018 PG - 6 SN - 2052-4463 DO - 10.1038/sdata.2018.37 UR - https://m2.mtmt.hu/api/publication/3350776 ID - 3350776 N1 - WoS:hiba:000427256400003 2020-08-29 10:16 típus nem egyezik LA - English DB - MTMT ER - TY - JOUR AU - Németh, Krisztián AU - Kőrösi, Attila AU - Rétvári, Gábor TI - Optimal resource pooling over legacy equal-split load balancing schemes JF - COMPUTER NETWORKS J2 - COMPUT NETW VL - 127 PY - 2017 SP - 243 EP - 265 PG - 23 SN - 1389-1286 DO - 10.1016/j.comnet.2017.08.017 UR - https://m2.mtmt.hu/api/publication/3262637 ID - 3262637 N1 - Összes idézések száma a WoS-ban: 0 Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tudósok krt. 2, Budapest, 1117, Hungary MTA-BME Information Systems Research Group, Magyar tudósok krt. 2, Budapest, 1117, Hungary Export Date: 27 February 2020 CODEN: CNETD Correspondence Address: Németh, K.; Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tudósok krt. 2, Hungary; email: krisztian.nemeth@tmit.bme.hu LA - English DB - MTMT ER -