【24h】

TAP: Topology-A ware Peer-to-Peer Network with Expanding-Area Lookup

机译:TAP:具有扩展区域查找功能的拓扑-ware对等网络

获取原文
获取原文并翻译 | 示例

摘要

To solve the scalability problem of unstructured Peer-to-Peer(P2P) network, Distributed Hash Table(DHT)-based P2P network is proposed. DHT-based mechanism, however, does not reflect physical topology of P2P network, so that messages are routed inefficiently. As a result, it makes long latency of lookup and overload in networks. In this paper, we propose a new Topology-Aware Peer-to-Peer(TAP) mechanism which adopts DHT-based approach but solves the problem of inefficient routing of lookup messages. The key idea of TAP is to generate node identifier(Nodeld) and object identifier(ObjectId) with hierarchical topology information like country, province and organization. An object is inserted to each level of area and then, nodes lookup the object with expanding area gradually. It leads to fast lookup and download which is 10 ~ 20 times and 2 times faster than Chord respectively in our experiment. In addition, we can acquire some features like locality, cache-like effect and local broadcast.
机译:为解决非结构化P2P网络的可扩展性问题,提出了一种基于分布式哈希表(DHT)的P2P网络。但是,基于DHT的机制不能反映P2P网络的物理拓扑,因此消息的路由效率很低。结果,它使得网络中查找和过载的等待时间较长。在本文中,我们提出了一种新的拓扑感知对等(TAP)机制,该机制采用基于DHT的方法,但解决了查找消息路由效率低的问题。 TAP的关键思想是使用国家,省和组织等分层拓扑信息来生成节点标识符(NodeId)和对象标识符(ObjectId)。将对象插入到每个级别的区域,然后,节点逐步查找具有扩展区域的对象。在我们的实验中,它可以实现快速查找和下载,分别比Chord快10〜20倍和2倍。此外,我们可以获得一些功能,例如位置性,类似缓存的效果和本地广播。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号