|
An Efficient and Flexible Late Join Algorithm for Shared Whiteboards
Geyer, Werner
;
Vogel, Jürgen
;
Mauve, Martin
|
URL:
|
https://ieeexplore.ieee.org/document/860671
|
|
Additional URL:
|
https://www.researchgate.net/publication/221504510...
|
|
Document Type:
|
Conference or workshop publication
|
|
Year of publication:
|
2000
|
|
Book title:
|
ISCC 2000 : IEEE Symposium on Computers and Communications (ISCC): July 3-6, 2000, Antibes - Juan Les Pins, France
|
|
The title of a journal, publication series:
|
Proc. of the Fifth IEEE International Symposium on Computers and Communications, ISCC 2000
|
|
Page range:
|
404-409
|
|
Conference title:
|
5.Symposium on Computers and Communications (ISCC)
|
|
Location of the conference venue:
|
Antibes, Juan Les Pins, France
|
|
Date of the conference:
|
03.-05.06.1999
|
|
Publisher:
|
Tohmé, Samir
;
Ulema, Mehmet
|
|
Place of publication:
|
Los Alamitos, Calif.
|
|
Publishing house:
|
IEEE Computer Soc.
|
|
ISBN:
|
0-7695-0722-0
|
|
Publication language:
|
English
|
|
Institution:
|
School of Business Informatics and Mathematics > Praktische Informatik IV (Effelsberg 1989-2017)
|
|
Subject:
|
004 Computer science, internet
|
|
Abstract:
|
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term late join algorithm is used to denote a mechanism that allows a late-coming 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 actively 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 late 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 approach is discussed in detail, and we show how it enhances existing approaches significantly while still being general enough to be used for arbitrary distributed applications.
|
 | Dieser Eintrag ist Teil der Universitätsbibliographie. |
 Search Authors in
You have found an error? Please let us know about your desired correction here: E-Mail
Actions (login required)
 |
Show item |
|
|
