extended-abstract

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

Authors:

Chen Chen,

Roman Vitenberg,

Hans-Arno JacobsenAuthors Info & Claims

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

Pages 184 - 186

https://doi.org/10.1145/2484239.2484282

Published: 22 July 2013 Publication History

Get Access

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.

References

[1]

C. Chen, R. Vitenberg, and H.-A. Jacobsen. A generalized algorithm for publish/subscribe overlay design and its fast implementation. In DISC, 2012.

Digital Library

Google Scholar

[2]

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

[3]

G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg. Spidercast: A scalable interest-aware overlay for topic-based pub/sub communication. In DEBS'07.

Digital Library

Google Scholar

[4]

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.

Digital Library

Google Scholar

Cited By

View all

Chen CVitenberg RJacobsen H(2022)Building Fault-Tolerant Overlays With Low Node Degrees for Topic-Based Publish/SubscribeIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.308028119:5(3011-3023)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TDSC.2021.3080281
Chen CTock YJayaram KKozuch M(2015)Design of Routing Protocols and Overlay Topologies for Topic-based Publish/Subscribe on Small-World NetworksProceedings of the Industrial Track of the 16th International Middleware Conference10.1145/2830013.2830017(1-7)Online publication date: 7-Dec-2015
https://dl.acm.org/doi/10.1145/2830013.2830017
Chen CTock YJacobsen HVitenberg R(2015)Weighted Overlay Design for Topic-Based Publish/Subscribe Systems on Geo-Distributed Data Centers2015 IEEE 35th International Conference on Distributed Computing Systems10.1109/ICDCS.2015.55(474-485)Online publication date: Jun-2015
https://doi.org/10.1109/ICDCS.2015.55

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 architectures

Designing 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

Information & Contributors

Information

Published In

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

July 2013

422 pages

ISBN:9781450320658

DOI:10.1145/2484239

General Chair:
Panagiota Fatourou
FORTH ICS & University of Crete, Greece
,
Program Chair:
Gadi Taubenfeld
IDC, Israel

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 July 2013

Check for updates

Author Tags

Qualifiers

Extended-abstract

Conference

PODC '13

Sponsor:

PODC '13: ACM Symposium on Principles of Distributed Computing

July 22 - 24, 2013

Québec, Montréal, Canada

Acceptance Rates

PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
145
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen CVitenberg RJacobsen H(2022)Building Fault-Tolerant Overlays With Low Node Degrees for Topic-Based Publish/SubscribeIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.308028119:5(3011-3023)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TDSC.2021.3080281
Chen CTock YJayaram KKozuch M(2015)Design of Routing Protocols and Overlay Topologies for Topic-based Publish/Subscribe on Small-World NetworksProceedings of the Industrial Track of the 16th International Middleware Conference10.1145/2830013.2830017(1-7)Online publication date: 7-Dec-2015
https://dl.acm.org/doi/10.1145/2830013.2830017
Chen CTock YJacobsen HVitenberg R(2015)Weighted Overlay Design for Topic-Based Publish/Subscribe Systems on Geo-Distributed Data Centers2015 IEEE 35th International Conference on Distributed Computing Systems10.1109/ICDCS.2015.55(474-485)Online publication date: Jun-2015
https://doi.org/10.1109/ICDCS.2015.55

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design

Survey On reliability in publish/subscribe services

Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations