J4

• Original Articles • Previous Articles     Next Articles

Balanced route arithmetic based noncooperative game theory

ZHANG Hui-juan1,2;ZHOU Li-hua1;ZHAI Hong-ming3
  

  1. (1. School of Computer Science, Xidian Univ., Xi′an 710071, China; 2. School of Software Engineering, Tongji Univ., Shanghai 200062, China; 3. Bank of Communication, Shanghai 200033, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-20 Published:2007-06-20

Abstract: Because of the unbalanced resource distribution in the path choice of the router, a new game-theoretic approach is presented, which regards the anycast route of IPv6 as an uncooperate game in many players. A game model with a player’s rate distribution stratety and delay avail in all paths is given. The player’s rate distribution which can assure the Nash equilibrium is solved. Based on the Nash Equilibrium, a balanced route arithmetic which asscures the best delay and the fair distribution in all players is presented. Simulation results indicate that this arithmetic can solve the balanced resource distribution in the router in effect.

Key words: resource distribution, noncooperative game, Nash equilibrium, balance route

CLC Number: 

  • TP393.03