Computer Science – Databases
Scientific paper
2009-07-16
Computer Science
Databases
Scientific paper
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to track users with the largest deviation from the norm (outliers), for some measure of performance. Taking a stream-computing perspective, we can think of each user's performance profile as a stream of numbers (such as response times), and the aggregate performance profile of the shared infrastructure as a "braid" of these intermixed streams. The monitoring system's goal then is to untangle this braid sufficiently to track the top k outliers. This paper investigates the space complexity of one-pass algorithms for approximating outliers of this kind, proves lower bounds using multi-party communication complexity, and proposes small-memory heuristic algorithms. On one hand, stream outliers are easily tracked for simple measures, such as max or min, but our theoretical results rule out even good approximations for most of the natural measures such as average, median, or the quantiles. On the other hand, we show through simulation that our proposed heuristics perform quite well for a variety of synthetic data.
Buragohain Chiranjeeb
Foschini Luca
Suri Subhash
No associations
LandOfFree
Untangling the Braid: Finding Outliers in a Set of Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Untangling the Braid: Finding Outliers in a Set of Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Untangling the Braid: Finding Outliers in a Set of Streams will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-109889