@book{MTMT:31897418,
	title = {Technique For Generating Near Real-Time Transport Modality Statistics},
	url = {https://m2.mtmt.hu/api/publication/31897418},
	author = {Kersch, Péter and Kőrösi, Attila and Toka, László},
	unique-id = {31897418},
	year = {2021},
	orcid-numbers = {Toka, László/0000-0003-1045-9205}
}

@article{MTMT:31404676,
	title = {Pricing games of NFV infrastructure providers},
	url = {https://m2.mtmt.hu/api/publication/31404676},
	author = {Toka, László and Zubor, Márton and Kőrösi, Attila and Darzanos, George and Rottenstreich, Ori and Sonkoly, Balázs},
	doi = {10.1007/s11235-020-00706-5},
	journal-iso = {TELECOMMUN SYST},
	journal = {TELECOMMUNICATION SYSTEMS},
	volume = {76},
	unique-id = {31404676},
	issn = {1018-4864},
	year = {2021},
	eissn = {1572-9451},
	pages = {219-232},
	orcid-numbers = {Toka, László/0000-0003-1045-9205; Sonkoly, Balázs/0000-0002-4640-388X}
}

@book{MTMT:31897427,
	title = {Timetables for Public Transport Lines from Mobile Network Handovers},
	url = {https://m2.mtmt.hu/api/publication/31897427},
	author = {Kersch, Péter and Bokányi, Eszter and P, Bognár and Kőrösi, Attila and Toka, László and T, Zambo},
	unique-id = {31897427},
	year = {2020},
	orcid-numbers = {Toka, László/0000-0003-1045-9205}
}

@article{MTMT:31238475,
	title = {On the Memory Requirement of Hop-by-hop Routing: Tight Bounds and Optimal Address Spaces},
	url = {https://m2.mtmt.hu/api/publication/31238475},
	author = {Kőrösi, Attila and Gulyás, András and Heszberger, Zalán and Bíró, József and Rétvári, Gábor},
	doi = {10.1109/TNET.2020.2984761},
	journal-iso = {IEEE ACM T NETWORK},
	journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
	volume = {28},
	unique-id = {31238475},
	issn = {1063-6692},
	abstract = {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.},
	keywords = {compact routing, name independent and name dependent routing, information theory, routing table entropy},
	year = {2020},
	eissn = {1558-2566},
	pages = {1353-1363},
	orcid-numbers = {Bíró, József/0000-0002-9729-2702}
}

@article{MTMT:32838866,
	title = {A csomagtovábbítás skálázhatósága: korlátok és optimumok},
	url = {https://m2.mtmt.hu/api/publication/32838866},
	author = {Kőrösi, Attila and Rétvári, Gábor},
	doi = {10.37070/AML.2019.36.2.12},
	journal-iso = {ALK MAT LAP},
	journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
	volume = {36},
	unique-id = {32838866},
	issn = {0133-3399},
	year = {2019},
	pages = {279-286}
}

@inproceedings{MTMT:31903704,
	title = {Resource provisioning for highly reliable and ultra-responsive edge applications},
	url = {https://m2.mtmt.hu/api/publication/31903704},
	author = {Toka, László and Haja, Dávid and Kőrösi, Attila and Sonkoly, Balázs},
	booktitle = {2019 IEEE 8th International Conference on Cloud Networking (CloudNet)},
	doi = {10.1109/CloudNet47604.2019.9064131},
	unique-id = {31903704},
	abstract = {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.},
	keywords = {Redundancy; Simulation environment; Heuristic algorithms; Virtual functions; Network latencies; Compute resources; Delay constraints; Edge Computing; Fog computing; 5G mobile communication systems; High reliability; Resource utilizations; ultra-low latency; Carrier networks; Fast heuristic algorithms},
	year = {2019},
	orcid-numbers = {Toka, László/0000-0003-1045-9205; Sonkoly, Balázs/0000-0002-4640-388X}
}

@inproceedings{MTMT:31577812,
	title = {Tuple Space Explosion: A Denial-of-Service Attack Against a Software Packet Classifier},
	url = {https://m2.mtmt.hu/api/publication/31577812},
	author = {Csikor, Levente and Divakaran, Dinil Mon and Kang, Min Suk and Kőrösi, Attila and Sonkoly, Balázs and Haja, Dávid and Pezaros, Dimitrios P. and Schmid, Stefan and Rétvári, Gábor},
	booktitle = {CoNEXT '19: Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies},
	doi = {10.1145/3359989.3365431},
	unique-id = {31577812},
	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.},
	keywords = {Algorithmic complexity; Security; Software-defined networking; Data plane; open vswitch; denial-of-service; packet classifier; tuple space search},
	year = {2019},
	pages = {292-304},
	orcid-numbers = {Sonkoly, Balázs/0000-0002-4640-388X}
}

@article{MTMT:3265934,
	title = {Navigáció hálózatokban Bolyai János geometriája segítségével},
	url = {https://m2.mtmt.hu/api/publication/3265934},
	author = {Bíró, József and Gulyás, András and Rétvári, Gábor and Kőrösi, Attila and Heszberger, Zalán and Majdán, András},
	doi = {10.37070/AML.2019.36.2.10},
	journal-iso = {ALK MAT LAP},
	journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
	volume = {36},
	unique-id = {3265934},
	issn = {0133-3399},
	year = {2019},
	pages = {263-269},
	orcid-numbers = {Bíró, József/0000-0002-9729-2702}
}

@article{MTMT:3350776,
	title = {A dataset on human navigation strategies in foreign networked systems},
	url = {https://m2.mtmt.hu/api/publication/3350776},
	author = {Kőrösi, Attila and Csoma, Attila and Rétvári, Gábor and Heszberger, Zalán and Bíró, József and Tapolcai, János and Pelle, István and Dávid, Klajbár and Márton, Novák and Valentina, Halasi and Gulyás, András},
	doi = {10.1038/sdata.2018.37},
	journal-iso = {SCI DATA},
	journal = {SCIENTIFIC DATA},
	volume = {5},
	unique-id = {3350776},
	year = {2018},
	eissn = {2052-4463},
	orcid-numbers = {Bíró, József/0000-0002-9729-2702; Pelle, István/0000-0003-2514-3019}
}

@article{MTMT:3262637,
	title = {Optimal resource pooling over legacy equal-split load balancing schemes},
	url = {https://m2.mtmt.hu/api/publication/3262637},
	author = {Németh, Krisztián and Kőrösi, Attila and Rétvári, Gábor},
	doi = {10.1016/j.comnet.2017.08.017},
	journal-iso = {COMPUT NETW},
	journal = {COMPUTER NETWORKS},
	volume = {127},
	unique-id = {3262637},
	issn = {1389-1286},
	year = {2017},
	eissn = {1872-7069},
	pages = {243-265}
}