Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gianmarco Lia

dblp:263/5107 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-7043-0669ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 67% Edge and fog computing · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › resource management
edge resource management
0.812024
In-Network Placement of Reusable Computing Tasks in an SDN-Based Network Edge · IEEE Trans. Mob. Comput. 2024
Software-defined and programmable networks › programmable data plane
in-network computation
0.812024
In-Network Placement of Reusable Computing Tasks in an SDN-Based Network Edge · IEEE Trans. Mob. Comput. 2024
Software-defined and programmable networks
SDN applications
0.812024
In-Network Placement of Reusable Computing Tasks in an SDN-Based Network Edge · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

integer linear programming · 0.8heuristic · 0.8
YearPublicationVenuePosition
2024 In-Network Placement of Reusable Computing Tasks in an SDN-Based Network Edge
abstract
Edge computing is aimed to support compute-intensive data-hungry interactive applications which can hardly run on resource-constrained consumer devices and may suffer from running in the cloud due to the long data transfer delay. The edge network nodes' heterogeneous and limited (compared to the cloud) capabilities make the computing task placement a challenge. In this paper, we propose a novelin-networktask placement strategy aimed at minimizing the edge network resources usage. The proposal specifically accounts fortime-limited reusablecomputing tasks, i.e., tasks whose output can be cached to serve requests from different consumers for a certain time. Caching such results, during their time validity, achieves the twofold benefit of reducing the service provisioning time and improving the edge resource utilization, by avoiding redundant computations and data exchange. The devised strategy is implemented as a network application of a Software-defined Networking Controller in charge of overseeing the edge domain. We formulate the optimal task placement through an integer linear programming problem, and we define an efficient heuristic algorithm that well approximates the solution achieved through a standard optimal solver. Achieved results show that the proposal successfully meets the targeted objectives in a wide variety of simulated scenarios, by outperforming benchmark solutions.
Marica Amadeo, Claudia Campolo, Gianmarco Lia, Antonella Molinaro, Giuseppe Ruggeri
IEEE Trans. Mob. Comput.3
2022 In-network placement of delay-constrained computing tasks in a softwarized intelligent edge
Gianmarco Lia, Marica Amadeo, Giuseppe Ruggeri, Claudia Campolo, Antonella Molinaro, Valeria Loscrì
Comput. Networks1