无结构P2P网络资源搜索方法研究

对等网络（P2P）成为近年来的研究热点，如何进行高效准确的资源搜索是实现对等网络应用的关键问题。本文在分析Gnutella网络的基本泛洪算法存在问题的基础之上，介绍了现有的资源搜索改进方法，包括优化网络拓扑结构方法、改进转发机制方法、基于路由信息方法和基于缓存的方法。     

A reliable overlay video transport protocol for multicast agents in wireless mesh networks

A new video transport protocol for multicast agents in wireless mesh networks (WMNs) is proposed in this paper. The proposed protocol enables a significant reduction in the transmission overhead, while providing reliable communication for its use in multicast applications. This proposed reliable protocol provides a practical approach for an overlay peer‐to‐peer multicast facility supported within the application layer. This obviates the need to give upgraded routers capable of handling multicast broadcasting or modify the existing protocol stack. The protocol tolerates partial losses in multimedia transmissions, while supporting control of the delay sensitivity of such transmissions in WMNs. The key issue in this protocol is the ability to detect packet loss, anticipate retransmission requests, and use the anticipated retransmission requests to transmit the lost packets prior to requests from other receiving agents. The proposed protocol allows for the receiver to determine if retransmission of lost packets is required, ensuring the greatest flexibility needed for a reliable multicast protocol. Copyright © 2009 John Wiley & Sons, Ltd.     

Real‐time performance evaluation of asynchronous time division traffic‐aware and delay‐tolerant scheme in ad hoc sensor networks

Wireless infrastructureless networks demand high resource availability with respect to the progressively decreasing energy consumption. A variety of new applications with different service requirements demand fairness to the service provision and classification, and reliability in an end‐to‐end manner. High‐priority packets are delivered within a hard time delay bound whereas improper power management in wireless networks can substantially degrade the throughput and increase the overall energy consumed. In this work a new scheme is being proposed and evaluated in real time using a state‐based layered oriented architecture for energy conservation (EC). The proposed scheme uses the node's self‐tuning scheme, where each node is assigned with a dissimilar sleep and wake time, based on traffic that is destined for each node. This approach is based on stream's characteristics with respect to different caching behavioral and storage‐capacity characteristics, and considers a model concerning the layered connectivity characteristics for enabling the EC mechanism. EC characteristics are modeled and through the designed tiered architecture the estimated metrics of the scheme can be bounded and tuned into certain regulated values. The real‐time evaluation results were extracted by using dynamically moving and statically located sensor nodes. A performance comparison is done with respect to different data traffic priority classifications following a real‐time asymmetrical transmission channel. Results have shown the scheme's efficiency in conserving energy while the topology configuration changes with time. Copyright © 2009 John Wiley & Sons, Ltd.     

网络编码在P2P网络中的应用

网络编码是信息论领域的一个重要突破,它不同于信源编码和信道编码,将网络编码应用到P2P网络中是当前研究热点之一,其中具有分布式特点的随机网络编码可广泛应用于P2P网络。对具有非实时性的P2P文件下载应用,为降低随机网络编码引入的复杂性,可对文件分块进行分代,然后采用代内或代间网络编码技术。对具有实时性的P2P流媒体直播和点播,则需要采用具有优先级意识的网络编码技术,包括分层网络编码,或与推拉技术相结合来实现高效率的P2P流媒体分发。     

P2P流媒体模型的资源传输机制

针对流媒体的点播和直播服务,提出了基于P2P的流媒体应用层多播和点播的解决方案,构建了基于超级节点和普通节点的两层体系结构的视频流媒体模型.描述了模型的总体结构,分析了资源传输机制.基于校园网对模型进行了测试,测试结果表明,模型能够实现基于流媒体应用的多点数据快速互传.     

A self‐adaptive algorithm for super‐peer selection considering the mobility of peers in cognitive mobile peer‐to‐peer networks

Cognitive peer‐to‐peer networks are obtained from a combination of cognitive networking concepts and peer‐to‐peer networks. These networks are able to improve their performance while operating under dynamic and unknown environments. A cognitive peer‐to‐peer network tries to learn an appropriate configuration for itself considering the unknown physical properties of peers. Cognitive mobile peer‐to‐peer networks refer to cognitive peer‐to‐peer networks which are built over mobile ad hoc networks. In these networks, heterogeneity of the mobility of peers and resource limitation in wireless networks create challenges for network management algorithms. Because of the dynamicity of these networks, the management algorithms should be designated in self‐adaptive manner. In one type of these networks, some peers, called super‐peers, undertake to perform network managerial tasks. The mobility of peers leads to connection failure among peers and reselection of new super‐peers. Therefore, the selection of super‐peers, due to their influential role, requires an algorithm that considers the peers' mobility. Up to now, no self‐adaptive algorithm has been designated for super‐peer selection considering the mobility of peers in a self‐adaptive manner. This paper proposes M‐SSBLA, a self‐adaptive algorithm for super‐peer selection considering the mobility of peers based on learning automata. The proposed algorithm is obtained from cooperation between a learning automata‐based cognitive engine and MIS. MIS is a well‐known super‐peer selection algorithm in mobile peer‐to‐peer networks. We compared the proposed algorithm with recently reported algorithms, especially for a network with high mobility. Simulation results show that the proposed algorithm can cover maximum ordinary‐peer with a few super‐peer and improve robustness against super‐peer failures while decreasing maintenance overhead.     

一种基于P2P的流媒体终端流量管理算法建模分析

基于P2P网络的流媒体技术可以向大规模用户群提供高质量、可交互的流媒体服务。本文以流媒体终端的功能模块为基础,探讨了一种P2P网络流媒体终端的分层结构模型,并着重对其中流管理模块中的节点自适应调整(peer adaptation)算法进行了建模分析,通过仿真对设计的模型算法及策略进行了对比验证,表明了同时采用所有策略的方式流量管理效果最好。     

P2P电子商务环境下的动态安全信任管理模型

针对P2P电子商务中的信任评估问题,提出一种基于信任云的动态安全信任管理模型(TCDSTM).TCDSTM利用云理论来刻画信任及信任等级,然后给出具有抗攻击能力的全局信任度融合算法、节点的类型识别和拓扑重构机制.理论分析和仿真实验一致表明,TCDSTM小仅可以抵御共谋、振荡等恶意攻击,而且大大提高了交易成功率.此外,该模型具有较低的通信丌销.     

基于Mesh的P2P流媒体节点选择机制研究

提出一种基于双目标规划的P2P直播模型,综合考虑节点的动态性与异构性,并在实际系统中引入一种有效可行的QF(QoSFirst)节点选择算法,预先探测底层网络,根据节点的数据到达率和ISP拓扑划分选择节点。经实验证明,相比于同类算法,该算法能极大提高系统的平均流服务质量,减少网络负载。     

A location‐aware peer‐to‐peer overlay network

This work describes a novel location‐aware, self‐organizing, fault‐tolerant peer‐to‐peer (P2P) overlay network, referred to as Laptop. Network locality‐aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT‐based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self‐organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location‐aware overlay network without pre‐determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by log_d N, and the joining and leaving overhead is bounded by d log_d N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd.