Scalable and Efficient Update Dissemination for Distributed Interactive Applications
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Time-space consistency in large-scale distributed virtual environments
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Modeling the effects of delayed haptic and visual feedback in a collaborative virtual environment
ACM Transactions on Computer-Human Interaction (TOCHI)
Robust resource allocation in a massive multiplayer online gaming environment
Proceedings of the 4th International Conference on Foundations of Digital Games
Update Scheduling for Improving Consistency in Distributed Virtual Environments
IEEE Transactions on Parallel and Distributed Systems
The Client Assignment Problem for Continuous Distributed Interactive Applications
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Consistency-aware Partitioning Algorithm in Multi-server Distributed Virtual Environments
IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Quality of user experience in Distributed Interactive Applications(DIAs) highly depends on the network latencies during the system execution. In DIAs, each user is assigned to a server and communication with any other client is performed through its assigned server. Hence, latency measured between two clients, called interaction time, consists of two components. One is the latency between the client and its assigned server, and the other is the inter-server latency, that is the latency between servers that the clients are assigned. In this paper, we investigate a real-time client to server assignment scheme in a DIA where the objective is to minimize the interaction time among clients. The client assignment problem is known to be NP-complete and heuristics play an important role in finding near optimal solutions. We propose two distributed heuristic algorithms to the online client assignment problem in a dynamic DIA system. We utilized real-time Internet latency data on the Planet Lab platform and performed extensive experiments using geographically distributed Planet Lab nodes where nodes can arbitrarily join/leave the system. The experimental results demonstrate that our proposed algorithms can reduce the maximum interaction time among clients up to 45% compared to an existing baseline technique.