@inproceedings{f2c304f792774754b90f3f5cdaa84b1e,

title = "Brief announcement: Constructing fault-tolerant overlay networks for topic-based publish/subscribe",

abstract = "We incorporate fault tolerance in designing reliable and scalable overlay networks to support topic-based pub/sub communication. We propose the M in Avg-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 M in Avg-kTCO and show a lower-bound for the hardness of its approximation. With regard to M in Avg-2TCO, we present GM2, the first polynomial time algorithm with an approximation ratio. With regards to M in Avg-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 GM 2 and HararyPT under representative pub/sub workloads.",

keywords = "Overlay networks, Publish/subscribe, Reliability",

author = "Chen Chen and Roman Vitenberg and Jacobsen, {Hans Arno}",

year = "2013",

doi = "10.1145/2484239.2484292",

language = "English",

isbn = "9781450320658",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "184--186",

booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",

note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",

}