Justine Cris Borromeo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Justine Cris Borromeo has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Luca Valcarenghi
Scuola Superiore Sant’Anna
3 shared publications - Koteswararao Kondepu
IIT Dharwad
2 shared publications - Nicola Andriolli
University of Pisa
2 shared publications - Federico Civerchia
Scuola Superiore Sant’Anna, Pisa, Italy
1 shared publication - Frank H. P. Fitzek
Deutsche Telekom Chair of Communication Networks, Technische Universitt Dresden, Dresden, Germany
1 shared publication Isabella Cerutti
Scuola Superiore Sant’Anna
1 shared publication
Latest Publications
- 6 April 2023
- Published by Springer Nature
- p. 67-83
Futuristic Satellite Scenarios in 6G
- Open Access
- 31 March 2022
- Published by Elsevier in Computer Networks
- Vol. 210
FPGA-accelerated SmartNIC for supporting 5G virtualized Radio Access Network
- 31 March 2022
- Published by Elsevier in Computer Networks
- Vol. 210
Open AccessFPGA-accelerated SmartNIC for supporting 5G virtualized Radio Access Network
- 23 March 2021
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 13 (5) , 116-125
FPGA-based implementation of two-step schedulers for modular optical interconnection networks
Optical interconnection networks promise to overcome the limitations of current electronic switching fabrics, enabling higher throughput, lower latency, and lower power consumption. Multi-plane architectures, based on multiple optical switching domains (e.g., space, time, wavelength, orbital angular momentum), are gaining research attention because of their modularity and scalability compared to single-domain switches. An effective scheduler, namely, the two-step scheduler (TSS), has been proposed for multi-plane optical interconnection networks, exploiting their modularity to speed up computations while satisfying the peculiar scheduling constraints. In this paper, a hardware implementation of TSS for modular optical interconnection networks is presented and thoroughly assessed. Both scheduling steps are parallelized with the aim of optimizing the execution time. iSLIP and longest queue first (LQF) scheduling algorithms are exploited in each step, resulting in four TSS configurations that are compared among each other and with classical single-step schedulers (SSSs) in terms of scheduling and hardware performance. TSS outperforms SSS in terms of the number of iterations, maximum operating frequency, worst-case scheduling duration, and required logic resources (i.e., scalability) at the expense of a slight latency penalty. Among all TSS configurations, LQF-based TSS guarantees the lowest scheduling latency, while iSLIP-based TSS minimizes the scheduling duration and the use of field programmable gate array (FPGA) resources.
- 23 March 2021
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 13 (5) , 116-125
FPGA-based implementation of two-step schedulers for modular optical interconnection networks
Optical interconnection networks promise to overcome the limitations of current electronic switching fabrics, enabling higher throughput, lower latency, and lower power consumption. Multi-plane architectures, based on multiple optical switching domains (e.g., space, time, wavelength, orbital angular momentum), are gaining research attention because of their modularity and scalability compared to single-domain switches. An effective scheduler, namely, the two-step scheduler (TSS), has been proposed for multi-plane optical interconnection networks, exploiting their modularity to speed up computations while satisfying the peculiar scheduling constraints. In this paper, a hardware implementation of TSS for modular optical interconnection networks is presented and thoroughly assessed. Both scheduling steps are parallelized with the aim of optimizing the execution time. iSLIP and longest queue first (LQF) scheduling algorithms are exploited in each step, resulting in four TSS configurations that are compared among each other and with classical single-step schedulers (SSSs) in terms of scheduling and hardware performance. TSS outperforms SSS in terms of the number of iterations, maximum operating frequency, worst-case scheduling duration, and required logic resources (i.e., scalability) at the expense of a slight latency penalty. Among all TSS configurations, LQF-based TSS guarantees the lowest scheduling latency, while iSLIP-based TSS minimizes the scheduling duration and the use of field programmable gate array (FPGA) resources.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14 0 0, 430-435
A Fast and Low Capacity Virtual RAN Recovery based on PDCP Split and Optical Fronthaul Traffic Filtering
This paper proposes a Packet Data Convergence Protocol (PDCP) traffic filtering with virtual distributed unit (vDU) and central unit (vCU) hot-backup to reduce the fronthaul connection recovery time during the virtualized function failure. This architecture permits to maintain the communication between the Evolved Packet Core (EPC) and the User Equipment (UE). Experimental results show that a service recovery time is able to achieve in three seconds.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14 0 0, 430-435
A Fast and Low Capacity Virtual RAN Recovery based on PDCP Split and Optical Fronthaul Traffic Filtering
This paper proposes a Packet Data Convergence Protocol (PDCP) traffic filtering with virtual distributed unit (vDU) and central unit (vCU) hot-backup to reduce the fronthaul connection recovery time during the virtualized function failure. This architecture permits to maintain the communication between the Evolved Packet Core (EPC) and the User Equipment (UE). Experimental results show that a service recovery time is able to achieve in three seconds.