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


Sima Barzegar has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Near-real-time 6G service operation enabled by distributed intelligence and in-band telemetry

    by P. González, F. Alhamed, H. Shakespear-Miles, S. Barzegar, F. Paolucci, A. Sgambelluri, J. J. Vegas Olmos, M. Ruiz, L. Velasco

    The combination of highly dynamic network services requiring stringent quality of service (QoS), especially in terms of end-to-end (e2e) delay, together with capital and operational cost reduction cannot be faced using centralized software-defined networking (SDN) solutions only. In particular, such expected dynamicity requires autonomous near-real-time operation fed with pervasive telemetry to make per-service decisions that ensure the committed QoS, while reducing overprovisioning as much as possible. In this paper, we propose a distributed control architecture based on multi-agent systems (MASs) to assist the SDN controller in the control of network services near-real-time. Per-traffic flow telemetry data are collected from the packet nodes, distributed through the agents in the control plane, and analyzed to assure performance and to anticipate any degradation. Measurements feed flow agents, which are based on deep reinforcement learning (DRL) models, to make routing decisions aiming at ensuring flow performance. In the case when QoS degradation is detected, we propose algorithms to analyze its cause, which can be a result of some bottleneck in the network. We show how the latter is detected and additional capacity is requested of the SDN controller, which in turn creates an optical bypass to provide additional capacity. The proposed solution is demonstrated experimentally on a federated testbed connecting UPC and CNIT premises. Focused first on the control plane, the feasibility of the proposed architecture and workflows is experimentally assessed. After that, the performance of the near-real-time operation is evaluated at the data plane to verify that the maximum e2e delay is not exceeded for multiple flows, showing the effectiveness of predictive QoS evaluation together with infrastructure and service reconfiguration.


  • Open Access

    Provisioning of Time-Sensitive and Non-Time-Sensitive Flows With Assured Performance

    by Luis Velasco, Gianluca Graziadei, Sima Barzegar, Marc Ruiz

    Time-Sensitive Networking (TSN) standards provide scheduling and traffic shaping mechanisms to ensure the coexistence of Time-Sensitive (TS) and non-TS traffic classes on the same network infrastructure. Nonetheless, much effort is still needed on the operation of such TSN capable network infrastructure to ensure that the required performance of the different flows, defined in terms of key performance indicators, can be met once the flows are deployed in the network. In this paper, we focus on such aspects and propose a solution involving network-wide scheduling for TS flows, as well as performance estimation for non-TS flows. Specifically, a control plane architecture especially designed for provisioning TS and non-TS flows is proposed. The architecture integrates: i) a TS Flow Scheduler Planner for defining the scheduling of requested TS flows along a path so as to meet their required performance; and ii) a Network Digital Twin to estimate the performance of requested and already established non-TS flows. Differently from standardized time-aware schedulers, per-TS flow queues are assumed so as to guarantee minimal jitter. Efficient algorithms are proposed so the provisioning of flows can be carried out with high accuracy and short time. Simulation results for heterogeneous scenarios demonstrate the feasibility and efficiency of the proposed control plane architecture, as well as point out the limitations of current time-synchronization mechanisms when high-speed interfaces are considered.


  • Open Access

    Scenarios for Optical Encryption Using Quantum Keys

    by Luis Velasco, Morteza Ahmadian, Laura Ortiz, Juan P. Brito, Antonio Pastor, Jose M. Rivas, Sima Barzegar, Jaume Comellas, Vicente Martin, Marc Ruiz

    Optical communications providing huge capacity and low latency remain vulnerable to a range of attacks. In consequence, encryption at the optical layer is needed to ensure secure data transmission. In our previous work, we proposed LightPath SECurity (LPSec), a secure cryptographic solution for optical transmission that leverages stream ciphers and Diffie–Hellman (DH) key exchange for high-speed optical encryption. Still, LPSec faces limitations related to key generation and key distribution. To address these limitations, in this paper, we rely on Quantum Random Number Generators (QRNG) and Quantum Key Distribution (QKD) networks. Specifically, we focus on three meaningful scenarios: In Scenario A, the two optical transponders (Tp) involved in the optical transmission are within the security perimeter of the QKD network. In Scenario B, only one Tp is within the QKD network, so keys are retrieved from a QRNG and distributed using LPSec. Finally, Scenario C extends Scenario B by employing Post-Quantum Cryptography (PQC) by implementing a Key Encapsulation Mechanism (KEM) to secure key exchanges. The scenarios are analyzed based on their security, efficiency, and applicability, demonstrating the potential of quantum-enhanced LPSec to provide secure, low-latency encryption for current optical communications. The experimental assessment, conducted on the Madrid Quantum Infrastructure, validates the feasibility of the proposed solutions.


  • Centralized and distributed approaches to control optical point-to-multipoint systems near-real-time

    by H. Shakespear-Miles, Qunzhi Lin, Sima Barzegar, Marc Ruiz, Xiaoliang Chen, Luis Velasco

    Optical point-to-multipoint (P2MP) connectivity based on digital subcarrier multiplexing (DSCM) has been shown as a solution for the metro-access segment that is able to reduce capital and operational costs and support the capacity and high dynamicity needs of future 6G services. To achieve maximum performance, activation and deactivation of subcarriers must be done near-real-time to provide just the capacity needed to support the input traffic. In this paper, we investigate the applicability of various approaches capable of supporting the near-real-time operation requirement. Starting from the centralized approach that can be carried out on the centralized software-defined networking (SDN) controller, we also explore distributed approaches that might relieve the SDN controller from near-real-time operation. In particular, we explore the performance of deploying a multiagent system (MAS), where intelligent agents run on top of the nodes in the P2MP tree and communicate among them. Illustrative results show that the distributed approaches can achieve a performance close to that of the centralized one, while reducing communication needs. Results also show the importance of traffic/capacity prediction to anticipate the activation of subcarriers.


  • Open Access

    Autonomous Flow Routing for Near Real-Time Quality of Service Assurance

    by Sima Barzegar, Marc Ruiz, Luis Velasco

    The deployment of beyond 5G and 6G network infrastructures will enable highly dynamic services requiring stringent Quality of Service (QoS). Supporting such combinations in today’s transport networks will require high flexibility and automation to operate near real-time and reduce overprovisioning. Many solutions for autonomous network operation based on Machine Learning require a global network view, and thus need to be deployed at the Software-Defined Networking (SDN) controller. In consequence, these solutions require implementing control loops, where algorithms running in the controller use telemetry measurements collected at the data plane to make decisions that need to be applied at the data plane. Such control loops fit well for provisioning and failure management purposes, but not for near real-time operation because of their long response times. In this paper, we propose a distributed approach for autonomous near-real-time flow routing with QoS assurance. Our solution brings intelligence closer to the data plane to reduce response times; it is based on the combined application of Deep Reinforcement Learning (DRL) and Multi-Agent Systems (MAS) to create a distributed collaborative network control plane. Node agents ensure QoS of traffic flows, specifically end-to-end delay, while minimizing routing costs by making distributed routing decisions. Algorithms in the centralized network controller provide the agents with the set of routes that can be used for each traffic flow and give freedom to the agents to use them during operation. Results show that the proposed solution is able to ensure end-to-end delay under the desired maximum and greatly reduce routing costs. This performance is achieved in dynamic scenarios without previous knowledge of the traffic profile or the background traffic, for single domain and multidomain networks.


  • Distributed and Autonomous Flow Routing Based on Deep Reinforcement Learning

    by Sima Barzegar, Marc Ruiz, Luis Velasco

    A DRL approach with a specific reward function is proposed for autonomous flow routing operating on multilayer scenarios. Illustrative results reveal that the DRL achieves optimal flow routing in terms of cost and service quality.


  • Open Access

    Packet Flow Capacity Autonomous Operation Based on Reinforcement Learning

    by Sima Barzegar, Marc Ruiz, Luis Velasco

    As the dynamicity of the traffic increases, the need for self-network operation becomes more evident. One of the solutions that might bring cost savings to network operators is the dynamic capacity management of large packet flows, especially in the context of packet over optical networks. Machine Learning, particularly Reinforcement Learning, seems to be an enabler for autonomicity as a result of its inherent capacity to learn from experience. However, precisely because of that, RL methods might not be able to provide the required performance (e.g., delay, packet loss, and capacity overprovisioning) when managing the capacity of packet flows, until they learn the optimal policy. In view of that, we propose a management lifecycle with three phases: (i) a self-tuned threshold-based approach operating just after the packet flow is set up and until enough data on the traffic characteristics are available; (ii) an RL operation based on models pre-trained with a generic traffic profile; and (iii) an RL operation with models trained for real traffic. Exhaustive simulation results confirm the poor performance of RL algorithms until the optimal policy is learnt and when traffic characteristics change over time, which prevents deploying such methods in operators’ networks. In contrast, the proposed lifecycle outperforms benchmarking approaches, achieving noticeable performance from the beginning of operation while showing robustness against traffic changes.


  • Intent-based networking and its application to optical networks [Invited Tutorial]

    by Sima Barzegar

    The intent-based networking (IBN) paradigm targets defining high-level abstractions so network operators can define what their desired outcomes are without specifying how they would be achieved. The latter can be achieved by leveraging network programmability, monitoring, and data analytics, as well as the key assurance component. In this tutorial, we introduce the IBN paradigm and its application to optical networking, highlighting the benefits that machine learning (ML) algorithms can provide to IBN. Because the deployment of ML applications requires a specific orchestrator to create ML functions that are connected as ML pipelines, we show an implementation of such an orchestrator. Some challenges and solutions are presented for the generation of accurate synthetic data, proactive self-configuration, and cooperative intent operation. Illustrative examples of intent-based operation and numerical results are presented, and the obtained performance is discussed.