Distributed spectral cluster management

Abstract

In recent years peer-to-peer (P2P) networking has gained high popularity for large-scale content distribution. Prominent systems expect a large user base with rather diversified demands. Yet it is highly challenging to achieve scalability without sacrificing the expressiveness of queries in such systems. This paper proposes distributed spectral cluster management, an approach which adapts the techniques from spectral graph theory to work in distributed settings. The proposed approach is applied to content-based publish/subscribe to i) significantly reduce the cost for event dissemination by clustering subscribers exploiting the similarity of events, ii) preserve the expressiveness of the subscription language, and iii) perform robustly in the presence of workload variations. The evaluations analyze the accuracy of the proposed distributed spectral mechanisms and show their effectiveness to significantly reduce the efforts to disseminate events under many practical workloads.

JetStream: Enabling high throughput live event streaming on multi-site clouds

“…Many current concepts used for cloud event streaming are inherited from P2P systems. These can be divided in two categories based on how peers that forward the events organize themselves in an overlay network [29]: some use DHT overlays [30,31] and others group the subscribers in interest groups based on event semantics [32,33]. While the performance of the former is highly sensitive to the organization of the peers, the latter can improve the performance by sharing common events within the interest group.…”