Enhancing the Interactivity in Distributed Interactive Applications

Abstract

Interactivity is a prior step of distributed interactive applications (DIAs). In distributed server architecture, the synchronization delay meets with requirements of fairness and consistency of DIAs, as well as the performance of interactivity not only depends on latencies on the client and server but also on the latencies of inter-server network (Zhang and Tang in IEEE/ACM Trans Net 20(6):1707–1720, 2012; Delaney et al. in Presence: Teleoperators Virtual Environ 15(2):218–234, 2006; Marzolla et al. in ACM Comput Entertainment, 2012; Webb et al. in Enhanced mirrored servers for network games, pp 117–122, 2007). The above-mentioned aspects are affected directly based on by which the client is assigned to the server in a network (Dhavachelvan in Int J Knowl–Based Syst 9(4):235–247, 2006; Brun et al. in Comm ACM 49(11):46–51, 2006) . We look over the complications of client assignment to server for improving the enhancement of DIAs. We mainly concentrate on endless DIAs that are changed due to the time aspect. We evaluate the small amount of feasible interacting time for DIAs to sustain consistency and fairness among the users. The heuristic algorithms are proposed and we are going to prove that Greedy Assignment and Distributed-Modify Assignment algorithms are going to produce near-optimal interactivity by reducing the interaction time among the clients related to the immediate algorithm that assigns each user to its adjacent server.