ACM Transactions on Computer Systems (TOCS)
Building Secure and Reliable Network Applications
Building Secure and Reliable Network Applications
Exactly-once Delivery in a Content-based Publish-Subscribe System
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
A peer-to-peer approach to content-based publish/subscribe
Proceedings of the 2nd international workshop on Distributed event-based systems
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Araneola: A Scalable Reliable Multicast System for Dynamic Environments
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Content-Based Publish-Subscribe over Structured Overlay Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
GoCast: Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication
DSN '05 Proceedings of the 2005 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
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
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
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
Interest clustering techniques for efficient event routing in large-scale settings
Proceedings of the second international conference on Distributed event-based systems
Dynamic content-based channels: meeting in the middle
Proceedings of the second international conference on Distributed event-based systems
Concept-Based Routing in Ad-Hoc Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Toward a cloud computing research agenda
ACM SIGACT News
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Joint interest- and locality-aware content dissemination in social networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
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
Ripple: A publish/subscribe service for multidata item updates propagation in the cloud
Journal of Network and Computer Applications
Parametric subscriptions for content-based publish/subscribe networks
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
COPSS: An Efficient Content Oriented Publish/Subscribe System
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Minimum maximum-degree publish-subscribe overlay network design
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
On leveraging social relationships for decentralized privacy-preserving group communication
Proceedings of the Fifth Workshop on Social Network Systems
Towards robust and scalable peer-to-peer social networks
Proceedings of the Fifth Workshop on Social Network Systems
RCourse: a robustness benchmarking suite for publish/subscribe overlay simulations with Peersim
Proceedings of the First Workshop on P2P and Dependability
Linux kernel co-scheduling and bulk synchronous parallelism
International Journal of High Performance Computing Applications
Distributed spectral cluster management: a method for building dynamic publish/subscribe systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Locality-Awareness in a peer-to-peer publish/subscribe network
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Coexist: integrating content oriented publish/subscribe systems with ip
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
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
Parametric Content-Based Publish/Subscribe
ACM Transactions on Computer Systems (TOCS)
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
XL peer-to-peer pub/sub systems
ACM Computing Surveys (CSUR)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. SpiderCast is designed to effectively tread the balance between average overlay degree and communication cost of event dissemination. It employs a novel coverage-optimizing heuristic in which the nodes utilize partial subscription views (provided by a decentralized membership service) to reduce the average node degree while guaranteeing (with high probability) that the events posted on each topic can be routed solely through the nodes interested in this topic (in other words, the overlay is topic-connected). SpiderCast is unique in maintaining an overlay topology that scales well with the average number of topics a node is subscribed to, assuming the subscriptions are correlated insofar as found in most typical workloads. Furthermore, the degree grows logarithmically in the total number of topics, and slowly decreases as the number of nodes increases. We show experimentally that, for many practical work-loads, the SpiderCast overlays are both topic-connected and have a low per-topic diameter while requiring each node to maintain a low average number of connections. These properties are satisfied even in very large settings involving up to 10,000 nodes, 1,000 topics, and 70 subscriptions per-node, and under high churn rates. In addition, our results demonstrate that, in a large setting, the average node degree in SpiderCast is at least 45% smaller than in other overlays typically used to support decentralized pub/sub communication (such as e.g., similarity-based, rings-based, and random overlays).