Combining the characteristics of peer-to-peer （P2P） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2P and grid. The algorithm computes nodes capacities using their...Combining the characteristics of peer-to-peer （P2P） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2P and grid. The algorithm computes nodes capacities using their resource properties provided by a grid monitoring and discovery system, such as available bandwidth, free CPU and idle memory, as well as the number of current connections and online time. when a new node joins the network and the super-peers are all saturated, it should select a new super-peer from the new node or joined nodes with the highest capacity. By theoretical analyses and simulation experiments, it is shown that super-peers selected by capacity can achieve higher query success rates and shorten the average hop count when compared with super-peers selected randomly, and they can also balance the network load when all super-peers are saturated. When the number of total nodes changes, the conclusion is still valid, which explains that the algorithm SSABC is feasible and stable.展开更多
Efficient resource search method has significant impact on the scalability and availability of P2P network. Generally there are two search methods, pure Peer-to-Peer method and central index method. Recently, some sea...Efficient resource search method has significant impact on the scalability and availability of P2P network. Generally there are two search methods, pure Peer-to-Peer method and central index method. Recently, some search methods with super-peer concept are appearing, which are the compromise of those two methods and have favorable scalability and avafiability. In this paper, we compare the advantage and deficiency of these three kinds of search methods, and based on JXTA platform design the super-peer search method.展开更多
轮廓查询是近年来信息服务领域的一个研究重点和热点.现有的三阶段算法TPAOSS(Three-PhaseAlgo-rithm for Optimizing Skyline Scalar)至少存在如下两个缺陷:(1)在TPAOSS算法的第3阶段中,当网络节点上的对象个数较多时,Bloom filter的...轮廓查询是近年来信息服务领域的一个研究重点和热点.现有的三阶段算法TPAOSS(Three-PhaseAlgo-rithm for Optimizing Skyline Scalar)至少存在如下两个缺陷:(1)在TPAOSS算法的第3阶段中,当网络节点上的对象个数较多时,Bloom filter的长度将呈指数级增长,从而严重影响获取子空间重复值的效率以及占用内存空间的大小;(2)TPAOSS算法只考虑预处理阶段的时间代价,而没有考虑各网络节点进行局部或全局子空间轮廓查询计算的效率.为此,提出一种适合超对等网络(Super-Peer Architecture,SPA)的子空间轮廓查询方法EPSSQDN(Efficient Processing of Sub-space Skyline Queries in Distributed Networks).EPSSQDN算法有效解决了TPAOSS算法的的两个主要性能问题,并且显著提高了SPA网络中的子空间轮廓查询处理的效率.此外,为了能够进一步降低子空间上轮廓查询的时间开销以及网络节点间的数据传输量,我们给出新颖且有效的优化策略.实验结果表明,EPSSQDN算法比TPAOSS算法更能够缩短SPA网络中子空间轮廓查询的时间开销.展开更多
In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The ...In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.展开更多
基金The National High Technology Research and Development Program of China (863 Program) (No.2007AA01Z422)the NaturalFoundation of Anhui Provincial Education Department (No.2006KJ041B,KJ2007B073)
文摘Combining the characteristics of peer-to-peer （P2P） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2P and grid. The algorithm computes nodes capacities using their resource properties provided by a grid monitoring and discovery system, such as available bandwidth, free CPU and idle memory, as well as the number of current connections and online time. when a new node joins the network and the super-peers are all saturated, it should select a new super-peer from the new node or joined nodes with the highest capacity. By theoretical analyses and simulation experiments, it is shown that super-peers selected by capacity can achieve higher query success rates and shorten the average hop count when compared with super-peers selected randomly, and they can also balance the network load when all super-peers are saturated. When the number of total nodes changes, the conclusion is still valid, which explains that the algorithm SSABC is feasible and stable.
文摘Efficient resource search method has significant impact on the scalability and availability of P2P network. Generally there are two search methods, pure Peer-to-Peer method and central index method. Recently, some search methods with super-peer concept are appearing, which are the compromise of those two methods and have favorable scalability and avafiability. In this paper, we compare the advantage and deficiency of these three kinds of search methods, and based on JXTA platform design the super-peer search method.
文摘轮廓查询是近年来信息服务领域的一个研究重点和热点.现有的三阶段算法TPAOSS(Three-PhaseAlgo-rithm for Optimizing Skyline Scalar)至少存在如下两个缺陷:(1)在TPAOSS算法的第3阶段中,当网络节点上的对象个数较多时,Bloom filter的长度将呈指数级增长,从而严重影响获取子空间重复值的效率以及占用内存空间的大小;(2)TPAOSS算法只考虑预处理阶段的时间代价,而没有考虑各网络节点进行局部或全局子空间轮廓查询计算的效率.为此,提出一种适合超对等网络(Super-Peer Architecture,SPA)的子空间轮廓查询方法EPSSQDN(Efficient Processing of Sub-space Skyline Queries in Distributed Networks).EPSSQDN算法有效解决了TPAOSS算法的的两个主要性能问题,并且显著提高了SPA网络中的子空间轮廓查询处理的效率.此外,为了能够进一步降低子空间上轮廓查询的时间开销以及网络节点间的数据传输量,我们给出新颖且有效的优化策略.实验结果表明,EPSSQDN算法比TPAOSS算法更能够缩短SPA网络中子空间轮廓查询的时间开销.
基金The National Natural Science Foundation of China(No.60573127), Specialized Research Fund for the Doctoral Program of Higher Education (No.20040533036).
文摘In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.
