RVRui Valadas

Rui Valadas

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    Kubernetes-aware load balancing for leaf-spine EVPN data centers

    by João Carvalheiro, Rui Valadas, Marlon Paz, Hélder Barata, Sérgio Santos


  • Open Access

    Decentralized and Dynamic Zero-Touch Provisioning of Leaf-Spine EVPN Data Centers

    by Martim Tavares, Rui Valadas, Tiago Amado, Marlon Paz, Sérgio Santos

    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

    Hard‐state Protocol Independent Multicast—Source‐Specific Multicast (HPIM‐SSM)

    by Ana Catarina Grilo, Pedro Oliveira, Rui Valadas

    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

    Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies

    by Xavier Gomes, João Fonseca, Rui Valadas

    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

    Detection of Internet‐wide traffic redirection attacks using machine learning techniques

    by Ana Subtil, M. Rosário Oliveira, Rui Valadas, Paulo Salvador, António Pacheco

    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

    HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol

    by Pedro Oliveira, Alexandre Silva, Rui Valadas

    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)

    by Pedro Oliveira, Alexandre Silva, Rui Valadas

    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.

  • Association measures for interval variables

    by M. Rosário Oliveira, Margarida Azeitona, António Pacheco, Rui Valadas


  • Theoretical foundations of forward feature selection methods based on mutual information

    by Francisco Macedo, M. Rosário Oliveira, António Pacheco, Rui Valadas