一种用于大规模分散云中服务发现的覆盖方法

S. Liew, Ee Na Teoh, P. Lau, P. K. Chong, A. Nazir, E. Karuppiah, Y. M. Yassin
{"title":"一种用于大规模分散云中服务发现的覆盖方法","authors":"S. Liew, Ee Na Teoh, P. Lau, P. K. Chong, A. Nazir, E. Karuppiah, Y. M. Yassin","doi":"10.1109/APCLOUDCC.2012.6486514","DOIUrl":null,"url":null,"abstract":"Service discovery is a critical feature in cloud computing. It is often centrally controlled within the cloud fabric, which may lead to many risks, such as performance bottleneck and single point of failure. This paper proposes a new service discovery approach based on Pastry, i.e. a structured peer-to-peer network model, to leverage large-scale decentralized cloud computing. In the proposed P2P-Cloud framework, all virtual machines running in a cloud environment on heterogeneous hosts are considered as peer nodes. Each node has its own resources to share and may request resources from other nodes. In addition, each node has a unique NodeID and each service has a unique ServiceID, generated by a hash function. Pastry is used because it maintains locality while performing routing. To reduce complexity, we further propose a fixed-length prefix, say the first m bits, of the ServiceID to be used as the key for service advertisement and discovery. This enables the service capability of a node to be advertised at multiple peer nodes (known as directory nodes of the service) and thus increases the chance that a user can discover within its proximity, a node which can provide the service required. Our proposed prefix routing approach preserves the locality property of Pastry, and the lookup process for service advertisement/discovery has an order of O(logBM), where B is the number base (i.e. radix) used for constructing the Pastry routing table, and M = 2m is the total number of possible keys in the network.","PeriodicalId":331441,"journal":{"name":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An overlay approach for service discovery in a large-scale decentralized cloud\",\"authors\":\"S. Liew, Ee Na Teoh, P. Lau, P. K. Chong, A. Nazir, E. Karuppiah, Y. M. Yassin\",\"doi\":\"10.1109/APCLOUDCC.2012.6486514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service discovery is a critical feature in cloud computing. It is often centrally controlled within the cloud fabric, which may lead to many risks, such as performance bottleneck and single point of failure. This paper proposes a new service discovery approach based on Pastry, i.e. a structured peer-to-peer network model, to leverage large-scale decentralized cloud computing. In the proposed P2P-Cloud framework, all virtual machines running in a cloud environment on heterogeneous hosts are considered as peer nodes. Each node has its own resources to share and may request resources from other nodes. In addition, each node has a unique NodeID and each service has a unique ServiceID, generated by a hash function. Pastry is used because it maintains locality while performing routing. To reduce complexity, we further propose a fixed-length prefix, say the first m bits, of the ServiceID to be used as the key for service advertisement and discovery. This enables the service capability of a node to be advertised at multiple peer nodes (known as directory nodes of the service) and thus increases the chance that a user can discover within its proximity, a node which can provide the service required. Our proposed prefix routing approach preserves the locality property of Pastry, and the lookup process for service advertisement/discovery has an order of O(logBM), where B is the number base (i.e. radix) used for constructing the Pastry routing table, and M = 2m is the total number of possible keys in the network.\",\"PeriodicalId\":331441,\"journal\":{\"name\":\"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCLOUDCC.2012.6486514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCLOUDCC.2012.6486514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

服务发现是云计算中的一个关键特性。它通常在云结构中集中控制,这可能会导致许多风险,例如性能瓶颈和单点故障。本文提出了一种新的基于糕点的服务发现方法,即结构化的点对点网络模型,以利用大规模分散的云计算。在提出的P2P-Cloud框架中,在异构主机上的云环境中运行的所有虚拟机都被视为对等节点。每个节点都有自己的共享资源,并且可以从其他节点请求资源。此外,每个节点都有一个唯一的NodeID,每个服务都有一个唯一的ServiceID,这是由散列函数生成的。使用糕点是因为它在执行路由时保持局部性。为了降低复杂性,我们进一步提出了一个固定长度的前缀,比如ServiceID的前m位,作为服务发布和发现的密钥。这使得节点的服务能力可以在多个对等节点(称为服务的目录节点)上发布,从而增加了用户在其附近发现可以提供所需服务的节点的机会。我们提出的前缀路由方法保留了Pastry的局部性,服务发布/发现的查找过程为O(logBM)阶,其中B是用于构造Pastry路由表的基数(即基数),M = 2m是网络中可能的键的总数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An overlay approach for service discovery in a large-scale decentralized cloud
Service discovery is a critical feature in cloud computing. It is often centrally controlled within the cloud fabric, which may lead to many risks, such as performance bottleneck and single point of failure. This paper proposes a new service discovery approach based on Pastry, i.e. a structured peer-to-peer network model, to leverage large-scale decentralized cloud computing. In the proposed P2P-Cloud framework, all virtual machines running in a cloud environment on heterogeneous hosts are considered as peer nodes. Each node has its own resources to share and may request resources from other nodes. In addition, each node has a unique NodeID and each service has a unique ServiceID, generated by a hash function. Pastry is used because it maintains locality while performing routing. To reduce complexity, we further propose a fixed-length prefix, say the first m bits, of the ServiceID to be used as the key for service advertisement and discovery. This enables the service capability of a node to be advertised at multiple peer nodes (known as directory nodes of the service) and thus increases the chance that a user can discover within its proximity, a node which can provide the service required. Our proposed prefix routing approach preserves the locality property of Pastry, and the lookup process for service advertisement/discovery has an order of O(logBM), where B is the number base (i.e. radix) used for constructing the Pastry routing table, and M = 2m is the total number of possible keys in the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信