This paper presents the measurement study of locality-aware Peer-to-Peer solutions on Internet Autonomous System (AS) topology by reducing AS hop count and increase nearby source nodes in P2P applications. We evaluate...This paper presents the measurement study of locality-aware Peer-to-Peer solutions on Internet Autonomous System (AS) topology by reducing AS hop count and increase nearby source nodes in P2P applications. We evaluate the performance of topology-aware BT system called TopBT with BitTorrent (BT) by constructing AS graph and measure the hops between nodes to observe the impact of quality of service in P2P applications.展开更多
IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this...IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.展开更多
提出了一种基于 peer to peer技术的分布式Web缓存共享系统:BuddyWeb.该系统的核心理念是让企业网络中的所有PC能够相互共享浏览器中的本地缓存,从而形成一个高效的、大规模的分布式缓存共享系统,并使系统具备易管理、易实现、低成本等...提出了一种基于 peer to peer技术的分布式Web缓存共享系统:BuddyWeb.该系统的核心理念是让企业网络中的所有PC能够相互共享浏览器中的本地缓存,从而形成一个高效的、大规模的分布式缓存共享系统,并使系统具备易管理、易实现、低成本等优点;接着详细阐述了 BuddyWeb的工作原理和算法策略;然后,针对 Buddy Web系统的特性提出了仿真实验模型和评估方法.实验结果证明了BuddyWeb在命中率、网络通信流量负荷、系统响应延迟等诸方面均能取得令人满意的效果.展开更多
提出并实现了一种建立在Peer-to-Peer 搜索策略上的自组织、自适应、高效和可靠的文件系统DISPFS(Double ID Space basedPeer-to-peer File System)。它在双层ID 空间中构造虚拟存储节点,不仅有效地取得了文件系统内的负载均衡、提高系...提出并实现了一种建立在Peer-to-Peer 搜索策略上的自组织、自适应、高效和可靠的文件系统DISPFS(Double ID Space basedPeer-to-peer File System)。它在双层ID 空间中构造虚拟存储节点,不仅有效地取得了文件系统内的负载均衡、提高系统利用率,而且保证了动态环境中文件的可靠、快速获取。试验数据表明,DISPFS 在系统接近满负荷运行和文件插入/删除操作频繁的双重压力下依然保持优良的性能。展开更多
Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distrib...Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.展开更多
In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services ...In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services may utilize mobile peer-to-peer communication instead of central server based communication for rich mul-timedia services. The main challenge of the underlay radio in a multi-cell environment is to limit the inter-ference to the cellular network while achieving a reasonable link budget for the D2D radio. We propose a novel power control mechanism for D2D connections that share cellular uplink resources. The mechanism limits the maximum D2D transmit power utilizing cellular power control information of the devices in D2D communication. Thereby it enables underlaying D2D communication even in interference-limited networks with full load and without degrading the performance of the cellular network. Secondly, we study a single cell scenario consisting of a device communicating with the base station and two devices that communicate with each other. The results demonstrate that the D2D radio, sharing the same resources as the cellular net-work, can provide higher capacity (sum rate) compared to pure cellular communication where all the data is transmitted through the base station.展开更多
A number of IDSs have been proposed for a networked or distributed environment. A modified D-IDS using federated peer-to-peer architecture, MCR (Multicast Reflector) and modified shaker protocol were proposed. The sug...A number of IDSs have been proposed for a networked or distributed environment. A modified D-IDS using federated peer-to-peer architecture, MCR (Multicast Reflector) and modified shaker protocol were proposed. The suggested scheme can be implemented easily and performs the information sharing between low-level IDS agents. As all users within a group monitor each other’s, the common control server can perform detect intrusions with less cost and support the detection of the inside intruders.展开更多
The article analyses several key issues which restrict the effectiveness of fund project peer review work. It analyses the evaluating theory and matter-element theory to access the expert anti-evaluation model, and al...The article analyses several key issues which restrict the effectiveness of fund project peer review work. It analyses the evaluating theory and matter-element theory to access the expert anti-evaluation model, and also studies the expert anti-evaluation index system to support the anti-evaluation method. The practical basis is the true score data of the experts which is collected from the actual anti-evaluation in Liaoning province science and technology fund project peer review system. With the practical experience of the actual project, we prove that the expert index system anti-evaluation model and expert anti-evaluation method can improve the fund project peer review work and play a positive role for the peer review work and also make the review work more scientific and more rational.展开更多
研究Peer数据管理系统(peer data management system,简称PDMS)中的视图维护策略.首先提出一种混合的P2P架构,在该架构中,Peer优先选择基本的P2P架构而不是超级Peer架构.如果一个视图沿着PDMS的一条语义链路传播,那么它通过重构能够从...研究Peer数据管理系统(peer data management system,简称PDMS)中的视图维护策略.首先提出一种混合的P2P架构,在该架构中,Peer优先选择基本的P2P架构而不是超级Peer架构.如果一个视图沿着PDMS的一条语义链路传播,那么它通过重构能够从许多数据源检索到数据,因此扩展了视图的定义,提出peer视图、局部视图和全局视图;并且从一条语义链路的任意节点出发,同一查询都能够得到相同的结果.在PDMS中,连接操作限制在各个局部PDMS中,这样,全局物化视图的维护就转化为对各相关局部物化视图的维护.在PDMS中,一个视图可能涉及到多个表的连接,根据该应用的需要扩展了Mork的规则系统.根据扩展了的规则系统进行更新数据传播,同时依据该规则系统提出一种算法来维护PDMS中的视图.最后进行实验验证.实验结果表明,该视图维护策略比Mork的视图维护策略的性能要好.展开更多
A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed a...A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.展开更多
文摘This paper presents the measurement study of locality-aware Peer-to-Peer solutions on Internet Autonomous System (AS) topology by reducing AS hop count and increase nearby source nodes in P2P applications. We evaluate the performance of topology-aware BT system called TopBT with BitTorrent (BT) by constructing AS graph and measure the hops between nodes to observe the impact of quality of service in P2P applications.
基金Sponsored by the National Natural Science Foundation of China(Grant No.60672124 and 60832009)Hi-Tech Research and Development Program(National 863 Program)(Grant No.2007AA01Z221)
文摘IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.
文摘提出并实现了一种建立在Peer-to-Peer 搜索策略上的自组织、自适应、高效和可靠的文件系统DISPFS(Double ID Space basedPeer-to-peer File System)。它在双层ID 空间中构造虚拟存储节点,不仅有效地取得了文件系统内的负载均衡、提高系统利用率,而且保证了动态环境中文件的可靠、快速获取。试验数据表明,DISPFS 在系统接近满负荷运行和文件插入/删除操作频繁的双重压力下依然保持优良的性能。
文摘Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.
文摘In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services may utilize mobile peer-to-peer communication instead of central server based communication for rich mul-timedia services. The main challenge of the underlay radio in a multi-cell environment is to limit the inter-ference to the cellular network while achieving a reasonable link budget for the D2D radio. We propose a novel power control mechanism for D2D connections that share cellular uplink resources. The mechanism limits the maximum D2D transmit power utilizing cellular power control information of the devices in D2D communication. Thereby it enables underlaying D2D communication even in interference-limited networks with full load and without degrading the performance of the cellular network. Secondly, we study a single cell scenario consisting of a device communicating with the base station and two devices that communicate with each other. The results demonstrate that the D2D radio, sharing the same resources as the cellular net-work, can provide higher capacity (sum rate) compared to pure cellular communication where all the data is transmitted through the base station.
基金This work is supported by the MIC( Ministry of Information & Communication) , KOREA,the ITRC(Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment)(IITA-2006-C1090-0603-0020)
文摘A number of IDSs have been proposed for a networked or distributed environment. A modified D-IDS using federated peer-to-peer architecture, MCR (Multicast Reflector) and modified shaker protocol were proposed. The suggested scheme can be implemented easily and performs the information sharing between low-level IDS agents. As all users within a group monitor each other’s, the common control server can perform detect intrusions with less cost and support the detection of the inside intruders.
文摘The article analyses several key issues which restrict the effectiveness of fund project peer review work. It analyses the evaluating theory and matter-element theory to access the expert anti-evaluation model, and also studies the expert anti-evaluation index system to support the anti-evaluation method. The practical basis is the true score data of the experts which is collected from the actual anti-evaluation in Liaoning province science and technology fund project peer review system. With the practical experience of the actual project, we prove that the expert index system anti-evaluation model and expert anti-evaluation method can improve the fund project peer review work and play a positive role for the peer review work and also make the review work more scientific and more rational.
文摘研究Peer数据管理系统(peer data management system,简称PDMS)中的视图维护策略.首先提出一种混合的P2P架构,在该架构中,Peer优先选择基本的P2P架构而不是超级Peer架构.如果一个视图沿着PDMS的一条语义链路传播,那么它通过重构能够从许多数据源检索到数据,因此扩展了视图的定义,提出peer视图、局部视图和全局视图;并且从一条语义链路的任意节点出发,同一查询都能够得到相同的结果.在PDMS中,连接操作限制在各个局部PDMS中,这样,全局物化视图的维护就转化为对各相关局部物化视图的维护.在PDMS中,一个视图可能涉及到多个表的连接,根据该应用的需要扩展了Mork的规则系统.根据扩展了的规则系统进行更新数据传播,同时依据该规则系统提出一种算法来维护PDMS中的视图.最后进行实验验证.实验结果表明,该视图维护策略比Mork的视图维护策略的性能要好.
文摘A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.
