DocumentCode
3123332
Title
Towards Fair Event Dissemination
Author
Baehni, Sébastien ; Guerraoui, Rachid ; Koldehofe, Boris ; Monod, Maxime
Author_Institution
Ecole Polytech. Fed. de Lausanne, Lausanne
fYear
2007
fDate
22-29 June 2007
Firstpage
63
Lastpage
63
Abstract
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.
Keywords
client-server systems; information dissemination; peer-to-peer computing; client-server system; decentralized peer-to-peer architecture; fault tolerance; large scale dynamic system; selective event information dissemination; Concurrent computing; Costs; Distributed computing; Information filtering; Information filters; Large-scale systems; Matched filters; Peer to peer computing; Robustness; Subscriptions;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems Workshops, 2007. ICDCSW '07. 27th International Conference on
Conference_Location
Toronto, Ont.
ISSN
1545-0678
Print_ISBN
0-7695-2838-4
Electronic_ISBN
1545-0678
Type
conf
DOI
10.1109/ICDCSW.2007.83
Filename
4279067
Link To Document