Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques 2012
DOI: 10.4108/icst.simutools2010.8669
|View full text |Cite
|
Sign up to set email alerts
|

Consistency aware update schedule in multi-server Distributed Virtual Environments

Abstract: Multi-server architecture is very popular in Distributed Virtual Environments. Although multi-server architecture has good scalability, the load balance and consistency are still challenging issues. Because of server resource limitations (computation, communication etc), the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we address this problem by developing scheduling polices and try to get better overall consistency with limited resources. We formulate the problem by using in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…In [22], an update scheme is proposed to construct a graph to represent the communication delay between any two users, and then derive an optimal interval for sending update messages based on Markov chains and the properties of the fundamental matrix. In [20], a method is proposed to maintain the time-space consistency of users and their replicas by adapting each server's update schedule.…”
Section: Synchronization and View Consistencymentioning
confidence: 99%
“…In [22], an update scheme is proposed to construct a graph to represent the communication delay between any two users, and then derive an optimal interval for sending update messages based on Markov chains and the properties of the fundamental matrix. In [20], a method is proposed to maintain the time-space consistency of users and their replicas by adapting each server's update schedule.…”
Section: Synchronization and View Consistencymentioning
confidence: 99%
“…A replica of an avatar is defined as a replica without QoS if the time-space inconsistency between the replica and the primary copy of the avatar is larger than a predefined threshold. The number of replicas without QoS has been shown to be efficient in evaluating the overall inconsistency of a DVE system [59,71]. Based on this definition, the first updating problem is formulated as an integer programming problem which is to minimize the number of replicas without QoS.…”
Section: Aims Scope and Contributions Of This Thesismentioning
confidence: 99%