By Topic

A dynamic scheduling algorithm for MMOG based on P2P network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jinzhong Wang ; Shenyang Sport Univ., Shenyang, China ; Bo Cong ; Kefeng Cheng

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.

Published in:

System Science and Engineering (ICSSE), 2012 International Conference on

Date of Conference:

June 30 2012-July 2 2012