Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Exactly-once Delivery in a Content-based Publish-Subscribe System
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Corona: a high performance publish-subscribe system for the world wide web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Semantic peer-to-peer overlays for publish/subscribe networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
FeedTree: sharing web micronews with peer-to-peer event notification
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Fleet: An Effective System for Publish/Subscribe Service over P2P Networks
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Towards efficient event aggregation in a decentralized publish-subscribe system
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Storing and accessing live mashup content in the cloud
ACM SIGOPS Operating Systems Review
Magnet: practical subscription clustering for Internet-scale publish/subscribe
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
StAN: exploiting shared interests without disclosing them in gossip-based publish/subscribe
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Dynamically reconfigurable filtering architectures
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Ripple: A publish/subscribe service for multidata item updates propagation in the cloud
Journal of Network and Computer Applications
On the hardness and approximation of minimum topic-connected overlay
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the approximability of minimum topic connected overlay and its special instances
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Minimum maximum-degree publish-subscribe overlay network design
IEEE/ACM Transactions on Networking (TON)
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
A generalized algorithm for publish/subscribe overlay design and its fast implementation
DISC'12 Proceedings of the 26th international conference on Distributed Computing
PolderCast: fast, robust, and scalable architecture for P2P topic-based pub/sub
Proceedings of the 13th International Middleware Conference
Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe
Proceedings of the 2013 ACM symposium on Principles of distributed computing
The hidden pub/sub of spotify: (industry article)
Proceedings of the 7th ACM international conference on Distributed event-based systems
DYNATOPS: a dynamic topic-based publish/subscribe architecture
Proceedings of the 7th ACM international conference on Distributed event-based systems
Piggybacking on social networks
Proceedings of the VLDB Endowment
Minimal broker overlay design for content-based publish/subscribe systems
CASCON '13 Proceedings of the 2013 Conference of the Center for Advanced Studies on Collaborative Research
| Hi-index | 0.00 |
We investigate the problem of designing a scalable overlay network to support decentralized topic-based pub/sub communication. We introduce a new optimization problem, called Minimum Topic-Connected Overlay (Min-TCO), that captures the tradeoff between the scalability of the overlay (in terms of the nodes' fanout) and the message forwarding overhead incurred by the communicating parties. Roughly, the Min-TCO problem is as follows: Given a collection of nodes and their subscriptions, connect the nodes using the minimum possible number of edges so that for each topic t, a message published on t could reach all the nodes interested in t by being forwarded by onlythe nodes interested in t. We show that the decision version of Min-TCO is NP-complete, and present a polynomial algorithm that approximates the optimal solution within a logarithmic factor with respect to the number of edges in theconstructed overlay. We further prove that this approximation ratio is almost tight by showing that no polynomial algorithm can approximate Min-TCO within a constant factor (unless P=NP). We show experimentally that on typical inputs, the fanout of the overlay constructed by our approximation algorithm is significantly lower thanthat of the overlays built by the existing algorithms, and that its running time is just a small fraction of the analytical worst case bound. As Min-TCO can be shown to capture several important aspects of most known overlay-based pub/sub implementations, our study sheds light on the inherent limitations of the existing systems as well asprovides an insight into the best possible feasible solution. Finally, we introduce a flexible framework that generalizes Min-TCO and formalizes most similar overlay design problems that occur in scalable pub/sub systems. We also briefly discuss several examples of such problems, and show some results with respect to their complexity.