Chrysa Papagianni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chrysa Papagianni has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Paola Grosso
University of Amsterdam, Amsterdam, The Netherlands
9 shared publications - Christian Esteve Rothenberg
University of Campinas (UNICAMP), Campinas, SP, Brazil
6 shared publications - Francisco Germano Vogt
Universidade Estadual de Campinas, Campinas, Brazil
6 shared publications - Danny De Vleeschauwer
Network Automation Department, Nokia Bell Labs, Antwerp, Belgium
5 shared publications - Marcelo Caggiani Luizelli
Federal University of Pampa, Alegrete, Brazil
5 shared publications - Victor Hugo Schneider Lopes
Universidade Estadual de Campinas, Brazil
5 shared publications
Latest Publications
- Open Access
- 9 June 2026
- Published by Elsevier in Computer Networks
- Vol. 286
End-to-end latency assurance for distributed augmented reality over programmable 6G networks: A DESIRE6G demonstration
- 9 June 2026
- Published by Elsevier in Computer Networks
- Vol. 286
Open AccessEnd-to-end latency assurance for distributed augmented reality over programmable 6G networks: A DESIRE6G demonstration
- 4 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9247-9264
Transformer-Empowered Actor-Critic Reinforcement Learning for Sequence-Aware Service Function Chain Partitioning
In the forthcoming era of 6 G networks, characterized by unprecedented data rates, ultra-low latency, and ubiquitous connectivity, effective management of Virtualized Network Functions (VNFs) is essential. VNFs are software-based counterparts of traditional hardware devices that facilitate flexible and scalable service provisioning. Service Function Chains (SFCs), structured as ordered sequences of VNFs, are pivotal in delivering complex network services. Nevertheless, splitting an SFC into multiple segments that are deployed across different network domains or infrastructure locations presents substantial challenges due to the potential heterogeneity of domain characteristic along with quality of service (QoS) constraints and limited visibility of network state. Conventional optimization methods have limited scalability, while existing data-driven approaches struggle to balance efficiency with capturing VNF inter-dependencies in SFCs. To overcome these limitations, we introduce a Transformer-empowered actor-critic framework specifically designed for sequence-aware SFC partitioning. By utilizing the self-attention mechanism, our approach effectively models complex inter-dependencies between VNFs, facilitating coordinated and parallel decision-making processes. Furthermore, to improve training stability and convergence we introduce an $\epsilon$-LoPe exploration strategy as well as Asymptotic Return Normalization. Comprehensive simulation results demonstrate that the proposed methodology outperforms existing state-of-the-art solutions in terms of long-term service acceptance rates, resource utilization, and scalability while achieving fast inference.
- 4 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9247-9264
Transformer-Empowered Actor-Critic Reinforcement Learning for Sequence-Aware Service Function Chain Partitioning
In the forthcoming era of 6 G networks, characterized by unprecedented data rates, ultra-low latency, and ubiquitous connectivity, effective management of Virtualized Network Functions (VNFs) is essential. VNFs are software-based counterparts of traditional hardware devices that facilitate flexible and scalable service provisioning. Service Function Chains (SFCs), structured as ordered sequences of VNFs, are pivotal in delivering complex network services. Nevertheless, splitting an SFC into multiple segments that are deployed across different network domains or infrastructure locations presents substantial challenges due to the potential heterogeneity of domain characteristic along with quality of service (QoS) constraints and limited visibility of network state. Conventional optimization methods have limited scalability, while existing data-driven approaches struggle to balance efficiency with capturing VNF inter-dependencies in SFCs. To overcome these limitations, we introduce a Transformer-empowered actor-critic framework specifically designed for sequence-aware SFC partitioning. By utilizing the self-attention mechanism, our approach effectively models complex inter-dependencies between VNFs, facilitating coordinated and parallel decision-making processes. Furthermore, to improve training stability and convergence we introduce an $\epsilon$-LoPe exploration strategy as well as Asymptotic Return Normalization. Comprehensive simulation results demonstrate that the proposed methodology outperforms existing state-of-the-art solutions in terms of long-term service acceptance rates, resource utilization, and scalability while achieving fast inference.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3091-3107
iRED: A Disaggregated P4-AQM Fully Implemented in Programmable Data Plane Hardware
Routers use queues to temporarily hold packets when they can’t process them immediately. Congestion occurs when the arrival rate of packets exceeds the processing capacity, leading to increased queuing delay. Active Queue Management (AQM) strategies aim to reduce congestion and queuing delay by draining packets from queues. Traditionally, AQMs are placed in the Egress pipeline of Programmable Data Plane (PDP) hardware due to the availability of queue delay information there. We argue that this approach wastes the router’s resources because the dropped packet has already consumed the entire pipeline of the device. We propose ingress Random Early Detection (iRED) as a more efficient P4-AQM approach fully implemented in PDP hardware, that introduces the concept of disaggregated AQM, effectively resolving the egress drop problem. iRED also supports the Low Latency, Low Loss, and Scalable Throughput (L4S) framework, saving device pipeline resources by dropping packets in the Ingress block. Our experiments with a Tofino2 programmable switch achieved a rate of 1Tbps and show that iRED can reduce router resource consumption by up to 10x in memory usage, 12x fewer processing cycles, and 8x less power consumption for the same traffic load. It achieves fairness in bandwidth usage for different types of traffic and significantly improves Quality of Service (QoS) in Dynamic Adaptive Streaming over HTTP (DASH) with up to a 2.34x improvement in Frames Per Second (FPS) and a 4.77x increase in video player buffer fill. We believe this is a pioneering work to highlight the egress drop problem and deeply explore its potential damage to network performance.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3091-3107
iRED: A Disaggregated P4-AQM Fully Implemented in Programmable Data Plane Hardware
Routers use queues to temporarily hold packets when they can’t process them immediately. Congestion occurs when the arrival rate of packets exceeds the processing capacity, leading to increased queuing delay. Active Queue Management (AQM) strategies aim to reduce congestion and queuing delay by draining packets from queues. Traditionally, AQMs are placed in the Egress pipeline of Programmable Data Plane (PDP) hardware due to the availability of queue delay information there. We argue that this approach wastes the router’s resources because the dropped packet has already consumed the entire pipeline of the device. We propose ingress Random Early Detection (iRED) as a more efficient P4-AQM approach fully implemented in PDP hardware, that introduces the concept of disaggregated AQM, effectively resolving the egress drop problem. iRED also supports the Low Latency, Low Loss, and Scalable Throughput (L4S) framework, saving device pipeline resources by dropping packets in the Ingress block. Our experiments with a Tofino2 programmable switch achieved a rate of 1Tbps and show that iRED can reduce router resource consumption by up to 10x in memory usage, 12x fewer processing cycles, and 8x less power consumption for the same traffic load. It achieves fairness in bandwidth usage for different types of traffic and significantly improves Quality of Service (QoS) in Dynamic Adaptive Streaming over HTTP (DASH) with up to a 2.34x improvement in Frames Per Second (FPS) and a 4.77x increase in video player buffer fill. We believe this is a pioneering work to highlight the egress drop problem and deeply explore its potential damage to network performance.
- Open Access
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 41-42
Poster: Reconstructing LLM Training Workloads: A Topology- and Model-aware Network Tester
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 41-42
Open AccessPoster: Reconstructing LLM Training Workloads: A Topology- and Model-aware Network Tester
- Open Access
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-10
Adaptive Digital Twin Synchronization: A Mechanism for Where, When, and What to Measure
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-10
Open AccessAdaptive Digital Twin Synchronization: A Mechanism for Where, When, and What to Measure
- Open Access
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 39-40
Poster: QueuePilot: Towards Adaptive Queue Scheduling via Live Digital Twins
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 39-40
Open AccessPoster: QueuePilot: Towards Adaptive Queue Scheduling via Live Digital Twins
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 854-859
LLM-based Optimization Algorithm Selection for High-Performance Networks Orchestration
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 854-859
Open AccessLLM-based Optimization Algorithm Selection for High-Performance Networks Orchestration
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 184-186
SmartNet: Bridging Performance and Realism in Network Emulation with SmartNICs
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 184-186
Open AccessSmartNet: Bridging Performance and Realism in Network Emulation with SmartNICs
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 187-189
The GhostTwin: Towards Live Digital Twins via SmartNIC Network Emulation
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 187-189
Open AccessThe GhostTwin: Towards Live Digital Twins via SmartNIC Network Emulation
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 109-111
FlexUP: Breaking Up the CU-UP to Speed Up the RAN
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 109-111
Open AccessFlexUP: Breaking Up the CU-UP to Speed Up the RAN