In this paper we propose a novel late join algorithm for distributed appliacations with a fully replicatedarchitecture (e.g. shared whiteboards). The term 'late join algorithm' is used to denote a mechanism that allows a latecoming participant to join an ongoing session. Generally, this requires that participants in the session inform the latecomer about the current state of the shared application, so that he or she is able to participate in the session once the late join has been completed. While many existing distributed applications implement some sort of late join,a thorough discussion of alte join algorithms has not yet been conducted. We therefore identify the key issues of late join algorithms and propose a set of requirements which a 'good' late join approach should satisfy. Based on these requirements, we evaluate existing late join algorithms and explain why we opted instead to develop a new, advanced late join algorithm for our own shared whiteboard. This late join algorithm is discussed in detail, and we show how it enhances existing approaches while still being general enough to be used for arbitrary distributed applications.
Additional information:
Im Dokument fälschlich als 2000,13 gezählt
Dieser Eintrag ist Teil der Universitätsbibliographie.
Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.
![[img]](https://madoc.bib.uni-mannheim.de/style/images/fileicons/application_pdf.png)
Search Authors in