结构化P2P网络路由算法在网络层的性能评估  

Quantitative Evaluation on Routing Performance on Network-level of Structured P2P Network

作　　者：于婧[1] 胡曦明[1] 伊鹏[1] 汪斌强[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机工程》2007年第13期7-9,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2005-AA-121210)

摘　　要：基于结构化P2P路由系统的马尔可夫链模型,以平均路径长度为指标,提出了结构化P2P网络路由算法在网络层面的性能量化评估方法。该方法解决了结构化P2P网络采用基于overlay层面的路由算法实现资源查找和定位导致的网络层路由性能无法估量的问题,能够准确表现结构化P2P网络overlay层面路由算法的实际网络性能,为结构化P2P网络路由算法的研究提供准确的性能评估机制。Based on structured P2P routing system model and Markov-chain model, this paper presents a quantitative evaluation on routing performance on the network-level of structured P2P network. Utilizing the average path length as the gist, this method resolves the difficulty induced by the routing algorithms on the overlay-level. It can exactly evaluate the routing performance on the network-level, and provide an evaluation mechanism to the research on the routing algorithms of structured P2P network with exactness.

关 键 词：结构化P2P网络 路由 马尔可夫链模型 平均路径长度 

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