Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Supporting Reliable Transactional Business Processes by Publish/Subscribe Techniques
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
Self-organizing broker topologies for publish/subscribe systems
Proceedings of the 2007 ACM symposium on Applied computing
Adapting publish-subscribe routing to traffic demands
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Transactions in Content-Based Publish/Subscribe Middleware
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
A distributed service-oriented architecture for business process execution
ACM Transactions on the Web (TWEB)
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Publisher Placement Algorithms in Content-Based Publish/Subscribe
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Foundations for Highly Available Content-Based Publish/Subscribe Overlays
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Minimum maximum-degree publish-subscribe overlay network design
IEEE/ACM Transactions on Networking (TON)
Reconfiguration Primitives for Self-Adapting Overlays in Distributed Publish-Subscribe Systems
SASO '12 Proceedings of the 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems
| Hi-index | 0.00 |
Mission-critical distributed applications, such as Internet advertising platforms, increasingly utilize distributed publish/subscribe systems as a messaging substrate for information dissemination. These applications require low latency performance from the substrate, as the timely delivery of messages can have a direct impact on revenue. The cost of managing and operating distributed publish/subscribe systems, however, can be prohibitive due to system size and scale. It is, therefore, critical to derive low latency message delivery from a minimal set of system resources. To this end, this paper presents a solution for designing low latency, minimal-broker overlay networks for content-based publish/subscribe systems. The solution is developed in two parts. First, a framework is developed to quantify the similarity of entities in content-based publish/subscribe systems. Second, algorithms are presented for designing overlays that utilize a minimal number of brokers in order to provide low latency performance at reduced cost.