Luciano Lenzini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luciano Lenzini has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Enzo Mingozzi
University of Pisa
7 shared publications - Claudio Cicconetti
National Research Council Institute of Informatics and Telematics, Pisa, Italy
5 shared publications - Andrea Lodi
Cornell Tech and Technion–IIT
3 shared publications - Michele Monaci
DEI, University of Bologna, Bologna, Italy
3 shared publications - Silvano Martello
DEI “Guglielmo Marconi”, Alma Mater Studiorum Università di Bologna, Bologna, Italy
3 shared publications - A. Erta
IMT Lucca Institute for Advanced Studies and Fluidmesh Networks Inc., Italy
2 shared publications
Latest Publications
- Open Access
Evolution of the Internet k-dense structure
As the Internet AS-level topology grows over time, some of its structural properties remain unchanged. Such time- invariant properties are generally interesting, because they tend to reflect some fundamental processes or constraints behind Internet growth. As has been shown before, the time-invariant structural properties of the Internet include some most basic ones, such as the degree distribution or clustering. Here we add to this time-invariant list a non-trivial property - k-dense decomposition. This property is derived from a recursive form of edge multiplicity, defined as the number of triangles that share a given edge. We show that after proper normalization, the k- dense decomposition of the Internet has remained stable over the last decade, even though the Internet size has approximately doubled, and so has the k-density of its k-densest core. This core consists mostly of content providers peering at Internet eXchange Points, and it only loosely overlaps with the high-degree or high-rank AS core, consisting mostly of tier-1 transit providers. We thus show that high degrees and high k-densities reflect two different Internet-specific properties of ASes (transit versus content providers). As a consequence, even though degrees and k-densities of nodes are correlated, the relative fluctuations are strong, and related to that, random graphs with the same degree distribution or even degree correlations as in the Internet, do not reproduce its k-dense decomposition. Therefore an interesting open question is what Internet topology models or generators can fully explain or at least reproduce the k-dense properties of the Internet.
Open AccessEvolution of the Internet k-dense structure
As the Internet AS-level topology grows over time, some of its structural properties remain unchanged. Such time- invariant properties are generally interesting, because they tend to reflect some fundamental processes or constraints behind Internet growth. As has been shown before, the time-invariant structural properties of the Internet include some most basic ones, such as the degree distribution or clustering. Here we add to this time-invariant list a non-trivial property - k-dense decomposition. This property is derived from a recursive form of edge multiplicity, defined as the number of triangles that share a given edge. We show that after proper normalization, the k- dense decomposition of the Internet has remained stable over the last decade, even though the Internet size has approximately doubled, and so has the k-density of its k-densest core. This core consists mostly of content providers peering at Internet eXchange Points, and it only loosely overlaps with the high-degree or high-rank AS core, consisting mostly of tier-1 transit providers. We thus show that high degrees and high k-densities reflect two different Internet-specific properties of ASes (transit versus content providers). As a consequence, even though degrees and k-densities of nodes are correlated, the relative fluctuations are strong, and related to that, random graphs with the same degree distribution or even degree correlations as in the Internet, do not reproduce its k-dense decomposition. Therefore an interesting open question is what Internet topology models or generators can fully explain or at least reproduce the k-dense properties of the Internet.
- Open Access
Efficient handoff for mass transit connectivity using IEEE 802.11
In the recent years, WiFi standard has been used to develop different kind of wireless networks due to its flexibility and the availability of cheap off the shelf hardware. Even if the standard itself lacks mobility support, it has been used in networks with mobile nodes. When mobility is involved, a fast handoff is of paramount importance, especially with multimedia applications. The current IEEE 802.11 standard does not provide any specification about how the handoff should take place. In this paper we propose a handoff scheme optimized for networks providing wireless connection to mass transit vehicles. The structure of the procedure is redesigned to minimize delay as well as assure reliability. A reliable handoff triggering mechanism is also designed exploiting the results obtained from a set of preliminary outdoor experiments. The proposed scheme was implemented and deployed in an experimental testbed, and several indoor tests were run in order to demonstrate its reliability and efficiency.
Open AccessEfficient handoff for mass transit connectivity using IEEE 802.11
In the recent years, WiFi standard has been used to develop different kind of wireless networks due to its flexibility and the availability of cheap off the shelf hardware. Even if the standard itself lacks mobility support, it has been used in networks with mobile nodes. When mobility is involved, a fast handoff is of paramount importance, especially with multimedia applications. The current IEEE 802.11 standard does not provide any specification about how the handoff should take place. In this paper we propose a handoff scheme optimized for networks providing wireless connection to mass transit vehicles. The structure of the procedure is redesigned to minimize delay as well as assure reliability. A reliable handoff triggering mechanism is also designed exploiting the results obtained from a set of preliminary outdoor experiments. The proposed scheme was implemented and deployed in an experimental testbed, and several indoor tests were run in order to demonstrate its reliability and efficiency.
- 3 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 22 (5) , 1645-1658
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA
In IEEE 802.16, the wireless resources are logically partitioned into 5-ms frames, which extend in two dimensions: time and frequency. To break down the complexity of resource allocation at the base station, a split approach has been proposed in the literature, where the tasks of scheduling packets and allocating them into frames are solved in separate and subsequent stages. In this paper, we focus on the allocation task alone, which is addressed in its full complexity, i.e., by considering that data within the frame must be allocated as bursts with rectangular shape, each consisting of a set of indivisible sub-bursts, and that a variable portion of the frame is reserved for in-band signaling. After proving that the resulting allocation problem is NP-hard, we develop an efficient heuristic algorithm, called Recursive Tiles and Stripes (ℜTS), to solve it. ℜTS, in addition to handling a more general problem, is shown to perform better than state-of-the-art solutions via numerical analysis with realistic system parametrization. Furthermore, an extensive evaluation of the interaction between the scheduler and the allocator is carried out in a wide variety of network scenarios .
- 3 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 22 (5) , 1645-1658
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA
In IEEE 802.16, the wireless resources are logically partitioned into 5-ms frames, which extend in two dimensions: time and frequency. To break down the complexity of resource allocation at the base station, a split approach has been proposed in the literature, where the tasks of scheduling packets and allocating them into frames are solved in separate and subsequent stages. In this paper, we focus on the allocation task alone, which is addressed in its full complexity, i.e., by considering that data within the frame must be allocated as bursts with rectangular shape, each consisting of a set of indivisible sub-bursts, and that a variable portion of the frame is reserved for in-band signaling. After proving that the resulting allocation problem is NP-hard, we develop an efficient heuristic algorithm, called Recursive Tiles and Stripes (ℜTS), to solve it. ℜTS, in addition to handling a more general problem, is shown to perform better than state-of-the-art solutions via numerical analysis with realistic system parametrization. Furthermore, an extensive evaluation of the interaction between the scheduler and the allocator is carried out in a wide variety of network scenarios .
- Open Access
- 31 January 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (11) , 2301-2312
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
- 31 January 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (11) , 2301-2312
Open AccessOptimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
- 1 January 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (1) , 213-227
k-Dense communities in the Internet AS-level topology graph
- 1 January 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (1) , 213-227
k-Dense communities in the Internet AS-level topology graph
- 9 May 2012
- Published by Springer Nature in Real-Time Systems
- Vol. 48 (5) , 527-569
Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- 9 May 2012
- Published by Springer Nature in Real-Time Systems
- Vol. 48 (5) , 527-569
Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- 1 December 2011
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 57 (12) , 2130-2144
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
We present the result of research, developed within Nokia Siemens Networks, to solve the downlink sub-frame allocation problem in Mobile WiMAX (IEEE 802.16) technology in its full complexity, while simultaneously fulfilling real-life constraints on processing power and delay. We describe the IEEE 802.16 standard, and introduce two system models. A theoretical analysis of the two-dimensional packing problems originated by such models shows that they are both 𝒩𝒫-hard in the strong sense. From a practical point of view, the processing budget for scheduling in the base station was estimated to be 1 ms on a state-of-the-art PC. Thus, we introduce two highly efficient heuristics that were developed to handle the system practically. A thorough computational analysis of their optimization characteristics and a system-level evaluation in realistic scenarios proved that the algorithms offer significant capacity gain in Mobile WiMAX systems that translate to increased operator revenues. This paper was accepted by Dimitris Bertsimas, optimization.
- 1 December 2011
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 57 (12) , 2130-2144
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
We present the result of research, developed within Nokia Siemens Networks, to solve the downlink sub-frame allocation problem in Mobile WiMAX (IEEE 802.16) technology in its full complexity, while simultaneously fulfilling real-life constraints on processing power and delay. We describe the IEEE 802.16 standard, and introduce two system models. A theoretical analysis of the two-dimensional packing problems originated by such models shows that they are both 𝒩𝒫-hard in the strong sense. From a practical point of view, the processing budget for scheduling in the base station was estimated to be 1 ms on a state-of-the-art PC. Thus, we introduce two highly efficient heuristics that were developed to handle the system practically. A thorough computational analysis of their optimization characteristics and a system-level evaluation in realistic scenarios proved that the algorithms offer significant capacity gain in Mobile WiMAX systems that translate to increased operator revenues. This paper was accepted by Dimitris Bertsimas, optimization.
- 29 September 2011
- Published by Springer Nature
- p. 249-255
FLIP-CPM: A Parallel Community Detection Method
- 29 September 2011
- Published by Springer Nature
- p. 249-255
FLIP-CPM: A Parallel Community Detection Method
- 6 August 2011
- Published by Elsevier in Computer Networks
- Vol. 55 (16) , 3680-3693
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC
- 6 August 2011
- Published by Elsevier in Computer Networks
- Vol. 55 (16) , 3680-3693
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC
- 18 July 2011
- Published by Springer Nature
- p. 433-460
Game Based Self-Coexistence Schemes in Cognitive Radio Networks
- 18 July 2011
- Published by Springer Nature
- p. 433-460
Game Based Self-Coexistence Schemes in Cognitive Radio Networks