Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
G-ToPSS: fast filtering of graph-based metadata
WWW '05 Proceedings of the 14th international conference on World Wide Web
Self-organizing broker topologies for publish/subscribe systems
Proceedings of the 2007 ACM symposium on Applied computing
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
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
Adaptive content-based routing in general overlay topologies
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
A distributed service-oriented architecture for business process execution
ACM Transactions on the Web (TWEB)
Fast low degree connectivity of ad-hoc networks via percolation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Magnet: practical subscription clustering for Internet-scale publish/subscribe
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Scaling Construction of Low Fan-out Overlays for Topic-Based Publish/Subscribe Systems
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Semantic peer-to-peer overlays for publish/subscribe networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
It is a challenging and fundamental problem to construct the underlying overlay network to support efficient and scalable information distribution in topic-based publish/subscribe systems. Existing overlay design algorithms aim to minimize the node fan-out while building topic-connected overlays, in which all nodes interested in the same topic are organized in a directly connected dissemination sub-overlay. However, most state-of-the-art algorithms suffer from high computational complexity, such as O(|V|4|T|), where V is the node set and T is the topic set. We devise a general indexing data structure that provides a significantly faster implementation, with O(|V|2|T|) running time, for different state-of-the-art algorithms. The generality of the indexing data structure is due to the fact that it enables edge lookup by both node degree and edge contribution, a central metric in all existing algorithms. When tested on typical pub/sub workloads, the speedup observed was by a factor of over 1 000, thereby rendering the algorithms more suitable for practical use. For example, under a typically Zipf distributed pub/sub workload, with 1 000 nodes and 100 topics, our new implementation completes in 3.823 seconds, while the previous alternative takes over 555 minutes.