Constructing scalable overlays for pub-sub with many topics

DOI10.1145/1281100.1281118zbMath1283.68051OpenAlexW2049693545MaRDI QIDQ5401399

Roie Melamed, Y. Tock, Gregory Chockler, Roman Vitenberg

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281118

zbMATH Keywords

optimization problemsoverlay networkspeer-to-peerapplication-level multicastpub/sub

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

On the approximability and hardness of minimum topic connected overlay and its special instances, Online and Approximate Network Construction from Bounded Connectivity Constraints, A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem, Online and approximate network construction from bounded connectivity constraints, Confidential gossip, Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem, Network construction with subgraph connectivity constraints, Overlaying a hypergraph with a graph with bounded maximum degree, An improved flow-based formulation and reduction principles for the minimum connectivity inference problem, Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles, Unnamed Item