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.