成对系统中请求路径的概念形式分析
Analyse formelle de concept pour le routage des requêtes dans les systèmes pair-à-pair
摘要:
对等网络(Peer-to-Peer,P2P)是近年来互联网上访问各种资源的主要技术。这些系统构建了一个包含大量对等点的集群。因此,选择可以回答给定查询的对等体是一个非常困难的问题。通过在查询路由过程中引入语义,可以提高选择算法的效率。我们在本文中提出了一种新的改进版本的语义路由算法LearningPeerSelection(LPS)在CORIA 2009年,一个增量的策略更新知识库和先进的实验研究。为了测试所提出的算法,我们定义了一个层的PeerSim模拟器上的路由。
英文摘要:
The Peer-to-Peer systems (P2P) were led these last years as the major technology of access upon various resources on Internet. These systems build a cluster witch contains a very large number of peers. As the result the selection of peers who can answer for a given query is a very difficult problem. The efficiency of the selection algorithms can be improved by introducing of semantics into the process of queries routing. We present in this paper a novel improved version of our semantic routing algorithm LearningPeerSelection (LPS) presented in CORIA 2009, an incremental strategy of updating knowledge bases and an advanced experimental study. To test the proposed algorithm, we defined a layer of routing on the PeerSim simulator.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。