1999
DOI: 10.1007/978-0-387-35349-4_8
|View full text |Cite
|
Sign up to set email alerts
|

Generic and Composable Latecomer Accommodation Service for Centralized Shared Systems

Abstract: It is important that a shared application allow a latecomer to join other users who are already working together with the application. We have developed a latecomer accommodation service framework for centralized shared systems (applications and infrastructures). It employs an independent latecomer accommodation server that is dynamically composable with its clients. The server, also called the logger, logs a shared application's user interface (UI) changes in response to calls made by the client, also called … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2003
2003
2012
2012

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(19 citation statements)
references
References 3 publications
0
19
0
Order By: Relevance
“…Janus currently truncates history to limit storage requirements. We plan to adapt algorithms for compacting history developed for solving the groupware latecomer problem [6], and mechanisms for compressing messages [17].…”
Section: Strengths and Limitationsmentioning
confidence: 99%
“…Janus currently truncates history to limit storage requirements. We plan to adapt algorithms for compacting history developed for solving the groupware latecomer problem [6], and mechanisms for compressing messages [17].…”
Section: Strengths and Limitationsmentioning
confidence: 99%
“…With JS (= js 7,6 in Figure 9), t i,i+1 takes the other latecomers that want to use remote program replicas (user 7 in Figure 9), and allows them to join the collaboration session by dynamically replicating the user interface components on their computers, and making appropriate mappings for the user interface components.…”
Section: User Commandsmentioning
confidence: 99%
“…Therefore, we use a technique to reduce the log size (and thus the time to replay it) to order of the number of "state objects" of an upto-date software component [6]. By "state objects", we mean the objects that, we deduce from logged messages, a software component maintains to implement its behavior.…”
Section: Other Issuesmentioning
confidence: 99%
“…Chung et al [3] describe a replay service for a central architecture. The service bases on a latecomer accommodation server which is called the logger.…”
Section: Related Workmentioning
confidence: 99%
“…The basic idea is to let the latecomer's site select a participating site that supports it with the complete history list H. The latecomer's site uses the stored messages in the history list H to re-execute the state changes and thus to replay how the session state was reached. As the history list only contains the messages that resulted in a state change, compared to the system by Chung et al [3], additional compression techniques are not necessary.…”
Section: Final Phasementioning
confidence: 99%