首页> 外文会议>IEEE International Symposium on Parallel and Distributed Processing >An Efficient Search Algorithm without Memory for Peer-to-Peer Cloud Computing Networks
【24h】

An Efficient Search Algorithm without Memory for Peer-to-Peer Cloud Computing Networks

机译:没有内存的高效搜索算法,用于对等云计算网络

获取原文

摘要

In recent years, as the rapid development of the technology about Peer-to-Peer (P2P) networks and the cloud computing technology, various applications of P2P technology become very widespread in most cloud computing distributed network applications. P2P cloud computing networks are unstructured and are an important component to implement next generation internet. How to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, and it is one of the greatest concerns to users. This paper first describes the basic flooding P2P network search method, which is from the analyzing the pros and cons of several new search methods. After that, a cache-based search algorithm is proposed: When a node of the remaining load capacity is high, it will become the center node and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache. At the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation results show that the algorithm can effectively improve the hit rates of resources searching, and reduce the query delay in cloud computing networks.
机译:近年来,随着对等对等(P2P)网络和云计算技术的技术的快速发展,P2P技术的各种应用在大多数云计算分布式网络应用中变得非常普遍。 P2P云计算网络是非结构化的,是实现下一代互联网的重要组成部分。如何快速有效地搜索P2P网络中的资源已成为最关键的问题之一,它是用户最大的关切之一。本文首先介绍了基本泛洪P2P网络搜索方法,它来自分析几种新搜索方法的优缺点。之后,提出了一种基于缓存的搜索算法:当剩余负载容量的节点很高时,它将成为中心节点,并将联合拓扑区域与附近节点一起形成,然后中心节点和普通节点也需要存储索引缓存。在本地区域,将复制到本地的过热资源(即内容缓存)。仿真结果表明,该算法可以有效地提高资源搜索的命中率,降低云计算网络中的查询延迟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号