Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe

Authors:
Chen Chen;Roman Vitenberg;Hans-Arno Jacobsen
Affiliations:
University of Toronto, Toronto, Canada;University of Oslo, Oslo, Norway;University of Toronto, Toronto, Canada
Venue:
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Year:
2013

Citing 3
Cited 0

SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication

Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Constructing scalable overlays for pub-sub with many topics

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A generalized algorithm for publish/subscribe overlay design and its fast implementation

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We incorporate fault tolerance in designing reliable and scalable overlay networks to support topic-based pub/sub communication. We propose the MinAvg- kTCO problem parameterized by k: use the minimum number of edges to create a k-topic-connected overlay (kTCO) for pub/sub systems, i.e., for each topic the sub-overlay induced by nodes interested in the topic is k-connected. We prove the NP-completeness of MinAvg-kTCO and show a lower-bound for the hardness of its approximation. With regard to MinAvg-2TCO, we present GM2, the first polynomial time algorithm with an approximation ratio. With regards to MinAvg-kTCO, where k ≥ 2, we propose a simple and efficient heuristic algorithm, namely HararyPT, that aligns nodes across different sub-overlays. We experimentally demonstrate the scalability of GM2 and HararyPT under representative pub/sub workloads.