Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dávid Haja

dblp:210/6359 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0003-3880-1420ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 100%
Computer networks
2 papers
Software-defined and programmable networks · 81% Edge and fog computing · 19%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 3 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
network function virtualization
0.412020
5G Applications From Vision to Reality: Multi-Operator Orchestration · IEEE J. Sel. Areas Commun. 2020
Network security › attack strategy
denial-of-service attack
0.412019
Tuple space explosion: a denial-of-service attack against a software packet classifier · CoNEXT 2019
Network security › attack strategy › denial-of-service attack
low-rate dos attack
0.412019
Tuple space explosion: a denial-of-service attack against a software packet classifier · CoNEXT 2019

Methods — techniques the papers use, named apart from their topics

information modeling · 0.9graph-based embedding algorithm · 0.9
YearPublicationVenuePosition
2021 Predicting cloud-native application failures based on monitoring data of cloud infrastructure
László Toka, Gergely Dobreff, Dávid Haja, Mark Szalay
IM3
2020 To boost or not to boost: a stochastic game in wireless access networks
abstract
Resource allocation in wireless access networks has been an intensively researched topic recently: many proposed solutions tackle radio channel access and dynamic spectrum allocation, but traditional issues of queuing, bandwidth sharing and packet processing at wireless access points have been targeted as well. In most of the related work the competition for high quality of service is usually solved by central coordination among users via optimizing a specific target aspect of the overall communication. In this paper we take a turn and provide users with the possibility of resource allocation suggestions. We propose a wireless access sharing framework, in which users have a say in optimizing their quality of service on the long term, and we tackle its analysis with the tool set of stochastic game theory. Our findings show that greedy users become polite against their counterparts when the load is relatively low with the goal of preparing for situations with high load.
László Toka, Mark Szalay, Dávid Haja, Géza Szabó, Sándor Rácz, Miklós Telek
ICC3
2020 Scalable edge cloud platforms for IoT services
abstract
Nowadays, online applications are moving to the cloud, and for delay-sensitive ones, the cloud is being extended with edge/fog domains. Emerging cloud platforms that tightly integrate compute and network resources enable novel services, such as versatile IoT (Internet of Things), augmented reality or Tactile Internet applications. Virtual infrastructure managers (VIMs), network controllers and upper-level orchestrators are in charge of managing these distributed resources. A key and challenging task of these orchestrators is to find the proper placement for software components of the services. As the basic variant of the related theoretical problem (Virtual Network Embedding) is known to be NP-hard, heuristic solutions and approximations can be addressed. In this paper, we propose two architecture options together with proof-of-concept prototypes and corresponding embedding algorithms, which enable the provisioning of delay-sensitive IoT applications. On the one hand, we extend the VIM itself with network-awareness, typically not available in today's VIMs. On the other hand, we propose a multi-layer orchestration system where an orchestrator is added on top of VIMs and network controllers to integrate different resource domains. We argue that the large-scale performance and feasibility of the proposals can only be evaluated with complete prototypes, including all relevant components. Therefore, we implemented fully-fledged solutions and conducted large-scale experiments to reveal the scalability characteristics of both approaches. We found that our VIM extension can be a valid option for single-provider setups encompassing even 100 edge domains (Points of Presence equipped with multiple servers) and serving a few hundreds of customers. Whereas, our multi-layer orchestration system showed better scaling characteristics in a wider range of scenarios at the cost of a more complex control plane including additional entities and novel APIs (Application Programming Interfaces).
Balázs Sonkoly, Dávid Haja, Balázs Németh 0001, Mark Szalay, János Czentye, Róbert Szabó, Rehmat Ullah 0001, Byung-Seo Kim, László Toka
J. Netw. Comput. Appl.2
2020 5G Applications From Vision to Reality: Multi-Operator Orchestration
abstract
Envisioned 5G applications and services, such as Tactile Internet, Industry 4.0 use-cases, remote control of drone swarms, pose serious challenges to the underlying networks and cloud platforms. On the one hand, evolved cloud infrastructures provide the IT basis for future applications. On the other hand, networking is in the middle of a momentous revolution and important changes are mainly driven by Network Function Virtualization (NFV) and Software Defined Networking (SDN). A diverse set of cloud and network resources, controlled by different technologies and owned by cooperating or competing providers, should be coordinated and orchestrated in a novel way in order to enable future applications and fulfill application level requirements. In this paper, we propose a novel cross domain orchestration system which provides wholesale XaaS (Anything as a Service) services over multiple administrative and technology domains. Our goal is threefold. First, we design a novel orchestration system exploiting a powerful information model and propose a versatile embedding algorithm with advanced capabilities as a key enabler. The main features of the architecture include i) efficient and multi-purpose service embedding algorithms which can be implemented based on graph models, ii) inherent multidomain support, iii) programmable aggregation of different resources, iv) information hiding together with flexible delegation of certain requirements enabling multi-operator use-cases, and v) support for legacy technologies. Second, we present our proof-of-concept prototype implementing the proposed system. Third, we establish a dedicated test environment spanning across multiple European sites encompassing sandbox environments from both operators and the academia in order to evaluate the operation of the system. Dedicated experiments confirm the feasibility and good scalability of the whole framework.
Balázs Sonkoly, Róbert Szabó, Balázs Németh 0001, János Czentye, Dávid Haja, Mark Szalay, Janos Doka, Balázs Péter Gero, Dávid Jocha, László Toka
IEEE J. Sel. Areas Commun.5
2019 Improving Big Data Application Performance in Edge-Cloud Systems
abstract
Data analysis is widely used in all domains of the economy. While the amount of data to process grows, the time criteria and the resource consumption constraints get stricter. These phenomena call for advanced resource orchestration for the big data applications. The challenge is actually even greater at the advent of edge computing: orchestration of big data resources in a hybrid edge-cloud infrastructure is challenging. The difficulty stems from the fact that wide-area networking and all its well-known issues come into play and affect the performance of the application. In this paper we present the steps we made towards network-aware big data application design over such distributed systems. We propose a HDFS block placement algorithm for the network reliability problem we identify in geographically distributed topologies. The heuristic algorithm we propose provides better big data application performance compared to the default block placement method. We implement our solution in our simulation environment and show the improved quality of big data applications.
Dávid Haja, Balázs Vass, László Toka
CLOUD1
2019 Tuple space explosion: a denial-of-service attack against a software packet classifier
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.
Levente Csikor, Dinil Mon Divakaran, Min Suk Kang, Attila Korösi, Balázs Sonkoly, Dávid Haja, Dimitrios P. Pezaros, Stefan Schmid 0001, Gábor Rétvári
CoNEXT6
2018 Realizing services and slices across multiple operator domains
abstract
Supporting end-to-end network slices and services across operators has become an important use case of study for 5G networks as can be seen by 5G use cases published in 3GPP, ETSI as well as NGMN. This paper presents the in- depth architecture, implementation and experiment on a multi-domain orchestration framework that is ab le to deploy such multi-operator service as well as monitor the service for SLA compliance. Our implemented architecture allows operators to abstract their sensitive details while exposing the relevant amount of information to support inter-operator slice creation. Our experiment shows that the implemented framework is capable of creating services across operators while fulfilling the respective service requirements.
Ishan Vaishnavi, János Czentye, Molka Gharbaoui, Giovanni Giuliani, Dávid Haja, János Harmatos, Dávid Jocha, Yoonhee Kim, Barbara Martini, Javier Melian, Paolo Monti 0001, Balázs Németh 0001, Wint Yi Poe, Aurora Ramos, Andrea Sgambelluri, Balázs Sonkoly, László Toka, Francesco Tusa, Carlos J. Bernardos, Róbert Szabó
NOMS5