Francesco LO PRESTI

Prof. Francesco LO PRESTI

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2002 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
FPFrancesco LO PRESTI
Francesco LO PRESTI
NDN.G. Duffield
N.G. Duffield
JHJ. Horowitz
J. Horowitz
DTD. Towsley
D. Towsley
Packet delay greatly influences the overall performance of network applications. It is therefore important to identify causes and locations of delay performance degradation within a network. Existing techniques, largely based on end-to-end delay measurements of unicast traffic, are well suited to monitor and characterize the behavior of particular end-to-end paths. Within these approaches, however, it is not clear how to apportion the variable component of end-to-end delay as queueing delay at each link along a path. Moreover, there are issues of scalability for large networks. In this paper, we show how end-to-end measurements of multicast traffic can be used to infer the packet delay distribution and utilization on each link of a logical multicast tree. The idea, recently introduced in Caceres et al. (1999), is to exploit the inherent correlation between multicast observations to infer performance of paths between branch points in a tree spanning a multicast source and its receivers. The method does not depend on cooperation from intervening network elements; because of the bandwidth efficiency of multicast traffic, it is suitable for large-scale measurements of both end-to-end and internal network dynamics. We establish desirable statistical properties of the estimator, namely consistency and asymptotic normality. We evaluate the estimator through simulation and observe that it is robust with respect to moderate violations of the underlying model.

9 April 2015 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
VCValeria Cardellini
Valeria Cardellini
VPVittoria De Nitto Personé
Vittoria De Nitto Personé
VVValerio Di Valerio
Valerio Di Valerio
FFFrancisco Facchinei
Francisco Facchinei
VGVincenzo Grassi
Vincenzo Grassi
VPVeronica Piccialli
Veronica Piccialli

7 August 2002 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NDN.G. Duffield
N.G. Duffield
JHJ. Horowitz
J. Horowitz
FPFrancesco LO PRESTI
Francesco LO PRESTI
DTD. Towsley
D. Towsley
The use of multicast inference on end-to-end measurement has been proposed as a means to infer network internal characteristics such as packet link loss rate and delay. We propose three types of algorithm that use loss measurements to infer the underlying multicast topology: (i) a grouping estimator that exploits the monotonicity of loss rates with increasing path length; (ii) a maximum-likelihood estimator (MLE); and (iii) a Bayesian estimator. We establish their consistency, compare their complexity and accuracy, and analyze the modes of failure and their asymptotic probabilities.

1 September 2012 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
VCValeria Cardellini
Valeria Cardellini
ECEmiliano Casalicchio
Emiliano Casalicchio
VGVincenzo Grassi
Vincenzo Grassi
SIStefano Iannucci
Stefano Iannucci
FPFrancesco LO PRESTI
Francesco LO PRESTI
RMRaffaela Mirandola
Raffaela Mirandola
Architecting software systems according to the service-oriented paradigm and designing runtime self-adaptable systems\ud are two relevant research areas in today’s software engineering. In this paper, we address issues that lie at the intersection of these two important fields. First, we present a characterization of the problem space of self-adaptation for service-oriented systems, thus providing a frame of reference where our and other approaches can be classified. Then, we present MOSES, a methodology and a software tool implementing it to support QoS-driven adaptation of a service-oriented system. It works in a specific region of the identified problem space, corresponding to the scenario where a service-oriented system architected as a composite service needs to sustain a traffic of requests generated by several users. MOSES integrates within a unified framework different adaptation mechanisms. In this way it achieves greater flexibility in facing various operating environments and the possibly conflicting QoS requirements of several concurrent users. Experimental results obtained with a prototype implementation of MOSES show the effectiveness of the proposed approach

13 June 2016
Verified
Conference Paper
Open access
PDF file
VCValeria Cardellini
Valeria Cardellini
VGVincenzo Grassi
Vincenzo Grassi
FPFrancesco LO PRESTI
Francesco LO PRESTI
MNMatteo Nardelli
Matteo Nardelli
Data Stream Processing (DSP) applications are widely used to timely extract information from distributed data sources, such as sensing devices, monitoring stations, and social networks. To successfully handle this ever increasing amount of data, recent trends investigate the possibility of exploiting decentralized computational resources (e.g., Fog computing) to define the applications placement. Several placement policies have been proposed in the literature, but they are based on different assumptions and optimization goals and,\ud as such, they are not completely comparable to each other. In this paper we study the placement problem for distributed DSP applications. Our contributions are twofold.\ud We provide a general formulation of the optimal DSP placement (for short, ODP) as an Integer Linear Programming\ud problem which takes explicitly into account the heterogeneity of computing and networking resources and which encompasses - as special cases - the different solutions proposed in the literature. We present an ODP-based scheduler for the Apache Storm DSP framework. This allows us to compare some well-known centralized and decentralized placement solutions. We also extensively analyze the ODP scalability with respect to various parameter settings

1 May 2000 in IEEE Communications Magazine
Verified
Journal Article
Closed access
AAA. Adams
A. Adams
TBTian Bu
Tian Bu
TFT. Friedman
T. Friedman
JHJ. Horowitz
J. Horowitz
DTD. Towsley
D. Towsley
VPV. Paxson
V. Paxson