Computational time complexity of allocation problem for distributed servers in real-time applications

This paper analyzes the computational time complexity of the allocation problem for data processing functions among multiple users and distributed servers in the distributed processing communication scheme for a real-time network application. In the distributed processing communication scheme, the application is processed on a data processing function in the distributed servers in order to minimize the delay time. We prove that the allocation problem for data processing functions among multiple users and distributed servers is an NP-complete problem.

[1]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[2]  Eiji Oki,et al.  Distributed processing communication scheme for real-time applications considering admissible delay , 2016, 2016 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR 2016).

[3]  Yahn W. Bernier,et al.  Latency Compensating Methods in Client/Server In-game Protocol Design and Optimization , 2003 .

[4]  Thomas A. Funkhouser,et al.  RING: a client-server system for multi-user virtual environments , 1995, I3D '95.

[5]  Eric Cronin,et al.  A Distributed Multiplayer Game Server System , 2001 .

[6]  Yutaka Ishibashi,et al.  A group synchronization mechanism for live media in multicast communications , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[7]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.