Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Improving the Performance of Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
A Scalable Overlay Multicast Architecture for Large-Scale Applications
IEEE Transactions on Parallel and Distributed Systems
Modeling the effects of delayed haptic and visual feedback in a collaborative virtual environment
ACM Transactions on Computer-Human Interaction (TOCHI)
A two-phase approach to interactivity enhancement for large-scale distributed virtual environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced mirrored servers for network games
Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games
CoMaya: incorporating advanced collaboration capabilities into 3d digital media design tools
Proceedings of the 2008 ACM conference on Computer supported cooperative work
Triangle Inequality and Routing Policy Violations in the Internet
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Robust resource allocation in a massive multiplayer online gaming environment
Proceedings of the 4th International Conference on Foundations of Digital Games
Adaptive server selection for large scale interactive online games
Computer Networks: The International Journal of Computer and Telecommunications Networking
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
A 3-approximation for facility location with uniform capacities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A Survey of Application-Layer Multicast Protocols
IEEE Communications Surveys & Tutorials
Latency-driven distribution: infrastructure needs of participatory entertainment applications
IEEE Communications Magazine
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
Brief announcement: on minimum interaction time for continuous distributed interactive computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Online Client Assignment in Dynamic Real-Time Distributed Interactive Applications
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
Distributed interactive applications (DIAs) are networked systems that allow multiple participants at different locations to interact with each other. Wide spreads of client locations in large-scale DIAs often require geographical distribution of servers to meet the latency requirements of the applications. In the distributed server architecture, the network latencies involved in the interactions between clients are directly affected by how the clients are assigned to the servers. In this paper, we focus on the problem of assigning clients to appropriate servers in DIAs to enhance their interactivity. We formulate the problem as a combinational optimization problem and prove that it is NP-complete. Then, we propose several heuristic algorithms for fast computation of good client assignments and theoretically analyze their approximation ratios. The proposed algorithms are also experimentally evaluated with real Internet latency data. The results show that the proposed algorithms are efficient and effective in reducing the interaction time between clients, and our proposed Distributed-Modify-Assignment adapts well to the dynamics of client participation and network conditions. For the special case of tree network topologies, we develop a polynomial-time algorithm to compute the optimal client assignment.