Rui Valadas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Rui Valadas has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Paulo Salvador
University of Aveiro
32 shared publications - António Nogueira
University of Aveiro
26 shared publications - António Pacheco
Universidade de Lisboa
19 shared publications - Maria Do Rosário Oliveira
CEMAT and Department of Mathematics, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
14 shared publications - A. Manuel de Oliveira Duarte
University of Aveiro
12 shared publications - Adriano Moreira
Universidade do Minho
6 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (12) , 692
Closed-loop and distributed load testing of web applications using Kubernetes
- 25 August 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (12) , 692
Closed-loop and distributed load testing of web applications using Kubernetes
- Open Access
- 12 January 2026
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 15 (1) , 9
Kubernetes-aware load balancing for leaf-spine EVPN data centers
- 12 January 2026
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 15 (1) , 9
Open AccessKubernetes-aware load balancing for leaf-spine EVPN data centers
- Open Access
- 15 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Decentralized and Dynamic Zero-Touch Provisioning of Leaf-Spine EVPN Data Centers
Data centers are becoming increasingly large and complex due to the exponential growth of data and the rising demand for cloud services. To manage this complexity, modern data center networks employ leaf-spine topologies and EVPN overlays, enabling efficient scaling and supporting multi-tenancy. These networks often include thousands of servers and network devices, making configuration and management highly challenging. This paper proposes a decentralized and dynamic Zero-Touch Provisioning (ZTP) solution for leaf-spine EVPN data centers. Our approach employs autonomous agents on each data center router to provision both the underlay and the overlay infrastructure without manual intervention, handling both initial deployments and disruptive events (e.g., router or link failures). The underlay is assumed to use a link-state routing protocol, and we introduce a novel algorithm that infers the role of each router (e.g., leaf or spine) from the network topology provided by the protocol, a feature central to our approach. We experimentally validated our solution using SR Linux, a network operating system for data centers that supports non-native agent integration. Our results demonstrate that the proposed ZTP solution can fully provision leaf-spine data center networks automatically while achieving very fast convergence times.
- 15 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessDecentralized and Dynamic Zero-Touch Provisioning of Leaf-Spine EVPN Data Centers
Data centers are becoming increasingly large and complex due to the exponential growth of data and the rising demand for cloud services. To manage this complexity, modern data center networks employ leaf-spine topologies and EVPN overlays, enabling efficient scaling and supporting multi-tenancy. These networks often include thousands of servers and network devices, making configuration and management highly challenging. This paper proposes a decentralized and dynamic Zero-Touch Provisioning (ZTP) solution for leaf-spine EVPN data centers. Our approach employs autonomous agents on each data center router to provision both the underlay and the overlay infrastructure without manual intervention, handling both initial deployments and disruptive events (e.g., router or link failures). The underlay is assumed to use a link-state routing protocol, and we introduce a novel algorithm that infers the role of each router (e.g., leaf or spine) from the network topology provided by the protocol, a feature central to our approach. We experimentally validated our solution using SR Linux, a network operating system for data centers that supports non-native agent integration. Our results demonstrate that the proposed ZTP solution can fully provision leaf-spine data center networks automatically while achieving very fast convergence times.
- Open Access
- 1 September 2024
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 13 (5-6) , 486-512
Hard‐state Protocol Independent Multicast—Source‐Specific Multicast (HPIM‐SSM)
Source‐specific multicast is a key technology for multicast services such as IPTV broadcasting, which relies on IGMPv3/MLDv2 for source‐group membership signalling and multicast routing protocols such as PIM‐SSM for building and maintaining receiver‐initiated source‐based distribution trees across the network. The authors propose the Hard‐state Protocol Independent Multicast—Source‐Specific Multicast (HPIM‐SSM), a novel multicast routing protocol that keeps the design principles of PIM‐SSM but overcomes its limitations, such as slow convergence and the possibility of creating suboptimal trees. The state machines of HPIM‐SSM were designed to react promptly to all network events susceptible to reconfiguring the multicast trees, avoiding the need for soft‐state maintenance through the periodic transmission of control messages. Moreover, the authors eliminated the need for designated routers, which led to suboptimal trees, and introduced a control‐driven assert protocol that operates per source, allowing for considerable memory savings. Finally, the protocol enables the coexistence of multiple unicast routing protocols. HPIM‐SSM was implemented in Python, and its correctness was extensively validated through model‐checking techniques. Furthermore, a comparison between HPIM‐SSM and PIM‐SSM was conducted, encompassing both theoretical analysis and experimental evaluation of convergence times. The results demonstrate clearly that HPIM‐SSM outperforms PIM‐SSM, exhibiting significantly faster convergence times and completely avoiding suboptimal trees.
- 1 September 2024
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 13 (5-6) , 486-512
Open AccessHard‐state Protocol Independent Multicast—Source‐Specific Multicast (HPIM‐SSM)
Source‐specific multicast is a key technology for multicast services such as IPTV broadcasting, which relies on IGMPv3/MLDv2 for source‐group membership signalling and multicast routing protocols such as PIM‐SSM for building and maintaining receiver‐initiated source‐based distribution trees across the network. The authors propose the Hard‐state Protocol Independent Multicast—Source‐Specific Multicast (HPIM‐SSM), a novel multicast routing protocol that keeps the design principles of PIM‐SSM but overcomes its limitations, such as slow convergence and the possibility of creating suboptimal trees. The state machines of HPIM‐SSM were designed to react promptly to all network events susceptible to reconfiguring the multicast trees, avoiding the need for soft‐state maintenance through the periodic transmission of control messages. Moreover, the authors eliminated the need for designated routers, which led to suboptimal trees, and introduced a control‐driven assert protocol that operates per source, allowing for considerable memory savings. Finally, the protocol enables the coexistence of multiple unicast routing protocols. HPIM‐SSM was implemented in Python, and its correctness was extensively validated through model‐checking techniques. Furthermore, a comparison between HPIM‐SSM and PIM‐SSM was conducted, encompassing both theoretical analysis and experimental evaluation of convergence times. The results demonstrate clearly that HPIM‐SSM outperforms PIM‐SSM, exhibiting significantly faster convergence times and completely avoiding suboptimal trees.
- Open Access
- 23 January 2024
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 13 (3) , 241-248
Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies
Open Shortest Path First (OSPF) currently supports multiarea networking with two severe limitations: the multiarea topology is restricted to a two‐level hierarchy, and globally optimal routing may not be achieved. An OSPF extension that overcomes these limitations is proposed by introducing a routing overlay for the dissemination of multiarea routing information. It applies to both OSPFv2 (IPv4) and OSPFv3 (IPv6) and is transparent to area‐internal routers. The extension was fully implemented and tested, and the results show that the added functionality is completely achieved, at the cost of a small penalty in terms of convergence times for small networks.
- 23 January 2024
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 13 (3) , 241-248
Open AccessOpen Shortest Path First extension for the support of multiarea networks with arbitrary topologies
Open Shortest Path First (OSPF) currently supports multiarea networking with two severe limitations: the multiarea topology is restricted to a two‐level hierarchy, and globally optimal routing may not be achieved. An OSPF extension that overcomes these limitations is proposed by introducing a routing overlay for the dissemination of multiarea routing information. It applies to both OSPFv2 (IPv4) and OSPFv3 (IPv6) and is transparent to area‐internal routers. The extension was fully implemented and tested, and the results show that the added functionality is completely achieved, at the cost of a small penalty in terms of convergence times for small networks.
- Open Access
- 27 May 2023
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 12 (4) , 179-195
Detection of Internet‐wide traffic redirection attacks using machine learning techniques
Internet‐wide traffic redirection attacks have been reported for long, and are mainly caused by Border Gateway Protocol route hijacking. Such attacks can be quite harmful, impairing access to popular Internet sites for long periods. This work addresses the use of machine learning techniques (both unsupervised and supervised) leveraging from a distributed monitoring infrastructure of probes that measure the round trip time to Internet sites under surveillance. The detection process is separated into two stages: per‐probe classification and a combination of individual probe decisions. Our results show that the best strategy is to classify using an unsupervised technique based on Tukey's method and to combine using Hidden Markov Models, due to its performance and adaptability to different attack types.
- 27 May 2023
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 12 (4) , 179-195
Open AccessDetection of Internet‐wide traffic redirection attacks using machine learning techniques
Internet‐wide traffic redirection attacks have been reported for long, and are mainly caused by Border Gateway Protocol route hijacking. Such attacks can be quite harmful, impairing access to popular Internet sites for long periods. This work addresses the use of machine learning techniques (both unsupervised and supervised) leveraging from a distributed monitoring infrastructure of probes that measure the round trip time to Internet sites under surveillance. The detection process is separated into two stages: per‐probe classification and a combination of individual probe decisions. Our results show that the best strategy is to classify using an unsupervised technique based on Tukey's method and to combine using Hidden Markov Models, due to its performance and adaptability to different attack types.
- Open Access
- 4 January 2023
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 12 (3) , 122-151
HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol
The Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks. Like PIM‐DM, HPIM‐DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbours from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The correctness of the protocol was extensively validated using model checking and logical reasoning. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, we show both theoretically and experimentally that HPIM‐DM has much better convergence times than PIM‐DM.
- 4 January 2023
- Published by Institution of Engineering and Technology (IET) in IET Networks
- Vol. 12 (3) , 122-151
Open AccessHPIM‐DM: A fast and reliable dense‐mode multicast routing protocol
The Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks. Like PIM‐DM, HPIM‐DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbours from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The correctness of the protocol was extensively validated using model checking and logical reasoning. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, we show both theoretically and experimentally that HPIM‐DM has much better convergence times than PIM‐DM.
- Open Access
HPIM-DM: a fast and reliable dense-mode multicast routing protocol (extended version)
This paper proposes the HPIM-DM (Hard-state Protocol Independent Multicast - Dense Mode) multicast routing protocol. HPIM-DM is a hard-state version of PIM-DM that keeps its main characteristics but has faster convergence and better resilience to replay attacks. Like PIM-DM, HPIM-DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding checks. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbors from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, the correctness of the protocol was extensively validated using model checking, logical reasoning and tests performed over the protocol implementation.
Open AccessHPIM-DM: a fast and reliable dense-mode multicast routing protocol (extended version)
This paper proposes the HPIM-DM (Hard-state Protocol Independent Multicast - Dense Mode) multicast routing protocol. HPIM-DM is a hard-state version of PIM-DM that keeps its main characteristics but has faster convergence and better resilience to replay attacks. Like PIM-DM, HPIM-DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding checks. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbors from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, the correctness of the protocol was extensively validated using model checking, logical reasoning and tests performed over the protocol implementation.
- 3 July 2021
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 16 (3) , 491-520
Association measures for interval variables
- 3 July 2021
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 16 (3) , 491-520
Association measures for interval variables
- 1 January 2019
- Published by Elsevier in Neurocomputing
- Vol. 325, 67-89
Theoretical foundations of forward feature selection methods based on mutual information
- 1 January 2019
- Published by Elsevier in Neurocomputing
- Vol. 325, 67-89
Theoretical foundations of forward feature selection methods based on mutual information