.png){kind=icon}
Return
Late join algorithms for distributed interactive applications
.png){kind=icon}
PRE
AI
DOI：10.1007/s00530-003-0103-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed interactive applications such as shared whiteboards and multiplayer games often support dynamic groups where users may join and leave at any time. A participant joining an ongoing session has missed the data that have previously been exchanged by the other session members. It is therefore necessary to initialize the application instance of the latecomer with the current state. In this paper, we propose a late join algorithm for distributed interactive applications that provides such an initialization of applications. The algorithm is scalable and robust and can be easily adapted to the needs of different applications by means of late join policies. The behavior of the late join algorithm and the impact of design alternatives are investigated in detail by means of an extensive simulation study. This study also shows that an improper handling of the late join problem can cause very high application and network load.
Keywords:
late join
distributed interactive applications
consistency control
RTP/I
Journal
IF:
3.1
Papers:
2.8K
Citations:
2.7K
Organization
No organization information available