一种位置感知的对等网络模型研究  

Study on locality-aware peer-to-peer network model

作　　者：王铁军[1] 刘恒[1] 周明天[1] 佘堃[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054

出　　处：《计算机应用研究》2010年第7期2677-2680,2696,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(60903073);国家"十一五"科技支撑计划重大项目(2006BAH02A0407)

摘　　要：为了尽可能地在本地访问网络资源,从而缩短网络访问时间,提出了一种位置感知的分布式生成树LDST模型,使得地理上邻近的节点被分在逻辑上靠近的组中。通过采用底层网络中节点间跳数或消息延迟作为覆盖网络中两个节点间的距离,制定了节点在LDST模型中代表元和邻近组的选取规则,给出了建立无标杆的、分层的、位置感知的覆盖网络的构造算法。数学分析和仿真结果表明,LDST模型具有小世界特性,节点加入算法具有对数时间复杂度,LDST模型具有较好的易扩展性和应用价值。This paper proposed a locality-aware distributed spanning tree（LDST） model for trying to access the network resources localized and reduce the latency,by organizing adjacent nodes in geographical into close groups in logical.Firstly,defined the distance of two nodes in the overlay network with the hops or the latency between two nodes in the underlying network.Next,presented the rules how to select the node as the representative and the group as the nearest group in the LDST model,and showed the arrival algorithm to construct a non-landmark,hierarchy and locality-aware overlay network.Finally,the mathematic analysis and simulation results show that the LDST model is a small-world,the time complexity of the arrival algorithm is logarithmic and the scalable LDST model has a good application value.

关 键 词：分布式生成树 位置感知 对等网络 小世界 

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