A dynamic scheduling algorithm for MMOG based on P2P network

摘要

Mobile agent brings new problems about real-time scheduling in P2P MMOG. This paper proposes a dynamic priority-variation scheduling algorithm which can schedule the players' tasks dynamically according to the trusted degree of agent service, the CPU usage of agent service in the player's computer, the network traffic of the player's computer and the task delay time in the scheduling queue. The simulation results show that this algorithm meets the real-time demand in MMOG, shortens the system delay time, and solves the problem about load balance in P2P MMOG.