Architectural considerations for a new generation of protocols
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient distributed implementation of semi-replicated synchronous groupware
Proceedings of the 9th annual ACM symposium on User interface software and technology
A generic late-join service for distributed interactive media
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Dynamic lock synchronisation for collaborative 3D applications
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
| Hi-index | 0.00 |
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 late-coming participants to join an ongoing session. Generally, this requires that participants in the session provide the latecomer with the current state of the shared application. We 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 to develop a new, advanced late join algorithm for our own-shared whiteboard. This late join approach is general enough to be used for arbitrary distributed applications.