Pedro Heleno Isolani

Mr. Pedro Heleno Isolani

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 December 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JHJetmir Haxhibeqiri
Jetmir Haxhibeqiri
PIPedro Heleno Isolani
Pedro Heleno Isolani
JMJohann Marquez-Barja
Johann Marquez-Barja
Ingrid MoermanIngrid Moerman
Ingrid Moerman
JHJeroen Hoebeke
Jeroen Hoebeke
Most industrial applications demand determinism in terms of latency, reliability, and throughput. This goes hand in hand with the increased complexity of real-time network programability possibilities. To ensure network performance low-overhead, high-granularity, and timely network verification techniques need to be deployed. The first cornerstone of network verification ability is to enable end-to-end network monitoring, including end devices too. To achieve this, this paper shows a novel and low overhead in-band network telemetry and monitoring technique for wireless networks focusing on IEEE 802.11 networks. A design of in-band network telemetry enabled node architecture is proposed and its proof of concept implementation is realized. The PoC realization is used to monitor a real-life SDN-based wireless network, enabling on-the-fly (re)configuration capabilities based on monitoring data. In addition, the proposed monitoring technique is validated in terms of monitoring accuracy, monitoring overhead, and network (re)configuration accuracy. It is shown that the proposed in-band monitoring technique has 6 times lower overhead than other active monitoring techniques on a single-hop link. Besides this, it is demonstrated that (re)configuration decisions taken based on monitored data fulfill targeted application requirements, validating the suitability of the proposed monitoring technique.

18 October 2018 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
BSBart Spinnewyn
Bart Spinnewyn
PIPedro Heleno Isolani
Pedro Heleno Isolani
CDCarlos Donato
Carlos Donato
JBJuan Felipe Botero
Juan Felipe Botero
SLSteven Latre
Steven Latre
Network Function Virtualization (NFV) is a promising way for service providers to improve configurability of the offered network services. First, Network Functions (NFs) and their corresponding flows can be embedded in the Substrate Network (SN) in an automated way. Second, the modularity offered by the description of a service as a composition of NFs and their interconnecting Virtual Links (VLs), enables tuning of the service’s logical structure. A major challenge w.r.t. the management of these environments is the placement of service requests in the physical infrastructure, comprising NFs that can only be instantiated on particular hosts, due to latency, legislation, or hardware-related constraints. These location constraints are known to complicate the resource allocation. This paper proposes two service placement algorithms with better coordination between the composition and embedding phases. We formulate the combined Service Embedding and Chain Composition (SECC) problem as an Integer Linear Program (ILP) and then, propose a fast heuristic based on Greedy Chain Selection (GCS) that iteratively adds Virtual Network Function (VNF) chains to the composition and embeds them at the same time. Simulation experiments show that the proposed cross-layer optimization can significantly increase the acceptance ratio and reduce the embedding cost.

2 March 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
PIPedro Heleno Isolani
Pedro Heleno Isolani
NCN. Cardona
N. Cardona
CDC. Donato
C. Donato
GPG. A. Perez
G. A. Perez
JMJohann Marquez-Barja
Johann Marquez-Barja
SLS. Latre
S. Latre
In this letter, we propose an airtime-based Resource Allocation (RA) model for network slicing in IEEE 802.11 Radio Access Networks (RANs). We formulate this problem as a Quadratically Constrained Quadratic Program (QCQP), where the overall queueing delay of the system is minimized while strict Ultra-Reliable Low Latency Communication (URLLC) constraints are respected. We evaluated our model using three different solvers where the optimal and feasible sets of airtime configurations were computed. We also validated our model with experimentation in real hardware. Our results show that the solution time for computing optimal and feasible configurations vary according to the slice's demand distribution and the number of slices to be allocated. Our findings support the need for precise RA over IEEE 802.11 RANs and present the limitations of performing such optimizations at runtime.

16 November 2018 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
PIPedro Heleno Isolani
Pedro Heleno Isolani
MCMaxim Claeys
Maxim Claeys
CDCarlos Donato
Carlos Donato
LGLisandro Z. Granville
Lisandro Z. Granville
SLSteven Latré
Steven Latré
Self-organizing networks able to adapt to changes in the environment have already been a longstanding research topic. Given the limited number of license-free Industrial, Scientific, and Medical (ISM) radio bands, wireless technologies end up competing with one another for the wireless spectrum. As such, the proper employment of Medium Access Control (MAC) protocols is essential to guarantee efficient and reliable wireless communication. At the data link level, there has been extensive research towards programmable and more future-proof MAC protocols (e.g., Software-Defined Radios (SDRs), which enable to reconfigure the entire protocol and hence access/control fine-grained radio functionalities). However, actual deployments are so far limited because of performance issues and cost. With the increasing popularity of Software-Defined Networking (SDN), also in the wireless domain, and the increasing performance of SDRs, we are evolving into a fully programmable data link layer. In this survey, we deliver: a landscape of the state-of-the-art on programmable MAC protocols; a coherent terminology that represents scope and level of programmability supported; an in-depth study of their advantages and disadvantages; and a discussion about future research challenges on MAC programmability. Many surveys have investigated the use of specific MAC protocols for a wide range of optimization criteria and application demands. This survey is the first that investigates the scope and the level of programmability that MAC protocols support.

20 January 2021 in Sensors
Verified
Journal Article
Open access
PDF file
PIPedro Heleno Isolani
Pedro Heleno Isolani
DKDaniel Kulenkamp
Daniel Kulenkamp
JMJohann Marquez-Barja
Johann Marquez-Barja
LGLisandro Z. Granville
Lisandro Z. Granville
SLSteven Latré
Steven Latré
VSViolet Syrotiuk
Violet Syrotiuk
With the emergence of 5G networks and the stringent Quality of Service (QoS) requirements of Mission-Critical Applications (MCAs), co-existing networks are expected to deliver higher-speed connections, enhanced reliability, and lower latency. IEEE 802.11 networks, which co-exist with 5G, continue to be the access choice for indoor networks. However, traditional IEEE 802.11 networks lack sufficient reliability and they have non-deterministic latency. To dynamically control resources in IEEE 802.11 networks, in this paper we propose a delay-aware approach for Medium Access Control (MAC) management via airtime-based network slicing and traffic shaping, as well as user association while using Multi-Criteria Decision Analysis (MCDA). To fulfill the QoS requirements, we use Software-Defined Networking (SDN) for airtime-based network slicing and seamless handovers at the Software-Defined Radio Access Network (SD-RAN), while traffic shaping is done at the Stations (STAs). In addition to throughput, channel utilization, and signal strength, our approach monitors the queueing delay at the Access Points (APs) and uses it for centralized network management. We evaluate our approach in a testbed composed of APs controlled by SD-RAN and SDN controllers, with STAs under different workload combinations. Our results show that, in addition to load balancing flows across APs, our approach avoids the ping-pong effect while enhancing the QoS delivery at runtime. Under varying traffic demands, our approach maintains the queueing delay requirements of 5 ms for most of the experiment run, hence drawing closer to MCA requirements.

25 October 2022 in Journal of Network and Systems Management
Verified
Journal Article
Closed access
PDF file
PIPedro Heleno Isolani
Pedro Heleno Isolani
JHJetmir Haxhibeqiri
Jetmir Haxhibeqiri
Ingrid MoermanIngrid Moerman
Ingrid Moerman
JHJeroen Hoebeke
Jeroen Hoebeke
LGLisandro Z. Granville
Lisandro Z. Granville
JMJohann Marquez-Barja
Johann Marquez-Barja