The Information Bus: an architecture for extensible distributed systems
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
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
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Clustering Algorithms for Content-Based Publication-Subscription Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
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
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
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
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Interest clustering techniques for efficient event routing in large-scale settings
Proceedings of the second international conference on Distributed event-based systems
Extending Siena to support more expressive and flexible subscriptions
Proceedings of the second international conference on Distributed event-based systems
Proceedings of the second international conference on Distributed event-based systems
Defending financial infrastructures through early warning systems: the intelligence cloud approach
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Towards a lightweight content-based publish/subscribe services for peer-to-peer systems
International Journal of Grid and Utility Computing
Reliable publish/subscribe middleware for time-sensitive internet-scale applications
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Towards efficient event aggregation in a decentralized publish-subscribe system
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
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
Load Balancing Content-Based Publish/Subscribe Systems
ACM Transactions on Computer Systems (TOCS)
Ripple: A publish/subscribe service for multidata item updates propagation in the cloud
Journal of Network and Computer Applications
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
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
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)
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
Achieving reliable and timely event dissemination over WAN
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
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
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
The hidden pub/sub of spotify: (industry article)
Proceedings of the 7th ACM international conference on Distributed event-based systems
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
XL peer-to-peer pub/sub systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The completely decoupled interaction model offered by the publish/subscribe communication paradigm perfectly suits the interoperability needs of todays large-scale, dynamic, peer-to-peer applications. The unmanaged environments, where these applications are expected to work, pose a series of problems (potentially wide number of partipants, low-reliability of nodes, absence of a centralized authority, etc.) that severely limit the scalability of existing approaches which were originally thought for supporting distributed applications built on the top of static and managed environments. In this paper we propose an architecture for implementing the topic-based publish/subscribe paradigm in large scale peer-to-peer systems. The architecture is based on clustering peers subscribed to the same topic. The major novelty of this architecture lies in the mechanism employed to bring events from the publisher to the cluster (namely outer-cluster routing). The evaluation shows that this mechanism for outer-cluster routing has a probability to bring events to the destination cluster very close to 1 while keeping small the involved number of out-of-cluster peers. Finally, the overall architecture is shown to be scalable along several fundamental dimensions like number of participants, subscriptions, and to exhibit a fair load distribution (load distribution closely follows the distribution of subscriptions on nodes).