Arthur Selle Jacobs

dblp:144/9529 · DBLP profile ↗
← Back
22ranked-venue papers
7as first author
9since 2021 · last 2025
0000-0003-0624-5001ORCID · verified

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

Computer networks · 11 · 3 first-author · 5 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Establishing Trust for Using Natural Language for Intent-Based Networking
abstract
Todays enterprise networks wrestle with accommodating an ever-growing number of devices of different types, supporting increasingly demanding applications and ever more complex services, and protecting their users from sophisticated and disrupting cyber threats. In response, a proposed architectural approach for improving network management, referred to as Intent-Based Networking (IBN), has attracted significant attention. It is built on the premise that network operators specify network policies in natural language and the network correctly translates these spoken intents (e.g., policies) into proper device-specific configurations that are then deployed across the network to reliably act on the operators expressed intents. Unfortunately, IBN has not yet fully delivered on its promise of automated, fast, and reliable policy deployment, mainly due to the significant challenges that the reliance on methods from Natural Language Processing (NLP) or more recent techniques from Machine Learning (ML) and Artificial Intelligence (AI) poses for unambiguously and accurately translating the myriad of intents that operators can express in natural language into “trustworthy” device configurations. This paper uses LUMI, a recently designed end-to-end prototype of a system that allows operators “to manage their network by talking to the network”, as an illustrative case study. In particular, we use it to elaborate on the different functionalities such systems should have to realize IBNs vision of automating the fast deployment of policies. At the same time, we leverage LUMI to highlight the extra efforts that are required to ensure that the deployed policies can be entrusted to accurately express and execute the operators original intents.
Arthur Selle Jacobs, Ricardo J. Pfitscher, Rafael Hengen Ribeiro, Lisandro Z. Granville, Ronaldo A. Ferreira, Walter Willinger, Sanjay G. Rao
IEEE Trans. Netw. Serv. Manag.1
2023 Examining the Centralization of Email Industry: A Landscape Analysis for IPv4 and IPv6
abstract
Centralization of key Internet services, including email, can result in privacy and security concerns and increase the number of single points of failure. This paper measures and analyzes a large-scale dataset of email providers gathered from MX records of top-level domains. The findings reveal the concentration of email infrastructure providers for each TLD and identify the most significant providers in the market. The paper also demonstrates that the IPv6 adoption increased the centralization of email servers. The research contributes to the state-of-the-art by thoroughly examining email infrastructure centralization and identifying potential areas for future research.
Luciano Zembruzki, Arthur Selle Jacobs, Lisandro Z. Granville, Ricardo J. Pfitscher
ISCC2
2023 Enabling Self-Driving Networks with Machine Learning
abstract
This work aims to enable self-driving networks by tackling the lack of trust that network operators have in Machine Learning (ML) models. We assess and scrutinize the decision-making process of ML-based classifiers used to compose a self-driving network. First, we investigate and evaluate the accuracy and credibility of classifications made by ML models used to process high-level management intents. We propose a novel conversational interface (LUMI) that allows operators to use natural language to describe how the network should behave. Second, we analyze and assess the accuracy and credibility of existing ML models’ for network security and performance. We also uncover the need to reinvent how researchers apply ML to networking problems, so we propose a new ML pipeline that introduces steps to scrutinize models using techniques from the emerging field of eXplainable Artificial Intelligence (XAI). Finally, we investigate whether there is a viable method to improve the trust of operators in the decisions made by ML models that enable self-driving networks. Our investigation led us to propose a new XAI method to extract explanations from any given black-box ML model in the form of decision trees while maintaining a manageable size, which we called TRUSTEE. Our results show that ML models widely applied to solve networking problems have not been put under proper scrutiny and can easily break when put under real-world traffic. Such models, therefore, need to be corrected to fulfill their given tasks properly.
Arthur Selle Jacobs, Ronaldo A. Ferreira, Lisandro Z. Granville
NOMS1
2022 AI/ML for Network Security: The Emperor has no Clothes
abstract
Several recent research efforts have proposed Machine Learning (ML)-based solutions that can detect complex patterns in network traffic for a wide range of network security problems. However, without understanding how these black-box models are making their decisions, network operators are reluctant to trust and deploy them in their production settings. One key reason for this reluctance is that these models are prone to the problem of underspecification, defined here as the failure to specify a model in adequate detail. Not unique to the network security domain, this problem manifests itself in ML models that exhibit unexpectedly poor behavior when deployed in real-world settings and has prompted growing interest in developing interpretable ML solutions (e.g., decision trees) for "explaining'' to humans how a given black-box model makes its decisions. However, synthesizing such explainable models that capture a given black-box model's decisions with high fidelity while also being practical (i.e., small enough in size for humans to comprehend) is challenging.
Arthur Selle Jacobs, Roman Beltiukov, Walter Willinger, Ronaldo A. Ferreira, Arpit Gupta, Lisandro Z. Granville
CCS1
2022 DWT in P4: Periodicity Detection in the Data Plane
abstract
This paper presents a P4 implementation of the (1-D) Discrete Wavelet Transform (DWT) method. As a mathe-matical tool for analyzing signals such as packet-level traces, the DWT divides a given signal into different frequency components and analyzes each component with a resolution matched to its scale. We develop an efficient online algorithm that circumvents various limitations of existing P4-programmable data plane devices and performs the DWT decomposition entirely in the data plane. Our evaluation of a hardware implementation (i.e., Netronome NFP-4000 SmartNIC) of the algorithm shows that it results in only minimal throughput overhead (less than 1% for average-sized packets) and operates within constraints imposed by the limited available data plane resources. As an application, we use our lightweight P4 implementation of the DWT and describe a novel threshold-based approach for detecting periodic behavior in a signal in real-time, at line rate in the data plane (40 Gbps). We illustrate our approach with different examples of synthetic and real-world packet-level traffic traces that exhibit periodic patterns of either benign or malicious origins.
Briggette Olenka Roman Huaytalla, Arthur Selle Jacobs, Marcus V. B. Silva, Fabrício B. Carvalho, Ronaldo A. Ferreira, Walter Willinger, Lisandro Z. Granville
GLOBECOM2
2022 On the Consolidation of the Internet Domain Name System
abstract
Several parts of society have expressed rising alarm about the Internet's consolidation in recent years. One of the critical concerns raised by this trend toward consolidation of infrastructure, traffic, users, and services is the concentration of many essential Internet resources among a small number of providers. Some consequences of such consolidation (single points of failure) were exposed in 2016 and 2019 in large-scale Distributed Denial of Service (DDoS) attacks on two DNS providers. In this paper, we study the Domain Name System (DNS) industry's consolidation in light of multiple country-code Top-Level Domains (ccTLDs) and generic top-level domains (gTLDs) by resolving and evaluating the authoritative name-servers (NS) for all domains in each TLD during five years. We show that, the Top 5 DNS providers account for more than 20% of all domains and, more shockingly, the Top 100 providers account for about 80% of the entire examined IPv4 domain namespace. We also reveal that domains in certain TLDs are highly concentrated in the hands of a few providers. For example, Estonia's (.ee) Top 5 providers will hold around 78% of the total TLD namespace in 2021. Additionally, we examine the domain concentration per TLD in terms of provider location origin. We notice a strong presence of local companies in Europe's top-level domains, emphasizing the Russian Federation.
Luciano Zembruzki, Arthur Selle Jacobs, Lisandro Z. Granville
GLOBECOM2
2022 Hosting Industry Centralization and Consolidation
abstract
There have been growing concerns about the concentration and centralization of Internet infrastructure. In this work, we scrutinize the hosting industry on the Internet by using active measurements, covering 19 Top-Level Domains (TLDs). We show how the market is heavily concentrated: 1/3 of the domains are hosted by only 5 hosting providers, all US-based companies. For the country-code TLDs (ccTLDs), however, hosting is primarily done by local, national hosting providers and not by the large American cloud and content providers. We show how shared languages (and borders) shape the hosting market — German hosting companies have a notable presence in Austrian and Swiss markets, given they all share German as official language. While hosting concentration has been relatively high and stable over the past four years, we see that American hosting companies have been continuously increasing their presence in the market related to high traffic, popular domains within ccTLDs — except for Russia, notably.
Luciano Zembruzki, Raffaele Sommese, Lisandro Z. Granville, Arthur Selle Jacobs, Mattijs Jonker, Giovane Cesar Moreira Moura
NOMS4
2022 A deterministic approach for extracting network security intents
abstract
Intents brought significant improvements in network management by the use of intent-level languages. Despite these improvements, intents are not yet fully integrated and deployed in most large-scale networks. As a result, network operators may still experience problems when deploying new intents, for instance, learning a vendor-specific language to understand previously deployed configurations of a network device. Additionally, traditional configurations are distributed across multiple devices, each configured using low-level, vendor-specific languages. As a result, inferring intents from these low-level configurations is a time-consuming process. Furthermore, current solutions for deriving high-level representations from bottom-up configuration analysis do not provide results as intents or have a very limited scope, missing essential details that enhance the representation. In the solution to these shortcomings, a deterministic bottom-up approach was developed to extract intents from network configuration files, which translates them into a high-level intent-defined language. By parsing security configurations from various network devices and translating them into an extended version of the Nile (Jacobs et al. 2018) language, an intent-defined language, the prototype demonstrates the concept of this approach. While three case studies illustrate the effectiveness of the approach proposed in real-world scenarios, additional evaluations exploit dumps of real-world firewall and Network Address Translator (NAT) configurations consisting of rules from different servers and institutions. These evaluations demonstrate that the proposed solution can represent configurations at an intent-level language, maintaining high accuracy while representing key details of low-level configurations.
Rafael Hengen Ribeiro, Arthur Selle Jacobs, Luciano Zembruzki, Ricardo Parizotto, Eder J. Scheid, Alberto E. Schaeffer Filho, Lisandro Z. Granville, Burkhard Stiller
Comput. Networks2
2021 Hey, Lumi! Using Natural Language for Intent-Based Network Management
Arthur Selle Jacobs, Ricardo J. Pfitscher, Rafael Hengen Ribeiro, Ronaldo A. Ferreira, Lisandro Z. Granville, Walter Willinger, Sanjay G. Rao
USENIX ATC1
2020 A Bottom-Up Approach for Extracting Network Intents
Rafael Hengen Ribeiro, Arthur Selle Jacobs, Ricardo Parizotto, Luciano Zembruzki, Alberto E. Schaeffer Filho, Lisandro Z. Granville
AINA2
2020 Sample Selection Search to Predict Elephant Flows in IXP Programmable Networks
Marcus Vinicius Brito da Silva, André Augusto Pacheco de Carvalho, Arthur Selle Jacobs, Ricardo J. Pfitscher, Lisandro Z. Granville
AINA3
2020 dnstracker: Measuring Centralization of DNS Infrastructure in the Wild
Luciano Zembruzki, Arthur Selle Jacobs, Gustavo Spier Landtreter, Lisandro Z. Granville, Giovane Cesar Moreira Moura
AINA2
2020 SecBot: a Business-Driven Conversational Agent for Cybersecurity Planning and Management
abstract
Businesses were moving during the past decades to-ward full digital models, which made companies face new threats and cyberattacks affecting their services and, consequently, their profits. To avoid negative impacts, companies' investments in cybersecurity are increasing considerably. However, Small and Medium-sized Enterprises (SMEs) operate on small budgets, minimal technical expertise, and few personnel to address cybersecurity threats. In order to address such challenges, it is essential to promote novel approaches that can intuitively present cybersecurity-related technical information.This paper introduces SecBot, a cybersecurity-driven conversational agent (i.e., chatbot) for the support of cybersecurity planning and management. SecBot applies concepts of neural networks and Natural Language Processing (NLP), to interact and extract information from a conversation. SecBot can (a) identify cyberattacks based on related symptoms, (b) indicate solutions and configurations according to business demands, and (c) provide insightful information for the decision on cybersecurity investments and risks. A formal description had been developed to describe states, transitions, a language, and a Proof-of-Concept (PoC) implementation. A case study and a performance evaluation were conducted to provide evidence of the proposed solution's feasibility and accuracy.
Muriel Figueredo Franco, Bruno Rodrigues 0001, Eder J. Scheid, Arthur Selle Jacobs, Christian Killer, Lisandro Z. Granville, Burkhard Stiller
CNSM4
2020 ShadowFS: Speeding-up Data Plane Monitoring and Telemetry using P4
abstract
Programmable Data Planes (PDPs) provide software abstractions for network operators to dynamically modify the data plane behavior. This behavior can be described in specification languages, such as P4, and deployed into programmable switches our routers. The degree of innovation enabled by PDPs allowed network operators to create new protocols and applications. Despite the high degree of innovation brought to data plane packet processing, this programmability may have a negative effect on the forwarding delay and update times of flow tables. Previous works have attempted to overcome these limitations, e.g., through caching mechanisms, however they do not provide efficient replacement primitives and incur large overhead for monitored traffic. In this paper we present the design and evaluation of ShadowFS, a system to speed-up monitoring and telemetry on the data plane. ShadowFS manages the replacement of table entries using smaller caches without requiring the programmer to specify the behavior of these tables or how to steer traffic through them. Different from previous work, ShadowFS builds a new data plane program that monitors flows and replaces rules between tables automatically. Evaluation results demonstrate that ShadowFS can increase the throughput of frequently monitored flows.
Ricardo Parizotto, Lucas Castanheira, Rafael Hengen Ribeiro, Luciano Zembruzki, Arthur Selle Jacobs, Lisandro Z. Granville, Alberto E. Schaeffer Filho
ICC5
2019 Predicting Elephant Flows in Internet Exchange Point Programmable Networks
Marcus Vinicius Brito da Silva, Arthur Selle Jacobs, Ricardo J. Pfitscher, Lisandro Z. Granville
AINA2
2019 Guiltiness: A practical approach for quantifying virtual network functions performance
Ricardo J. Pfitscher, Arthur Selle Jacobs, Luciano Zembruzki, Ricardo Luis dos Santos, Eder J. Scheid, Muriel Figueredo Franco, Alberto E. Schaeffer Filho, Lisandro Z. Granville
Comput. Networks2
2018 IDEAFIX: Identifying Elephant Flows in P4-Based IXP Networks
abstract
Internet Exchange Points (IXPs) are high-performance networks that allow multiple autonomous systems to exchange traffic, with benefits ranging from cost reductions to performance improvements. In addition, performance requirements and a number of players involved in such networks bring out several issues to management tasks, such as elephant flows identification. This kind of flows, with high size and substantial duration, can severely impact the performance of smaller flows. In this paper, we present IDEAFIX, a mechanism to identify elephant flows in P4-based IXP networks. Our approach consists in analyzing flows features for each ingress packet immediately in the edge switch. These features are then stored in P4 registers, indexed by hash keys, and compared to predefined thresholds for flow classification. Experimental evaluations show that IDEAFIX is significantly more efficient than the state-of-the-art approaches implemented with sFlow and traditional Software-Defined Networking (SDN) tools (e.g., OpenFlow). While state-of-the-art mechanisms add up to 17MB of monitoring data, our solution causes an overhead of only 25KB. Also, the implemented prototype takes less than 0.40ms to identify elephant flows with a 95% accuracy in scenarios with scarce memory resources.
Marcus Vinicius Brito da Silva, Arthur Selle Jacobs, Ricardo J. Pfitscher, Lisandro Z. Granville
GLOBECOM2
2018 Artificial neural network model to predict affinity for virtual network functions
abstract
Network Functions Virtualization (NFV) was proposed to migrate middleboxes that compose network services, such as firewalls and Network Address Translation (NAT) servers, from hardware to software running on Virtual Machines (VMs), commonly known as Virtualized Network Functions (VNFs). In NFV-enabled networks, VNFs can be chained in Forwarding Graphs (FGs) to provide services. These FGs establish the logical order in which network packets must traverse until reaching the end-service. In this scenario, network operators establish affinity and anti-affinity rules, which determine restrictions on the placement and chaining of VNFs according to how well or poorly VNFs operate together. To address the subject of identifying affinity relations in NFV-enabled networks, we previously proposed a mathematical model to measure the affinity between pairs of VNFs. However, that affinity model falls short for identifying affinity of VNFs not yet deployed, as they have no resource usage data to take into account. In this paper, we use artificial neural networks to predict affinity estimation for newly introduced VNFs, which still do not have usage data to be analyzed. This affinity neural network is trained using past affinity measurements, containing the data from VNFs, Physical Machines (PMs), and FGs of each measurement as features. We evaluate our solution by analyzing it over real usage data from a Cloud dataset, and conclude that neural networks can be used to provide affinity values for network operators, or NFV orchestrators, to plan the deployment of new VNFs.
Arthur Selle Jacobs, Ricardo J. Pfitscher, Ricardo Luis dos Santos, Muriel Figueredo Franco, Eder J. Scheid, Lisandro Z. Granville
NOMS1
2018 A model for quantifying performance degradation in virtual network function service chains
abstract
Virtual Network Functions (VNFs) can be chained and provisioned on demand, providing elasticity and dynamicity to the network. Due to the interdependencies between VNFs, resulting service chains may not work as expected, and because of that, it is crucial to determine which VNFs are having a negative impact on the service quality. In this paper, we introduce a model to quantify the guiltiness of a VNF on being a bottleneck in a service chain, which provides a metric that estimates the impact on processing delay. In addition, we propose an adaptive algorithm, based on linear regression and neural networks, to adjust the model parameters according to the environment particularities, such as the type and number of VNFs. We show through an experimental evaluation that the guiltiness metric faithfully characterizes end-service performance, by identifying up to 94% of the bottleneck VNFs in the analyzed scenarios. Also, we provide artifacts for researchers to reproduce our results in other scenarios.
Ricardo J. Pfitscher, Arthur Selle Jacobs, Eder J. Scheid, Muriel Figueredo Franco, Ricardo Luis dos Santos, Alberto E. Schaeffer Filho, Lisandro Z. Granville
NOMS2
2017 Affinity measurement for NFV-enabled networks: A criteria-based approach
abstract
Network Functions Virtualization (NFV) offers several benefits for Service Providers (SPs), such as mitigating equipment cost and increasing business agility. In NFV-enabled networks, inadequate placement of Virtualized Network Functions (VNFs) creates bottlenecks, impacting negatively on performance. Therefore, network operators must establish affinity and anti-affinity rules to avoid network and processing bottlenecks, and thus comply with Service Level Agreement (SLA) requirements of tenants. Affinity and anti-affinity rules in NFV must be broad and carefully elaborated to maintain service performance. Network operators must consider further than simply resource allocation when identifying affinity among VNFs. The criteria for VNFs affinity varies for different forwarding graphs. Geolocation, latency, packet loss, and bandwidth usage are some examples of criteria that can be considered as indicators of bottlenecks in high traffic networks. In this paper, we propose a solution to measure affinity between pairs of VNFs, based on a weighted set of affinity criteria considered relevant by a network operator. To evaluate the feasibility of our affinity model, we analyze three case studies over an experimental NFV scenario. We conclude that our affinity model can help network operators identify the cause of issues in NFV-enabled networks, as well as it may be used by NFV orchestrators to aid on VNFs migration and embedding.
Arthur Selle Jacobs, Ricardo Luis dos Santos, Muriel Figueredo Franco, Eder J. Scheid, Ricardo J. Pfitscher, Lisandro Z. Granville
IM1
2017 AMNESiA: Affinity measurement platform for NFV-enabled networks
abstract
AMNESiA is an affinity measurement platform for NFV-enabled networks, designed to consolidate and interpret existing monitoring data into an affinity metric, aiding operators to identify affinity and anti-affinity relations in the network. AMNESiA uses the latest snapshot of usage data, collected through a generic monitoring solution, from the database to measure affinity between VNFs.
Arthur Selle Jacobs, Ricardo Luis dos Santos, Muriel Figueredo Franco, Eder J. Scheid, Ricardo J. Pfitscher, Lisandro Z. Granville
IM1
2014 Monitoring Virtual Nodes using mashups
Oscar M. Caicedo, Carlos Raniery Paula dos Santos, Arthur Selle Jacobs, Lisandro Z. Granville
Comput. Networks3