Vincenzo Suraci
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
Vincenzo Suraci has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Pietrabissa
Department of Computer, Control and Management Engineering, Sapienza University of Rome, Rome, Italy
11 shared publications - Francesco Delli Priscoli
Department of Computer, Control and Management Engineering, University of Rome La Sapienza, Rome, Italy
8 shared publications - Salvatore Monaco
Dipartimento di Ingegneria Informatica, Automatica e Gestionale A. Ruberti, Sapienza University of Rome, Rome, Italy
8 shared publications - Alessandro Di Giorgio
University of Rome La Sapienza,DIAG Department,Rome,Italy
6 shared publications - Stefano Battilotti
Dipartimento di Ingegneria Informatica, Automatica e Gestionale “Antonio Ruberti” Sapienza University of Rome Rome Italy
5 shared publications Federico Cimorelli
Department of Computer, Control, and Management Engineering Antonio Ruberti, University of Rome La Sapienza, Rome, Italy
4 shared publications
Latest Publications
- Open Access
- 4 August 2023
- Published by MDPI AG in Healthcare
- Vol. 11 (15) , 2199
CADUCEO: A Platform to Support Federated Healthcare Facilities through Artificial Intelligence
Data-driven algorithms have proven to be effective for a variety of medical tasks, including disease categorization and prediction, personalized medicine design, and imaging diagnostics. Although their performance is frequently on par with that of clinicians, their widespread use is constrained by a number of obstacles, including the requirement for high-quality data that are typical of the population, the difficulty of explaining how they operate, and ethical and regulatory concerns. The use of data augmentation and synthetic data generation methodologies, such as federated learning and explainable artificial intelligence ones, could provide a viable solution to the current issues, facilitating the widespread application of artificial intelligence algorithms in the clinical application domain and reducing the time needed for prevention, diagnosis, and prognosis by up to 70%. To this end, a novel AI-based functional framework is conceived and presented in this paper.
- 4 August 2023
- Published by MDPI AG in Healthcare
- Vol. 11 (15) , 2199
Open AccessCADUCEO: A Platform to Support Federated Healthcare Facilities through Artificial Intelligence
Data-driven algorithms have proven to be effective for a variety of medical tasks, including disease categorization and prediction, personalized medicine design, and imaging diagnostics. Although their performance is frequently on par with that of clinicians, their widespread use is constrained by a number of obstacles, including the requirement for high-quality data that are typical of the population, the difficulty of explaining how they operate, and ethical and regulatory concerns. The use of data augmentation and synthetic data generation methodologies, such as federated learning and explainable artificial intelligence ones, could provide a viable solution to the current issues, facilitating the widespread application of artificial intelligence algorithms in the clinical application domain and reducing the time needed for prevention, diagnosis, and prognosis by up to 70%. To this end, a novel AI-based functional framework is conceived and presented in this paper.
- 18 September 2019
- Published by Springer Nature
- p. 139-148
eLearning Course Design in Higher Education to Maximize Students’ Performance
- 18 September 2019
- Published by Springer Nature
- p. 139-148
eLearning Course Design in Higher Education to Maximize Students’ Performance
- 20 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 27 (5) , 1924-1936
Lyapunov-Based Design of a Distributed Wardrop Load-Balancing Algorithm With Application to Software-Defined Networking
This paper presents an original discrete-time, distributed, noncooperative load-balancing algorithm, based on mean field game theory, which does not require explicit communications. The algorithm is proven to converge to an arbitrarily small neighborhood of a specific equilibrium among the loads of the providers, known as Wardrop equilibrium. Thanks to its characteristics, the algorithm is suitable for the software-defined networking (SDN) scenario, where service requests coming from the network nodes, i.e., the switches, are managed by the so-called SDN controllers, playing the role of providers. The proposed approach is aimed at dynamically balancing the requests of the switches among the SDN controllers to avoid congestion. This paper also suggests the adoption of SDN Proxies to improve the scalability of the overall SDN paradigm and presents an implementation of the algorithm in a proof-of-concept SDN scenario, which shows the effectiveness of the proposed solution with respect to the current approaches.
- 20 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 27 (5) , 1924-1936
Lyapunov-Based Design of a Distributed Wardrop Load-Balancing Algorithm With Application to Software-Defined Networking
This paper presents an original discrete-time, distributed, noncooperative load-balancing algorithm, based on mean field game theory, which does not require explicit communications. The algorithm is proven to converge to an arbitrarily small neighborhood of a specific equilibrium among the loads of the providers, known as Wardrop equilibrium. Thanks to its characteristics, the algorithm is suitable for the software-defined networking (SDN) scenario, where service requests coming from the network nodes, i.e., the switches, are managed by the so-called SDN controllers, playing the role of providers. The proposed approach is aimed at dynamically balancing the requests of the switches among the SDN controllers to avoid congestion. This paper also suggests the adoption of SDN Proxies to improve the scalability of the overall SDN paradigm and presents an implementation of the algorithm in a proof-of-concept SDN scenario, which shows the effectiveness of the proposed solution with respect to the current approaches.
- 1 October 2017
- Published by Elsevier in Automatica
- Vol. 84, 159-165
Wardrop equilibrium on time-varying graphs
- 1 October 2017
- Published by Elsevier in Automatica
- Vol. 84, 159-165
Wardrop equilibrium on time-varying graphs
- 19 January 2017
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 15 (2) , 892-904
Multi-agent quality of experience control
- 19 January 2017
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 15 (2) , 892-904
Multi-agent quality of experience control
- 31 July 2015
- Published by Taylor & Francis in International Journal of Control
- Vol. 89 (2) , 235-247
A lexicographic approach to constrained MDP admission control
This paper proposes a reinforcement learning-based lexicographic approach to the call admission control problem in communication networks. The admission control problem is modelled as a multi-constrained Markov decision process. To overcome the problems of the standard approaches to the solution of constrained Markov decision processes, based on the linear programming formulation or on a Lagrangian approach, a multi-constraint lexicographic approach is defined, and an online implementation based on reinforcement learning techniques is proposed. Simulations validate the proposed approach.
- 31 July 2015
- Published by Taylor & Francis in International Journal of Control
- Vol. 89 (2) , 235-247
A lexicographic approach to constrained MDP admission control
This paper proposes a reinforcement learning-based lexicographic approach to the call admission control problem in communication networks. The admission control problem is modelled as a multi-constrained Markov decision process. To overcome the problems of the standard approaches to the solution of constrained Markov decision processes, based on the linear programming formulation or on a Lagrangian approach, a multi-constraint lexicographic approach is defined, and an online implementation based on reinforcement learning techniques is proposed. Simulations validate the proposed approach.
- 30 July 2015
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (7) , e3020
An any‐sink energy‐efficient routing protocol in multi‐hop wireless sensor networks for planetary exploration
Summary: Wireless sensor networks (WSNs) are made of spatially distributed autonomous sensors, which cooperate to monitor physical or environmental parameters and to deliver such data to one or more data sinks. A promising field of application of WSNs is planetary exploration, characterized by a continuous monitoring of the surface to have clear notion of planet conditions and prepare for future manned missions. The potentially large size of the region to be monitored and the line‐of‐sight limitations (as, for instance, on the Moon, which is the case study discussed in the paper) hamper the possibility of having 1‐hop sensor‐sink communications. Therefore, to allow sensed data to reach the sink(s), the sensors must be able to create and maintain a multi‐hop ad hoc network. This paper proposes an ad hoc routing algorithm applicable to WSNs for planetary exploration, aiming at (i) assuring any‐cast communications with multiple data sinks, (ii) minimizing the control overhead for routing maintenance, (iii) being light in terms of memory/computational requirements, to be installed into low‐power and low‐memory/processing devices, (iv) being rapid to reconfigure in the presence of node failures and (v) optimizing the choice of the paths, to achieve energy balancing and saving. Extensive simulations show the efficiency of the proposed approach. Copyright © 2015 John Wiley & Sons, Ltd.
- 30 July 2015
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (7) , e3020
An any‐sink energy‐efficient routing protocol in multi‐hop wireless sensor networks for planetary exploration
Summary: Wireless sensor networks (WSNs) are made of spatially distributed autonomous sensors, which cooperate to monitor physical or environmental parameters and to deliver such data to one or more data sinks. A promising field of application of WSNs is planetary exploration, characterized by a continuous monitoring of the surface to have clear notion of planet conditions and prepare for future manned missions. The potentially large size of the region to be monitored and the line‐of‐sight limitations (as, for instance, on the Moon, which is the case study discussed in the paper) hamper the possibility of having 1‐hop sensor‐sink communications. Therefore, to allow sensed data to reach the sink(s), the sensors must be able to create and maintain a multi‐hop ad hoc network. This paper proposes an ad hoc routing algorithm applicable to WSNs for planetary exploration, aiming at (i) assuring any‐cast communications with multiple data sinks, (ii) minimizing the control overhead for routing maintenance, (iii) being light in terms of memory/computational requirements, to be installed into low‐power and low‐memory/processing devices, (iv) being rapid to reconfigure in the presence of node failures and (v) optimizing the choice of the paths, to achieve energy balancing and saving. Extensive simulations show the efficiency of the proposed approach. Copyright © 2015 John Wiley & Sons, Ltd.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6469-6474
A distributed bandwidth allocation algorithm for bluetooth wireless networks based on Wardrop equilibrium
In the project DAAS, wireless communications in zone with explosive atmosphere (ATEX) are investigated. In particular, Bluetooth multi-hop networks, also called Bluetooth scatternets, are a clear candidate due to their low transmission power. The problem of bandwidth allocation in Bluetooth scatternets is dealt with in this paper: given the average traffic flows which the network has to transmit, the problem seeks an efficient capacity allocation which is feasible (i.e., it allows to transmit all the traffic flows). A distributed algorithm is developed, that converges to a Wardrop equilibrium such that, in the final capacity allocazione, the delays incurred by all traffic flows are the same.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6469-6474
A distributed bandwidth allocation algorithm for bluetooth wireless networks based on Wardrop equilibrium
In the project DAAS, wireless communications in zone with explosive atmosphere (ATEX) are investigated. In particular, Bluetooth multi-hop networks, also called Bluetooth scatternets, are a clear candidate due to their low transmission power. The problem of bandwidth allocation in Bluetooth scatternets is dealt with in this paper: given the average traffic flows which the network has to transmit, the problem seeks an efficient capacity allocation which is feasible (i.e., it allows to transmit all the traffic flows). A distributed algorithm is developed, that converges to a Wardrop equilibrium such that, in the final capacity allocazione, the delays incurred by all traffic flows are the same.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6475-6482
Future internet architecture: Control-based perspectives related to Quality of Experience (QoE) management
This paper presents the Future Internet Architecture developed in the framework of the Platino project, focusing on the Quality of Experience (QoE) Management; the presented architecture is fully compliant with the concepts developed in the framework of the FP7 PPP Future Internet initiative and in the projects related to Software Defined Networks (SDNs) and Network Function Virtualization (NFV). The paper highlights the proposed underlying innovations of the architecture related to the Orchestration functionalities; in particular, the developments related to such innovations offer a plenty of opportunities for applying control based, operation research and optimization techniques.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6475-6482
Future internet architecture: Control-based perspectives related to Quality of Experience (QoE) management
This paper presents the Future Internet Architecture developed in the framework of the Platino project, focusing on the Quality of Experience (QoE) Management; the presented architecture is fully compliant with the concepts developed in the framework of the FP7 PPP Future Internet initiative and in the projects related to Software Defined Networks (SDNs) and Network Function Virtualization (NFV). The paper highlights the proposed underlying innovations of the architecture related to the Orchestration functionalities; in particular, the developments related to such innovations offer a plenty of opportunities for applying control based, operation research and optimization techniques.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 9084-9089
Resource management in multi-cloud scenarios via reinforcement learning
The concept of Virtualization of Network Resources, such as cloud storage and computing power, has become crucial to any business that needs dynamic IT resources. With virtualization, we refer to the migration of various tasks, usually performed by hardware infrastructures, to virtual IT resources. This approach allows resources to be rapidly deployed, scaled and dynamically reassigned. In the last few years, the demand of cloud resources has grown dramatically, and a new figure plays a key role: the Cloud Management Broker (CMB). The CMB purpose is to manage cloud resources to meet the user's requirements and, at the same time, to optimize their usage. This paper proposes two multi-cloud resource allocation algorithms that manage the resource requests with the aim of maximizing the CMB revenue over time. The algorithms, based on Reinforcement Learning techniques, are evaluated and compared by numerical simulations.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 9084-9089
Resource management in multi-cloud scenarios via reinforcement learning
The concept of Virtualization of Network Resources, such as cloud storage and computing power, has become crucial to any business that needs dynamic IT resources. With virtualization, we refer to the migration of various tasks, usually performed by hardware infrastructures, to virtual IT resources. This approach allows resources to be rapidly deployed, scaled and dynamically reassigned. In the last few years, the demand of cloud resources has grown dramatically, and a new figure plays a key role: the Cloud Management Broker (CMB). The CMB purpose is to manage cloud resources to meet the user's requirements and, at the same time, to optimize their usage. This paper proposes two multi-cloud resource allocation algorithms that manage the resource requests with the aim of maximizing the CMB revenue over time. The algorithms, based on Reinforcement Learning techniques, are evaluated and compared by numerical simulations.