Publications

Disclaimer:

IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Late Join Algorithms for Distributed Interactive Applications

Author(s): Jürgen Vogel, Martin Mauve, Volker Hilt, Wolfgang Effelsberg.
Title: Late Join Algorithms for Distributed Interactive Applications
Published: ACM/Springer Multimedia Systems 9 (4), pp. 327-336, October 2003
Keyword(s): Late Join, Distributed Interactive Applications, Consistency Control, RTP/I
Abstract: Distributed interactive applications such as shared whiteboards andmultiplayer games often support dynamic groups where users mayjoin and leave at any time. A participant joining an ongoing sessionhas missed the data that have previously been exchanged by the othersession members. It is therefore necessaryto initialize the application instance of the latecomer with thecurrent state. In this paper, we propose a late join algorithmfor distributed interactive applications that provides such aninitialization of applications. The algorithm is scalable androbust and can be easily adapted to the needs of different applicationsby means of late join policies. The behavior of the late joinalgorithm and the impact of design alternatives are investigated in detailby means of an extensive simulation study. This study also shows thatan improper handling of the late join problem can cause very highapplication and network load.
Note:
Bib entry: [XML] [BibTeX]
Download: [PDF]
Responsible for the content: E-MailWE Informatik