000089610 001__ 89610
000089610 005__ 20190316233823.0
000089610 037__ $$aREP_WORK
000089610 245__ $$aCommunity-Aware Event Dissemination
000089610 269__ $$a2006
000089610 260__ $$c2006
000089610 336__ $$aReports
000089610 520__ $$aThis paper presents a distributed algorithm to disseminate events in a publish/subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Every topic defines a dynamic notion of ``community'', gathering the processes which publish on that topic or subscribe to it. Our algorithm is completely decentralized (no brokers), yet does not require from any process to ever receive, store or forward, events from a community it is not part of. We order the communities according to the topic inclusion relationships to efficiently manage the flow of information within, and between the communities, as well as limit the memory consumption of each process. Processes can control, for each of their communities, the trade-off between the message complexity and the reliability of event dissemination. We convey this trade-off through analysis, simulations and measurements obtained with a full implementation of our algorithm.
000089610 6531_ $$aFault-tolerant algorithms
000089610 6531_ $$apeer-to-peer
000089610 6531_ $$amulticas
000089610 6531_ $$atopic-based publish/subscribe
000089610 700__ $$aBaehni, Sébastien
000089610 700__ $$0241768$$g101307$$aEugster, Patrick
000089610 700__ $$g105326$$aGuerraoui, Rachid$$0240335
000089610 700__ $$aJurca, Oana
000089610 8564_ $$uhttps://infoscience.epfl.ch/record/89610/files/camult.pdf$$zn/a$$s644017
000089610 909C0 $$xU10407$$0252114$$pDCL
000089610 909CO $$ooai:infoscience.tind.io:89610$$qGLOBAL_SET$$pIC$$preport
000089610 937__ $$aLPD-REPORT-2006-010
000089610 973__ $$sPUBLISHED$$aEPFL
000089610 980__ $$aREPORT