Chen Chen
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.
- C. Chen, R. Vitenberg, and H.-A. Jacobsen. A generalized algorithm for publish/subscribe overlay design and its fast implementation. In DISC, 2012. Google Scholar
Digital Library
- C. Chen, R. Vitenberg, and H.-A. Jacobsen. Constructing fault-tolerant overlay networks for topic-based pub/sub. Technical report, U. of Toronto & U. of Oslo, 2013. http://msrg.org/papers/TR-kTCO.Google Scholar
- G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg. Spidercast: A scalable interest-aware overlay for topic-based pub/sub communication. In DEBS'07. Google ScholarDigital Library
- G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg. Constructing scalable overlays for pub-sub with many topics: Problems, algorithms, and evaluation. In PODC, 2007. Google ScholarDigital Library
Index Terms
- Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe
Recommendations
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architecturesDesigning an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in ...
Survey On reliability in publish/subscribe services
Modern large-scale mission-critical systems demand efficient and robust multi-point data dissemination infrastructures. Since such infrastructures have to exhibit good performance when scaling up the number of interacting entities and managing large ...
Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design
Publish/subscribe communication systems where nodes subscribe to many different topics of interest are becoming increasingly more common. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem ...
Comments