000102325 001__ 102325
000102325 005__ 20181126150200.0
000102325 037__ $$aCONF
000102325 245__ $$aTowards Fair Event Dissemination
000102325 269__ $$a2007
000102325 260__ $$c2007
000102325 336__ $$aConference Papers
000102325 520__ $$aEvent dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every participant in the system act both as a client (information consumer) and as a server (information dissemination enabler), thus, precluding specific brokers which would prevent scalability and fault-tolerance. We argue that, for such decentralized architectures to be really meaningful, participants should serve the system as much as they benefit from it. That is, the system should be fair in the sense that the extend to which a participant acts as a server should depend on the extend to which it has the opportunity to act as a client. This is particularly crucial in selective information dissemination schemes where clients are not all interested in the same information. In this position paper, we discuss what a notion of fairness could look like, explain why current architectures are not fair, and raise several challenges towards achieving fairness.
000102325 700__ $$aBaehni, Sébastien
000102325 700__ $$0240335$$aGuerraoui, Rachid$$g105326
000102325 700__ $$aKoldehofe, Boris
000102325 700__ $$0242988$$aMonod, Maxime$$g127884
000102325 773__ $$tProceedings of the 27th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW 2007)
000102325 8564_ $$s163771$$uhttps://infoscience.epfl.ch/record/102325/files/Monod-TowardsFairEventDissemination.pdf$$zn/a
000102325 909C0 $$0252114$$pDCL$$xU10407
000102325 909CO $$ooai:infoscience.tind.io:102325$$pconf$$pIC$$qGLOBAL_SET
000102325 937__ $$aLPD-CONF-2007-005
000102325 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000102325 980__ $$aCONF