CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Buffer management in probabilistic peer-to-peer communication protocols

Boris Koldehofe (Institutionen för datavetenskap)
22nd International Symposium on Reliable Distributed Systems. FLORENCE, ITALY. OCT 06-08, 2003. SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS (1060-9857). p. 76-85. (2003)
[Konferensbidrag, refereegranskat]

In multipeer communication decentralised probabilistic protocols have received a lot of attention because of their robustness against faults in the communication traffic and their potential to provide scalability for large groups. These protocols provide a probabilistic guarantee for a propagated event to reach every group member Recent work aims to improve the scalability of such protocols by reducing memory requirements. In saving memory resources, the history buffer which is used to "remember" received events and to prevent multiple deliveries of events to the application, plays a very significant role. We examine how the buffer size should be chosen to challenge the multiple delivery problem. Further we propose and evaluate several methods of organising the dissemination of events in order to provide high reliability and reduce the number of multiple deliveries at the same time.

Nyckelord: peer-to-peer communication, multipeer communication, gossiping, networking, evaluation, fault tolerant communication, fault tolerant protocols

Denna post skapades 2013-05-21.
CPL Pubid: 177179


Institutioner (Chalmers)

Institutionen för datavetenskap (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur