Hybrid information retrieval policies based on cooperative cache in mobile P2P networks

The concept of Peer-to-Peer (P2P) has been introduced into mobile networks, which has led to the emergence of mobile P2P networks, and originated potential applications in many fields. However,mobile P2P networks are subject to the limitations of transmission range, and highly dynamic and unpredictable network topology, giving rise to many new challenges for efficient information retrieval. In this paper, we propose an automatic and economical hybrid information retrieval approach based on cooperative cache. In this method, the region covered by a mobile P2P network is partitioned into subregions, each of which is identified by a unique ID and known to all peers. All the subregions then constitute a mobile Kademlia (MKad) network. The proposed hybrid retrieval approach aims to utilize the floodingbased and Distributed Hash Table (DHT)-based schemes in MKad for indexing and searching according to the designed utility functions. To further facilitate information retrieval, we present an effective cache update method by considering all relevant factors. At the same time, the combination of two different methods for cache update is also introduced. One of them is pull based on time stamp including two different pulls: an on-demand pull and a periodical pull, and the other is a push strategy using update records. Furthermore, we provide detailed mathematical analysis on the cache hit ratio of our approach. Simulation experiments in NS-2 showed that the proposed approach is more accurate and efficient than the existing methods.     

基于P2P的3G流媒体代理缓存策略

3G时代已经到来,伴随着3G的快速发展,移动流媒体服务的需求迅速增长。由于移动网络带宽远达不到互联网的带宽,流媒体业务的增长将增加网络延迟,影响流媒体的观看质量,因此提出了一种新的基于P2P的3G流媒体缓存代理结构PSPA,配合PSPA设计了代理缓存置换策略SCOP,该设计能有效降低对移动核心网带宽的占用。最后,仿真实验和实验结果分析表明,PSPA体系与代理缓存置换策略SCOP的结合,能有效提高移动流媒体的服务质量,对3G流媒体的应用具有一定的参考价值。     

移动P2P网络的协作缓存优化策略

移动P2P网络具有拓扑动态多变、节点资源有限、网络资源短缺的特点.如何合理地、高效地使用移动节点提供的协作缓存资源、增加移动节点间的协作来减少移动P2P的网络时延、节省带宽、防止拥塞是一个关键问题.深入研究了有限协作缓存--Cache资源的替换策略、重要数据的及时缓存和Cache资源的充分使用问题.并根据蚁群算法的思路,提出了一种基于信息素的Cache替换算法,建立了选取适当存储空间作为Cache的数学模型和推导.理论分析和仿真数据表明该算法能有效提高协作Cache资源的使用率,促进了移动节点间的协作,提高了移动节点从邻居节点获得资源的成功率,并减少了协作Cache资源请求的平均响应时间.     

混合式P2P系统中基于缓存的多项查询方法研究

首先从混合式P2P网络拓扑结构出发,结合DHT思想,提出了基于DHT的层次化P2P网络模型.其次根据在文档集巨大的情况下,用户提交的查询不可能"面面俱到",实际用来回答查询的文档仅仅是文档集中很小的一部分这一思想,在层次化P2P模型的超级节点中建立了分布式缓存,运用分布式索引与缓存技术,提出一种新的方法来解决多项查询问题.即由多项查询中的某个关键字key,根据hash函数定位到负责该key的超级节点,查询该节点上的分布式索引得到缓存具体存储位置,最终将结果返回给用户,如若缓存中没有所要查询的内容,则广播该查询,同时根据系统中的历史广播查询信息来计算某个待选缓存项的利益值,利益最大的待选项加入缓存.一般针对多项查询的泛洪算法往往会造成巨大的网络信息量,提出的方法牺牲了超级节点上一小部分的存储力,缓解了多项查询造成的网络拥挤现象.同时,基于DHT的层次化P2P模型也具有很好的稳定性,不会因为大量节点的动态加入或者退出而无法进行多项查询.     

一种新型的层次P2P搜索模型

在分析现有P2P模型的基础上，提出了一种新的P2P搜索模型，该模型是分层的混合结构，利用分组和建立搜索空间的机制，来提高搜索的效率，增强系统的可扩展性。同时为低带宽节点引入了搜索代理的机制，提高了带宽的利用率，减少了搜索延迟。而且为了增强网络的自恢复性，利用缓存机制引入了备用连接，使搜索模型具有较好的容错能力。     

Optimally designing caches to reduce P2P traffic

