A generalized algorithm for publish/subscribe overlay design and its fast implementation

DOI10.1007/978-3-642-33651-5_6MaRDI QIDQ4909403zbMATH OpenOpenAlexFDO

Authors Chen Chen, Roman Vitenberg, H.-Arno Jacobsen

Publication date 13 March 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.3365

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Constructing scalable overlays for pub-sub with many topics
• Designing Overlapping Networks for Publish-Subscribe Systems
• On the approximability and hardness of minimum topic connected overlay and its special instances
• On the approximability of minimum topic connected overlay and its special instances
• Algorithms for overlay networks.

Cited in

(7)

• Fast and efficient publish/subscribe routing algorithm based on message listening
• On the approximability of minimum topic connected overlay and its special instances
• On the approximability and hardness of minimum topic connected overlay and its special instances
• scientific article; zbMATH DE number 1982690 (Why is no real title available?)
• Designing Overlapping Networks for Publish-Subscribe Systems
• Constructing scalable overlays for pub-sub with many topics
• A \(O(\log n)\) distributed algorithm to construct routing structures for pub/sub systems. Regular submission

This page was built for publication: A generalized algorithm for publish/subscribe overlay design and its fast implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909403)