loading...
Towards Fair Event Dissemination
Toronto, Canada June 22-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2007.8327th International Conference on Dist ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sebastien Baehni, Ecole Polytechnique Federale de Lausanne (EPFL)
Rachid Guerraoui, Ecole Polytechnique Federale de Lausanne (EPFL)
Boris Koldehofe, University of Stuttgart
Maxime Monod, Ecole Polytechnique Federale de Lausanne (EPFL)
Event 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.
Citation:
Sebastien Baehni, Rachid Guerraoui, Boris Koldehofe, Maxime Monod, "Towards Fair Event Dissemination," icdcsw, pp.63, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.