Traffic caused by P2P services dominates a large part of traffic on the Internet and imposes significant loads on the Internet, so reducing P2P traffic within networks is an important issue for ISPs. In particular, a huge amount of traffic is transferred within backbone networks; therefore reducing P2P traffic is important for transit ISPs to improve the efficiency of network resource usage and reduce network capital cost. To reduce P2P traffic, it is effective for ISPs to implement cache devices at some router ports and reduce the hop length of P2P flows by delivering the required content from caches. However, the design problem of cache locations and capacities has not been well investigated, although the effect of caches strongly depends on the cache locations and capacities. We propose an optimum design method of cache capacity and location for minimizing the total amount of P2P traffic based on dynamic programming, assuming that transit ISPs provide caches at transit links to access ISP networks. We apply the proposed design method to 31 actual ISP backbone networks and investigate the main factors determining cache efficiency. We also analyze the property of network structure in which deploying caches are effective in reducing P2P traffic for transit ISPs. We show that transit ISPs can reduce the P2P traffic within their networks by about 50-85% by optimally designing caches at the transit links to the lower networks.     

基于XML的P2P网络资源检索系统

结合P2P技术和XML技术在挖掘网络上广泛分布的异构资源的优势,构建了一个基于XML的高效的P2P分布式网络资源检索系统,采用强大的全文检索开源工具包Lucene进行了实现,并对核心功能在基于android平台的移动客户端进行了延伸.本系统的设计和解决方案对于解决网络上异构资源的共享具有重要的借鉴意义.     

混合P2P流媒体的缓存替换算法研究*

给出一种有服务器的混合P2P流媒体系统模型,针对该模型提出了一种对等节点的缓存替换算法,并通过仿真试验验证了该算法的有效性。     

一种基于P2P的视频共享系统的研究与实现

视频点播(VOD)是一种以用户为主导的音视频信息系统。传统的VOD系统多是C/S模式采用服务器机群或者代理缓存的方式来实现,这会带来较大的硬件和管理开销,系统扩展性也难以得到保证。文中提出了一种基于P2P结构的视频点播的设计方案,分析了采用P2P技术以后视频点播系统对于节点闲散资源的利用和保证播放质量等方面的优势,并探讨了在系统设计与实现中的相关技术与方法。     

对等网络中基于语义的音乐信息融合与检索系统研究

随着对等网络中数字音乐内容的丰富,音乐信息检索日益成为对等网络音乐共享系统中的一个关键问题.针对对等网络环境,本文提出了一种基于语义的音乐信息融合与检索系统.文中首先定义了一种可拓展的音乐本体;然后提出了将自动提取的特征信息、用户标注的信息以及网络获取的信息等多信息源进行融合的方法,并且介绍了在CLAM的Annotator模块基础上开发的融合标注工具;继而提出了一种基于RDFPeers架构的静态及动态信息的存储和检索方法.本系统使对等网络中的音乐信息检索从传统的基于文件名、艺术家名等关键字的检索拓展到基于语义的音乐信息检索,同时对该系统的示例模型的评估也验证了本文提出的多信息源融合的方法能够优化系统的准确率和召回率.     

SemreX:一种基于语义相似度的P2P覆盖网络

对等(peer-to-peer)网络的非集中结构、良好的自治性及容错性等特征,使其可能成为Internet上有效的信息共享模型.然而,内容定位问题仍然是大规模P2P网络中信息共享所面临的挑战.SemreX系统是一种P2P网络环境下的文献检索系统.针对SemreX系统,提出一种基于语义相似度的P2P拓扑管理和查询路由算法.仿真实验结果表明,语义拓扑能够有效地提高系统的搜索效率.     

基于P2P主题索引网络的数据库搜索算法

传统的P2P单层网络难于兼顾搜索效率和高动态性，存在单点失效和负载不均等问题，该文利用“双层主题索引网络”构建系统，融合了无结构和有结构网络的优点，采用多哈希函数策略加入节点、发布资源。基于兴趣度cache缓存和相对距离，选取高优先级节点进行通信，使模型在搜索速度、查准程度、单点失效、负载均衡等方面有了很大的改进。     

A hybrid approach for estimating document frequencies in unstructured P2P networks

Scalable search and retrieval over numerous web document collections distributed across different sites can be achieved by adopting a peer-to-peer (P2P) communication model. Terms and their document frequencies are the main components of text information retrieval and as such need to be computed, aggregated, and distributed throughout the system. This is a challenging problem in the context of unstructured P2P networks, since the local document collections may not reflect the global collection in an accurate way. This might happen due to skews in the distribution of documents to peers. Moreover, central assembly of the total information is not a scalable solution due to the excessive cost of storage and maintenance, and because of issues related to digital rights management. In this paper, we present an efficient hybrid approach for aggregation of document frequencies using a hierarchical overlay network for a carefully selected set of the most important terms, together with gossip-based aggregation for the remaining terms in the collections. Furthermore, we present a cost analysis to compute the communication cost of hybrid aggregation. We conduct experiments on three document collections, in order to evaluate the quality of the proposed hybrid aggregation.     

P2P traffic optimization

