Aoyu Gong
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
Research Subjects
Aoyu Gong has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Arman Maghsoudnia
EPFL
4 shared publications - Dan Mihai Dumitriu
Pavonis LLC
4 shared publications - Haitham Hassanieh
EPFL, Lausanne, Switzerland
4 shared publications - Yijin Zhang
School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China
4 shared publications - Raphael Cannatà
EPFL
3 shared publications - Yan Lin
School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China
3 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 263-283
SAGE: A Real-Time AI System for Reducing Latency in NextG Cellular Networks
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 263-283
Open AccessSAGE: A Real-Time AI System for Reducing Latency in NextG Cellular Networks
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 7-14
Towards URLLC with Open-Source 5G Software
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 7-14
Open AccessTowards URLLC with Open-Source 5G Software
- 29 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5774-5787
Age-Gain-Dependent Random Access for Event-Driven Periodic Updating
This paper considers utilizing the knowledge of age gains to reduce the average age of information (AoI) in random access with event-driven periodic updating for the first time. Built on the form of slotted ALOHA, we require each device to determine its age gain threshold and transmission probability in an easily implementable decentralized manner, so that the contention can be limited to devices with age gains as high as possible. For the basic case that each device utilizes its knowledge of age gain of only itself, we provide an analytical modeling by a multi-layer discrete-time Markov chains (DTMCs), where an external DTMC manages the jumps between the beginnings of frames and an internal DTMC manages the evolution during an arbitrary frame, for obtaining optimal fixed access parameters offline. For the enhanced case that each device utilizes its knowledge of age gains of all the devices, we require each device to adjust its access parameters for maximizing the estimated network expected AoI reduction per slot, through maintaining the a posteriori joint probability distribution of local age and age gain of an arbitrary device in a Bayesian manner. Numerical results validate our study and demonstrate the advantage of the proposed schemes over other schemes.
- 29 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5774-5787
Age-Gain-Dependent Random Access for Event-Driven Periodic Updating
This paper considers utilizing the knowledge of age gains to reduce the average age of information (AoI) in random access with event-driven periodic updating for the first time. Built on the form of slotted ALOHA, we require each device to determine its age gain threshold and transmission probability in an easily implementable decentralized manner, so that the contention can be limited to devices with age gains as high as possible. For the basic case that each device utilizes its knowledge of age gain of only itself, we provide an analytical modeling by a multi-layer discrete-time Markov chains (DTMCs), where an external DTMC manages the jumps between the beginnings of frames and an internal DTMC manages the evolution during an arbitrary frame, for obtaining optimal fixed access parameters offline. For the enhanced case that each device utilizes its knowledge of age gains of all the devices, we require each device to adjust its access parameters for maximizing the estimated network expected AoI reduction per slot, through maintaining the a posteriori joint probability distribution of local age and age gain of an arbitrary device in a Bayesian manner. Numerical results validate our study and demonstrate the advantage of the proposed schemes over other schemes.
- Open Access
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1793-1795
SliceGuard: Secure and Dynamic 5G RAN Slicing with WebAssembly
5G enables diverse services through network slicing, allowing multiple virtual networks to share physical infrastructure. However, efficiently managing resources across slices is challenging. This demo presents SliceGuard, a two-level scheduling system that leverages WebAssembly (Wasm) to allow slice owners to run customized schedulers in a secure, platform-independent environment, while the network operator manages inter-slice resource allocation. We demonstrate dynamic slicing for cloud gaming over 5G and show how Wasm enables real-time scheduler updates and fault isolation. This approach enhances flexibility, security, and customization for private 5G networks.
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1793-1795
Open AccessSliceGuard: Secure and Dynamic 5G RAN Slicing with WebAssembly
5G enables diverse services through network slicing, allowing multiple virtual networks to share physical infrastructure. However, efficiently managing resources across slices is challenging. This demo presents SliceGuard, a two-level scheduling system that leverages WebAssembly (Wasm) to allow slice owners to run customized schedulers in a secure, platform-independent environment, while the network operator manages inter-slice resource allocation. We demonstrate dynamic slicing for cloud gaming over 5G and show how Wasm enables real-time scheduler updates and fault isolation. This approach enhances flexibility, security, and customization for private 5G networks.
- Open Access
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 111-120
Ultra-Reliable Low-Latency in 5G: A Close Reality or a Distant Goal?
Ultra-Reliable Low-Latency Communication (URLLC) was introduced in 5G to meet the demanding requirements of latencies as low as 0.5 ms and reliability of 99.999 % for specific applications. Despite over a decade of discussions on URLLC, achieving these standards in real-world implementations remains challenging. We argue that it is unclear if and how URLLC can be attained and a holistic system-level perspective that addresses all the system's inherent bottlenecks is needed. Inspired by a real-world 5G testbed, we present this comprehensive vision and show how to achieve latency requirements by outlining the necessary design choices across all system layers, including the processing and radio units.
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 111-120
Open AccessUltra-Reliable Low-Latency in 5G: A Close Reality or a Distant Goal?
Ultra-Reliable Low-Latency Communication (URLLC) was introduced in 5G to meet the demanding requirements of latencies as low as 0.5 ms and reliability of 99.999 % for specific applications. Despite over a decade of discussions on URLLC, achieving these standards in real-world implementations remains challenging. We argue that it is unclear if and how URLLC can be attained and a holistic system-level perspective that addresses all the system's inherent bottlenecks is needed. Inspired by a real-world 5G testbed, we present this comprehensive vision and show how to achieve latency requirements by outlining the necessary design choices across all system layers, including the processing and radio units.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 433-448
Uniform-Cost Multi-Path Routing for Reconfigurable Data Center Networks
Reconfigurable data center networks (RDCNs) are arising as a promising data center network (DCN) design in the post-Moore's law era. However, the constantly reconfigured network topology in RDCNs invalidates the assumption of using hop count as the cost metric for routing, e.g., the status quo Equal-Cost Multi-Path routing (ECMP) in traditional DCNs. Unfortunately, existing routing solutions in RDCNs stick to the old assumption and deliver suboptimal performance either high in latency or low in bandwidth efficiency. In this paper, we redefine the cost metric for RDCN routing with uniform cost to unify the effects of topology disruption and hop count on latency and bandwidth efficiency. We propose Uniform-Cost Multi-Path routing (UCMP), an ECMP equivalent for RDCNs, where minimizing uniform cost leads flows of various sizes to the right balance between latency and bandwidth efficiency. Our simulation shows that UCMP achieves 53% to 98% lower flow completion time (FCT) and 1.55× bandwidth efficiency compared to the state-of-the-art RDCN routing strategy, and our testbed implementation demonstrates sustainable switch resource usage of UCMP as RDCNs scale.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 433-448
Open AccessUniform-Cost Multi-Path Routing for Reconfigurable Data Center Networks
Reconfigurable data center networks (RDCNs) are arising as a promising data center network (DCN) design in the post-Moore's law era. However, the constantly reconfigured network topology in RDCNs invalidates the assumption of using hop count as the cost metric for routing, e.g., the status quo Equal-Cost Multi-Path routing (ECMP) in traditional DCNs. Unfortunately, existing routing solutions in RDCNs stick to the old assumption and deliver suboptimal performance either high in latency or low in bandwidth efficiency. In this paper, we redefine the cost metric for RDCN routing with uniform cost to unify the effects of topology disruption and hop count on latency and bandwidth efficiency. We propose Uniform-Cost Multi-Path routing (UCMP), an ECMP equivalent for RDCNs, where minimizing uniform cost leads flows of various sizes to the right balance between latency and bandwidth efficiency. Our simulation shows that UCMP achieves 53% to 98% lower flow completion time (FCT) and 1.55× bandwidth efficiency compared to the state-of-the-art RDCN routing strategy, and our testbed implementation demonstrates sustainable switch resource usage of UCMP as RDCNs scale.
- 31 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (1) , 1503-1508
Dynamic Random Access Without Observation Under Deadline-Constrained Periodic Traffic
This paper focuses on random access in uplink systems under deadline-constrained periodic traffic, which is typical for many real-time Internet of Things scenarios. To achieve very low overhead in random access, we consider dynamic slotted ALOHA without observation where each active node adopts time-dependent but observation-independent transmission probabilities. Built on the theory of blind Markov decision processes, we develop an analytical framework of such dynamic access with a simplified version of information states, which leads to optimal time-dependent transmission probabilities. Further, based on this framework, we derive simple closed-form expressions for optimal time-dependent transmission probabilities and maximum long-run system throughput, which makes our scheme also enjoy very low complexity. Numerical results show that the proposed scheme outperforms other random access schemes without observation over a wide range of network configurations.
- 31 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (1) , 1503-1508
Dynamic Random Access Without Observation Under Deadline-Constrained Periodic Traffic
This paper focuses on random access in uplink systems under deadline-constrained periodic traffic, which is typical for many real-time Internet of Things scenarios. To achieve very low overhead in random access, we consider dynamic slotted ALOHA without observation where each active node adopts time-dependent but observation-independent transmission probabilities. Built on the theory of blind Markov decision processes, we develop an analytical framework of such dynamic access with a simplified version of information states, which leads to optimal time-dependent transmission probabilities. Further, based on this framework, we derive simple closed-form expressions for optimal time-dependent transmission probabilities and maximum long-run system throughput, which makes our scheme also enjoy very low complexity. Numerical results show that the proposed scheme outperforms other random access schemes without observation over a wide range of network configurations.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (11) , 6435-6450
Achieving Maximum Urgency-Dependent Throughput in Random Access
Designing efficient random access is a vital problem for urgency-constrained packet delivery in uplink Internet of Things (IoT), which has not been investigated in depth so far. In this paper, we focus on unpredictable frame-synchronized traffic, which captures a number of scenarios in IoT communications, and generalize prior studies on this issue by considering a general ALOHA-like protocol, a general single-packet reception (SPR) channel, urgency-dependent throughput (UDT) based on a general urgency function, and the dynamic programming optimality. With a complete knowledge of the number of active users, we use the theory of Markov Decision Process (MDP) to explicitly obtain optimal policies for maximizing the UDT, and prove that a myopic policy is in general optimal. With an incomplete knowledge of the number of active users, we use the theory of Partially Observable MDP (POMDP) to seek optimal policies, and show that a myopic policy is in general not optimal by presenting a counterexample. Because of the prohibitive complexity to obtain optimal or near-optimal policies for this case, we propose two practical policies that utilize the inherent property of our MDP framework and channel model. Simulation results show that both outperform other alternatives. The robustness under relaxed system settings is also examined.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (11) , 6435-6450
Achieving Maximum Urgency-Dependent Throughput in Random Access
Designing efficient random access is a vital problem for urgency-constrained packet delivery in uplink Internet of Things (IoT), which has not been investigated in depth so far. In this paper, we focus on unpredictable frame-synchronized traffic, which captures a number of scenarios in IoT communications, and generalize prior studies on this issue by considering a general ALOHA-like protocol, a general single-packet reception (SPR) channel, urgency-dependent throughput (UDT) based on a general urgency function, and the dynamic programming optimality. With a complete knowledge of the number of active users, we use the theory of Markov Decision Process (MDP) to explicitly obtain optimal policies for maximizing the UDT, and prove that a myopic policy is in general optimal. With an incomplete knowledge of the number of active users, we use the theory of Partially Observable MDP (POMDP) to seek optimal policies, and show that a myopic policy is in general not optimal by presenting a counterexample. Because of the prohibitive complexity to obtain optimal or near-optimal policies for this case, we propose two practical policies that utilize the inherent property of our MDP framework and channel model. Simulation results show that both outperform other alternatives. The robustness under relaxed system settings is also examined.
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (4) , 2059-2073
Dynamic Optimization of Random Access in Deadline-Constrained Broadcasting
This paper considers dynamic optimization of random access in deadline-constrained broadcasting with frame-synchronized traffic. Under the non-retransmission setting, we define a dynamic control scheme that allows each active node to determine the transmission probability based on the local knowledge of current delivery urgency and contention intensity (i.e., the number of active nodes). For an idealized environment where the contention intensity is completely known, we develop a Markov Decision Process (MDP) framework, by which an optimal scheme for maximizing the timely delivery ratio (TDR) can be explicitly obtained. For a realistic environment where the contention intensity is incompletely known, we develop a Partially Observable MDP (POMDP) framework, by which an optimal scheme can only in theory be found. To overcome the infeasibility in obtaining an optimal or near-optimal scheme from the POMDP framework, we investigate the behaviors of the optimal scheme for extreme cases in the MDP framework, and leverage intuition gained from these behaviors together with an approximation on the contention intensity knowledge to propose a heuristic scheme for the realistic environment with TDR close to the maximum TDR in the idealized environment. We further generalize the heuristic scheme to support retransmissions. Numerical results are provided to validate our study.
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 10 (4) , 2059-2073
Dynamic Optimization of Random Access in Deadline-Constrained Broadcasting
This paper considers dynamic optimization of random access in deadline-constrained broadcasting with frame-synchronized traffic. Under the non-retransmission setting, we define a dynamic control scheme that allows each active node to determine the transmission probability based on the local knowledge of current delivery urgency and contention intensity (i.e., the number of active nodes). For an idealized environment where the contention intensity is completely known, we develop a Markov Decision Process (MDP) framework, by which an optimal scheme for maximizing the timely delivery ratio (TDR) can be explicitly obtained. For a realistic environment where the contention intensity is incompletely known, we develop a Partially Observable MDP (POMDP) framework, by which an optimal scheme can only in theory be found. To overcome the infeasibility in obtaining an optimal or near-optimal scheme from the POMDP framework, we investigate the behaviors of the optimal scheme for extreme cases in the MDP framework, and leverage intuition gained from these behaviors together with an approximation on the contention intensity knowledge to propose a heuristic scheme for the realistic environment with TDR close to the maximum TDR in the idealized environment. We further generalize the heuristic scheme to support retransmissions. Numerical results are provided to validate our study.