• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Knowledge and Systems Sciences(KSS2004); 20041110-12; Ishikawa(JP) >Hierarchical Peer-to-Peer Search in Distributed Networks Based on JXTA Protocol
【24h】

Hierarchical Peer-to-Peer Search in Distributed Networks Based on JXTA Protocol

机译：基于JXTA协议的分布式网络中的分层对等搜索

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we propose a hierachical peer-to-peer search framework. As it is called ,this search mechanism combines the benefit of hierachical search and peer-to-peer search. Traditional peer-to-peer systems mostly suffer from the nightmare of locating resource. For example , in the Napster model, all queries are routed to a central server, but it can be estimated that no single node can have the complete konwledge of the massive amount of resources on the Internet. To handle the scalability problem of Internet search, we argue that it is more suitable to replace the central node by a scalable network of servers to guide the query routing process. We consequently propose a two-layer framework for network search: the lower layer is a search content provider, while the upper layer is a search route provider. The upper layer, or guide map as we call, provides search information such as resource description and location, but each node of this layer only has partial knowledge about resource description and location informaiton. So these nodes should share knowledge with each other. Furthermore, this layer must be scalable and robust. Considering these requirements ,we can employ peer-to-peer architecture on this layer. This is why we call this two layer search framework hierachical peer-to-peer search. Mixing the characteristics of the decentralized search and the centralized search, the proposed search mechanism is can be regarded as a hybrid peer-to-peer search mechanism. Its concept is similar to the basic idea of JXTA search, in which peers can act as hubs and can register with other hubs as information providers to field queries from other peers based on arbitrary content description registrations, consequently we use JXTA search to enhance the query propagation mechanism in propoesed hierarchical peer-to-peer search infrastructure.
机译：在本文中，我们提出了一种分层的对等搜索框架。所谓，这种搜索机制结合了分层搜索和对等搜索的优势。传统的点对点系统大多遭受资源定位的噩梦。例如，在Napster模型中，所有查询都路由到中央服务器，但是可以估计，没有单个节点可以完全掌握Internet上大量资源的知识。为了处理Internet搜索的可伸缩性问题，我们认为用可伸缩的服务器网络代替中心节点来指导查询路由过程更为合适。因此，我们提出了一个用于网络搜索的两层框架：下层是搜索内容提供者，而上层是搜索路由提供者。上层，即我们所说的指南地图，提供搜索信息，例如资源描述和位置，但是该层的每个节点仅具有关于资源描述和位置信息的部分知识。因此，这些节点应该彼此共享知识。此外，该层必须是可伸缩的并且健壮的。考虑到这些要求，我们可以在此层采用点对点架构。这就是为什么我们将此两层搜索框架称为分层对等搜索。融合了分散式搜索和集中式搜索的特点，提出的搜索机制可以看作是一种混合的对等搜索机制。它的概念类似于JXTA搜索的基本思想，在该概念中，对等方可以充当中心，并可以作为信息提供者向其他中心注册，以基于任意内容描述注册来对其他对等方进行查询，因此，我们使用JXTA搜索来增强查询提出的分层对等搜索基础结构中的传播机制。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号