Peer-to-peer (P2P) based content distribution systems have emerged as the main form for content distribution on the Internet,which can greatly reduce the distribution cost of content providers and improve the overall system scalability.However,the mismatch between the overlay and underlay networks causes large volume of redundant traffic,which intensifies the tension between P2P content providers and ISPs.Therefore,how to efficiently use network resources to reduce the traffic burden on the ISPs is crucial for the sustainable development of P2P systems.This paper surveys the state-of-art P2P traffic optimization technologies from three perspectives:P2P cache,locality-awareness and data scheduling.Technological details,comparison between these technologies and their applicabilities are presented,followed by a discussion of the issues that remain to be addressed and the direction of future content distribution research.     

An optimized strategy for update path selection in unstructured P2P networks

With the growth of P2P file sharing systems, people are no longer satisfied with the sharing of the read-only and static files, and thus the systems with mutually writable and dynamic files have emerged, resulting in the replica inconsistency problem. To maintain the replica consistency, too many update messages need to be redundantly propagated due to the lack of the sharing of globally updated path information in the existing strategies. To address this problem, we propose an optimized strategy for update path selection, which makes the nodes share the update path information by using clone, variation and crossover operations for the update paths. We also present a repeated update strategy to cope with the churn problem so as to maintain replica consistency as far as possible even if some nodes temporarily leave the network. The simulation results show that our strategy can significantly reduce the number of the redundant update messages without lowering the message coverage, thus improving the availability of the unstructured P2P networks.     

大规模DVE场景对等传输机制研究新进展

目的 目前互联网上构建的虚拟世界规模越来越大,但在现实网络带宽有限的情况下,实时传输海量复杂虚拟场景一直都是难以解决的“瓶颈问题”,针对该极具挑战性的问题进行了综述性研究。方法 首先对大规模3维虚拟场景传输的主要技术进行了概述,然后分别对其中的关键技术如大规模虚拟场景的轻量化与流式化技术、P2P-Cloud(Peer to Peer-Cloud)网络架构、资源发现/邻居发现策略、不同网络架构的虚拟场景数据分发策略和移动网络场景传输等进行了详细综述。结果 阐明了虚拟场景传输主要技术之间的关系,并通过对已有经典成果的对比,分析了它们的优缺点及需要解决的关键问题。结论 分别从虚拟场景传输的场景预处理、基于云的混合网络架构和移动网络中的场景传输这3个发展方向做了前瞻性的展望。     

P2P流量优化

基于peer-to-peer(P2P)技术的内容分发系统已成为互联网内容分发的重要形式,它能大幅减轻P2P内容提供商的分发代价,提高系统的可扩展性.但是,覆盖网络和底层网络的失配导致了网络资源的浪费,产生了大量的冗余流量,激化了P2P内容提供商和网络运营商(ISP)之间的矛盾.因此,如何有效利用底层网络的带宽资源,降低P2P内容分发系统对ISP网络的流量压力,是P2P系统得以良性和可持续发展的关键.本文综述了P2P内容分发系统流量优化的相关技术研究现状.从P2Pcache、位置感知技术和数据调度算法3个维度出发详细阐述了不同的技术在P2P流量优化中的作用,对各种技术进行了详细的综述和对比分析,探讨了各种技术的适用环境,指出了存在的问题和未来内容分发的发展方向.     

P2P搜索新技术：智能搜索技术

在P2P网络中正确高效地搜索信息十分重要,然而现有的搜索技术并不能很好地满足用户要求。文中提出了由历史记录、相似度和站点优先级3部分组成的新的信息搜索技术———智能搜索技术。在智能搜索技术中每个站点都各自记录以往搜索的历史记录,以此结合搜索要求计算出最可能拥有所需结果的站点,最后仅向这些站点发送搜索请求。通过在中间件上的测试,比较了不同信息搜索技术的性能,智能搜索技术能在使用较少搜索消息的情况下得到较高的搜索成功率。     

移动环境下构建P2P网络研究综述

P2P作为当前研究的一个热点方向,吸引了众多研究者和机构的注意力.P2P技术在移动网络上的应用,由于移动网络的受限特点,决定了其设计原则有别于其它网络,而在其它网络结构中运行良好的技术并不一定适合于移动P2P网络.综述和探讨了在不同移动环境下构建P2P网络将面临的一些主要问题,包括移动P2P的体系结构、路由协议及网络安全等问题.     

一种基于信任机制的混合式P2P模型

以改善P2P网络的安全性能为目标，介绍了基于关键节点的混合式P2P结构和基于信誉的信任机制，提出了一种基于该信任机制的混合式P2P模型，描述了该模型的工作机制。利用该模型可以在两个对等实体之间建立高效、可靠的信任关系，有效防止恶意攻击，提高P2P网络的效率和安全。