Luca Baldesi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luca Baldesi has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Renato Lo Cigno
University of Brescia
6 shared publications Leonardo Maccari
Ca' Foscari University of Venice,Italy
5 shared publications- Leonardo Maccari
Department of Information Engineering and Computer Science, Universit Ca Foscari Venezia, Venice, Italy
3 shared publications Athina Markopoulou
Department of Electrical Engineering and Computer Science, University of California at Irvine, Irvine, CA 92697-2800 USA
2 shared publications- Athina Markopoulou
University of California Irvine
2 shared publications - Carter Tribley Butts
Departments of Sociology, University of California Irvine, Irvine, CA, USA
2 shared publications
Latest Publications
- Open Access
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 558-577
From Voice to Ads: Auditing Commercial Smart Speakers for Targeted Advertising based on Voice Characteristics
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 558-577
Open AccessFrom Voice to Ads: Auditing Commercial Smart Speakers for Targeted Advertising based on Voice Characteristics
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 816-823
Improving BGP Convergence with Fed4FIRE+ Experiments
The Border Gateway Protocol (BGP) is the single routing protocol that glues the Internet together. Its performance, especially the convergence speed after path changes, is key to global efficiency, also in light of the fact that the number of Autonomous Systems (ASes) and Subnets has reached a level that makes path changes a frequent event. This work presents a testbed-based experimental analysis of BGP convergence time under different hypothesis of Minimum Route Advertisement Interval (MRAI) setting and a proposal to improve it by setting MRAI based on the topological position of the ASes. MRAI is a timer that regulates the frequency of successive UPDATE messages sent by a BGPs router for a given route and destination. The work is based on the modifications of the BIRD BGP daemon and shows that it is possible to execute experiments on testbeds with topologies that have Internet-like characteristics scaling up to thousands of ASes.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 816-823
Improving BGP Convergence with Fed4FIRE+ Experiments
The Border Gateway Protocol (BGP) is the single routing protocol that glues the Internet together. Its performance, especially the convergence speed after path changes, is key to global efficiency, also in light of the fact that the number of Autonomous Systems (ASes) and Subnets has reached a level that makes path changes a frequent event. This work presents a testbed-based experimental analysis of BGP convergence time under different hypothesis of Minimum Route Advertisement Interval (MRAI) setting and a proposal to improve it by setting MRAI based on the topological position of the ASes. MRAI is a timer that regulates the frequency of successive UPDATE messages sent by a BGPs router for a given route and destination. The work is based on the modifications of the BIRD BGP daemon and shows that it is possible to execute experiments on testbeds with topologies that have Internet-like characteristics scaling up to thousands of ASes.
- Open Access
- 1 February 2020
- Published by Elsevier in Computer Communications
- Vol. 151, 216-226
Infective flooding in low-duty-cycle networks, properties and bounds
- 1 February 2020
- Published by Elsevier in Computer Communications
- Vol. 151, 216-226
Open AccessInfective flooding in low-duty-cycle networks, properties and bounds
- 23 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 27 (5) , 2125-2136
Spectral Graph Forge: A Framework for Generating Synthetic Graphs With a Target Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
- 23 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 27 (5) , 2125-2136
Spectral Graph Forge: A Framework for Generating Synthetic Graphs With a Target Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1727-1735
Spectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1727-1735
Spectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
- Open Access
Spectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
Open AccessSpectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approach leverages the fact that the spectral structure of matrix representations of a graph encodes global information about community structure. The Spectral Graph Forge uses a low-rank approximation of the modularity matrix to generate synthetic graphs that match a target modularity within user-selectable degree of accuracy, while allowing other aspects of structure to vary. We show that the Spectral Graph Forge outperforms state-of-the-art techniques in terms of accuracy in targeting the modularity and randomness of the realizations, while also preserving other local structural properties and node attributes. We discuss extensions of the Spectral Graph Forge to target other properties beyond modularity, and its applications to anonymization.
- 1 December 2017
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 42, 335-350
Optimized P2P streaming for wireless distributed networks
- 1 December 2017
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 42, 335-350
Optimized P2P streaming for wireless distributed networks
- Open Access
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 350-358
Optimized cooperative streaming in wireless mesh networks
Peer-to-peer video streaming is a valuable technique to reduce the overhead produced by centralized and unicast-based video streaming. Key to the efficiency of a peer-to-peer approach is the optimization of the logical distribution topology (the overlay with respect to the underlying network, the underlay). This work studies peer-to-peer streaming in wireless mesh networks for which the underlay is known. We propose an optimized, cross-layer approach to build the peer-to-peer distribution overlay minimizing the impact on the underlay. We design an optimal strategy, which is proven to be NP-complete, and thus not solvable with a distributed, light weight protocol. The optimal strategy is relaxed exploiting the knowledge of the betweenness centrality of the underlay nodes, obtaining two easily implementable solutions applicable to any link-state routing protocol. Simulation and emulation results (experimenting with real applications on a network emulated with the Mininet framework) support the theoretical findings, showing that the relaxed implementations are reasonably close to the optimal solution, and provide vast gains compared to the traditional overlay topology based on Erdos-Renyi models that a peer-to-peer application would build.
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 350-358
Open AccessOptimized cooperative streaming in wireless mesh networks
Peer-to-peer video streaming is a valuable technique to reduce the overhead produced by centralized and unicast-based video streaming. Key to the efficiency of a peer-to-peer approach is the optimization of the logical distribution topology (the overlay with respect to the underlying network, the underlay). This work studies peer-to-peer streaming in wireless mesh networks for which the underlay is known. We propose an optimized, cross-layer approach to build the peer-to-peer distribution overlay minimizing the impact on the underlay. We design an optimal strategy, which is proven to be NP-complete, and thus not solvable with a distributed, light weight protocol. The optimal strategy is relaxed exploiting the knowledge of the betweenness centrality of the underlay nodes, obtaining two easily implementable solutions applicable to any link-state routing protocol. Simulation and emulation results (experimenting with real applications on a network emulated with the Mininet framework) support the theoretical findings, showing that the relaxed implementations are reasonably close to the optimal solution, and provide vast gains compared to the traditional overlay topology based on Erdos-Renyi models that a peer-to-peer application would build.
- 1 December 2015
- Published by Elsevier in Computer Networks
- Vol. 93, 389-403
Improving P2P streaming in Wireless Community Networks
- 1 December 2015
- Published by Elsevier in Computer Networks
- Vol. 93, 389-403
Improving P2P streaming in Wireless Community Networks
- Open Access
- 18 May 2015
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Live Video Streaming for Community Networks, Experimenting with PeerStreamer on the Ninux Community
Networks, due to the affinity to both technical and social characteristics of such networks. It can help binding together communities, it provides a good means for inclusion of people as well to deliver information and local events. Video streaming in community networks is still problematic; this work describes a project for the adaptation of PeerStreamer, an open source peer-to-peer video streaming platform, to an existing Community Network in the city of Florence, Italy. The paper exposes the motivations that make PeerStreamer a perfect match with the philosophy and the technical features of a community network and describes how the community network of Florence can be a very good testbed given the mixture of technical and social skills that animate it. The proposed adaptation and implementation exploits a so-far underused feature of PeerStreamer: the possibility of separating the streaming engine from the play-out part on different hosts. This feature makes it possible to install the streaming engine, which is very efficient and has a very small memory footprint, directly on the community network routing nodes, so that the streaming topology can be adapted to the community network topology by directly accessing routing information. On the other hand, the player can run on standard PCs and use standard streaming protocols to access the stream.
- 18 May 2015
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessLive Video Streaming for Community Networks, Experimenting with PeerStreamer on the Ninux Community
Networks, due to the affinity to both technical and social characteristics of such networks. It can help binding together communities, it provides a good means for inclusion of people as well to deliver information and local events. Video streaming in community networks is still problematic; this work describes a project for the adaptation of PeerStreamer, an open source peer-to-peer video streaming platform, to an existing Community Network in the city of Florence, Italy. The paper exposes the motivations that make PeerStreamer a perfect match with the philosophy and the technical features of a community network and describes how the community network of Florence can be a very good testbed given the mixture of technical and social skills that animate it. The proposed adaptation and implementation exploits a so-far underused feature of PeerStreamer: the possibility of separating the streaming engine from the play-out part on different hosts. This feature makes it possible to install the streaming engine, which is very efficient and has a very small memory footprint, directly on the community network routing nodes, so that the streaming topology can be adapted to the community network topology by directly accessing routing information. On the other hand, the player can run on standard PCs and use standard streaming protocols to access the stream.