P2P MMOG中一种结构化多代理节点模型  

Structured Multi-Agent Model for P2P MMOG

作　　者：罗佳[1] 常会友[2] 衣扬[1] 

机构地区：[1]中山大学信息科学与技术学院,广州510275 [2]中山大学软件学院,广州510275

出　　处：《计算机科学》2010年第3期106-111,共6页Computer Science

基　　金：国家自然科学基金项目(60573159);广东省自然科学基金重点项目(05200302);粤港关键重点突破项目(2006Z1-D6021)资助

摘　　要：针对大型多人在线游戏(Massive Multi-player Online Game)中不断增大的游戏资源需求同有限的服务器负载能力之间的矛盾,提出一种负载均衡的结构化多代理节点(Structured Multi-Agent)模型。该模型对P2P MMOG的相关理论进行了定义,并在此基础上构造出节点加入算法、邻居发现算法和节点跨域算法。理论证明这3个算法保证了资源状态的一致性。同时SMA将所有资源的处理权均衡地分配给兴趣域内的所有节点,实现了节点间的负载均衡。对模型伸缩性、响应速度和节点负载等方面的理论分析表明,SMA模型具有较好的性能优势。For the contradiction between the increasing requirement of resources and limited load capacity of servers in Massive Multi-player Online Game （MMOG）, a Structured Multi-Agent （SMA） model with load balancing was proposed. The theory of P2P MMOC- was defined for SMA and three core algorithms which contain node joining algorithm, neighbor discovery algorithm and cross domain algorithm were constructed. These algorithms theoretically guarantee the consistency of states of all resources. In order to complement the load balancing,SMA assigns the processing licenses of resources to all nodes in an Area of Interest （AOI）. Through analyzing the scalability, response speed and load consumption etc. , SMA has fine performance.

关 键 词：大型多人在线游戏 对等网络 兴趣域 Pastry协议 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]