一种改进的P2P网络业务路由算法  

An improved Service Routing Protocol for Layered P2P Network-LBLD

作　　者：刘世栋[1] 张顺颐[1] 

机构地区：[1]南京邮电大学信息网络技术研究所,江苏南京210003

出　　处：《计算机仿真》2008年第10期142-145,156,共5页Computer Simulation

基　　金：国家高技术研究发展计划"863"基金(2005AA121620)

摘　　要：业务路由是研究如何在覆盖网络环境下提供有QOS保证的复合业务的问题。针对目前的业务路由算法扩展性差、业务路由不稳定等特点,提出了一种大规模P2P网络环境下的分布式业务路由改进算法-LBLD。对系统内的所有业务节点按其地理位置进行分簇形成一种层次化的拓扑结构,通过簇首之间汇总信息的传递减少了节点之间传输报文的信息量,改善了算法的可扩展性。同时在选择业务路径中的节点主机时,考虑了主机的生命周期,使最终采用的业务路径具有较好的稳定性,减少了由于节点异常离开而造成业务中断的概率。模拟实验证明了这种算法的有效性。Service routing is a topic on how to supply a QOS - assured composition service in P2P network. A distributed composite service path discovery algorithm named LBLD is proposed in this paper to solve the problems appearing in previous research, such as poor extensibility, instability of route. LBLD divides peers into different groups based on their location proximity and forms a layered P2P overlay network to reduce communication overheads between peers, thus improving the extensibility of algorithm. At the same time, the lifespan of peer is considered when selecting candidate service instance nodes. The stability of chosen service path is ensured so that the probability of service disruption due to unwanted leave of peers is reduced to some extent. Simulation proves it.

关 键 词：业务路由 对等网络 业务合成 生命周期 分层体系 

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