11 citations · 62 across the 14 of their papers we have counts for
15 papers
Unsupervised Detection and Clustering of Malicious TLS Flows
Gibran Gomez, Platon Kotzias, Matteo Dell'Amico +2
Malware abuses TLS to encrypt its malicious traffic, preventing examination by content signatures and deep packet inspection. Network detection of malicious TLS flows is an importa…
FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance
Matteo Dell'Amico
FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the…
Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First
Matteo Dell'Amico
It is well known that size-based scheduling policies, which take into account job size (i.e., the time it takes to run them), can perform very desirably in terms of both response t…
The Supermarket Model with Known and Predicted Service Times
Michael Mitzenmacher, Matteo Dell'Amico
The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonst…
On Fair Size-Based Scheduling
Matteo Dell'Amico, Damiano Carra, Pietro Michiardi
By executing jobs serially rather than in parallel, size-based scheduling policies can shorten time needed to complete jobs; however, major obstacles to their applicability are fai…
PSBS: Practical Size-Based Scheduling
Matteo Dell'Amico, Damiano Carra, Pietro Michiardi
Size-based schedulers have very desirable performance properties: optimal or near-optimal response time can be coupled with strong fairness guarantees. Despite this, such systems a…
On User Availability Prediction and Network Applications
Matteo Dell'Amico, Maurizio Filippone, Pietro Michiardi +1
User connectivity patterns in network applications are known to be heterogeneous, and to follow periodic (daily and weekly) patterns. In many cases, the regularity and the correlat…
Revisiting Size-Based Scheduling with Estimated Job Sizes
Matteo Dell'Amico, Damiano Carra, Mario Pastorelli +1
We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to…
OS-Assisted Task Preemption for Hadoop
Mario Pastorelli, Matteo Dell'Amico, Pietro Michiardi
This work introduces a new task preemption primitive for Hadoop, that allows tasks to be suspended and resumed exploiting existing memory management mechanisms readily available in…
A Simulator for Data-Intensive Job Scheduling
Matteo Dell'Amico
Despite the fact that size-based schedulers can give excellent results in terms of both average response times and fairness, data-intensive computing execution engines generally do…
Practical Size-based Scheduling for MapReduce Workloads
Mario Pastorelli, Antonio Barbuzzi, Damiano Carra +2
We present the Hadoop Fair Sojourn Protocol (HFSP) scheduler, which implements a size-based scheduling discipline for Hadoop. The benefits of size-based scheduling disciplines are…
Adaptive Redundancy Management for Durable P2P Backup
Matteo Dell'Amico, Pietro Michiardi, Laszlo Toka +1
We design and analyze the performance of a redundancy management mechanism for Peer-to-Peer backup applications. Armed with the realization that a backup system has peculiar requir…
Back To The Future: On Predicting User Uptime
Matteo Dell'Amico, Pietro Michiardi, Yves Roudier
Correlation in user connectivity patterns is generally considered a problem for system designers, since it results in peaks of demand and also in the scarcity of resources for peer…
On Scheduling and Redundancy for P2P Backup
Laszlo Toka, Matteo Dell'Amico, Pietro Michiardi
An online backup system should be quick and reliable in both saving and restoring users' data. To do so in a peer-to-peer implementation, data transfer scheduling and the amount of…
Measuring Password Strength: An Empirical Analysis
Matteo Dell'Amico, Pietro Michiardi, Yves Roudier
We present an in-depth analysis on the strength of the almost 10,000 passwords from users of an instant messaging server in Italy. We estimate the strength of those passwords, and…