Constructing scalable overlays for pub-sub with many topics

DOI10.1145/1281100.1281118zbMath1283.68051MaRDI 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 problems; overlay networks; peer-to-peer; application-level multicast; pub/sub

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

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