弹性云平台中服务提供商的优化配置方法

Samira Talebi, Hassan Khotanlou, Mansour Esmaeilpour
{"title":"弹性云平台中服务提供商的优化配置方法","authors":"Samira Talebi, Hassan Khotanlou, Mansour Esmaeilpour","doi":"10.5899/2018/JSCA-00071","DOIUrl":null,"url":null,"abstract":"Nowadays considering developments in computing area, cloud computing is regarded as a new appearing technology in high level computations as well as a storage system in which the service suppliers receive money from users based on the amount of using their services. One of the most important necessities of a distributed system, like cloud, is employing an efficient method for discovery of a service which is in harmony with users' needs that helps managing services and timing users' activities. In this paper, an algorithm is introduced for minimizing the number of service registry message in unstructured peer to peer network of cloud platform for execution of which, the genetic algorithm has been benefited of discover an efficient arrangement of service providers as well as exploiting the breadth first search to discover connective arrangements. The execution is done on different arrangements of service providers the results of which show that the mentioned minimizing algorithm has reached to the most efficient arrangement which leads the least service registry messages.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"111 1","pages":"13-19"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A method for optimized arrangement of service providers in elastic cloud platform\",\"authors\":\"Samira Talebi, Hassan Khotanlou, Mansour Esmaeilpour\",\"doi\":\"10.5899/2018/JSCA-00071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays considering developments in computing area, cloud computing is regarded as a new appearing technology in high level computations as well as a storage system in which the service suppliers receive money from users based on the amount of using their services. One of the most important necessities of a distributed system, like cloud, is employing an efficient method for discovery of a service which is in harmony with users' needs that helps managing services and timing users' activities. In this paper, an algorithm is introduced for minimizing the number of service registry message in unstructured peer to peer network of cloud platform for execution of which, the genetic algorithm has been benefited of discover an efficient arrangement of service providers as well as exploiting the breadth first search to discover connective arrangements. The execution is done on different arrangements of service providers the results of which show that the mentioned minimizing algorithm has reached to the most efficient arrangement which leads the least service registry messages.\",\"PeriodicalId\":38638,\"journal\":{\"name\":\"International Journal of Advances in Soft Computing and its Applications\",\"volume\":\"111 1\",\"pages\":\"13-19\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advances in Soft Computing and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5899/2018/JSCA-00071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advances in Soft Computing and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5899/2018/JSCA-00071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

考虑到当今计算领域的发展,云计算被认为是在高级计算领域出现的一种新技术,也是服务提供商根据用户使用其服务的数量从用户那里获得金钱的一种存储系统。分布式系统(如云)最重要的需求之一是采用一种有效的方法来发现与用户需求相协调的服务,从而帮助管理服务和定时用户的活动。本文提出了一种在云平台的非结构化对等网络中最小化服务注册消息数量的算法,该算法利用遗传算法发现服务提供者的有效排列,并利用广度优先搜索发现连接排列。在不同的服务提供者安排上进行了执行,结果表明最小化算法达到了导致最少服务注册消息的最有效安排。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A method for optimized arrangement of service providers in elastic cloud platform
Nowadays considering developments in computing area, cloud computing is regarded as a new appearing technology in high level computations as well as a storage system in which the service suppliers receive money from users based on the amount of using their services. One of the most important necessities of a distributed system, like cloud, is employing an efficient method for discovery of a service which is in harmony with users' needs that helps managing services and timing users' activities. In this paper, an algorithm is introduced for minimizing the number of service registry message in unstructured peer to peer network of cloud platform for execution of which, the genetic algorithm has been benefited of discover an efficient arrangement of service providers as well as exploiting the breadth first search to discover connective arrangements. The execution is done on different arrangements of service providers the results of which show that the mentioned minimizing algorithm has reached to the most efficient arrangement which leads the least service registry messages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Advances in Soft Computing and its Applications
International Journal of Advances in Soft Computing and its Applications Computer Science-Computer Science Applications
CiteScore
3.30
自引率
0.00%
发文量
31
期刊介绍: The aim of this journal is to provide a lively forum for the communication of original research papers and timely review articles on Advances in Soft Computing and Its Applications. IJASCA will publish only articles of the highest quality. Submissions will be evaluated on their originality and significance. IJASCA invites submissions in all areas of Soft Computing and Its Applications. The scope of the journal includes, but is not limited to: √ Soft Computing Fundamental and Optimization √ Soft Computing for Big Data Era √ GPU Computing for Machine Learning √ Soft Computing Modeling for Perception and Spiritual Intelligence √ Soft Computing and Agents Technology √ Soft Computing in Computer Graphics √ Soft Computing and Pattern Recognition √ Soft Computing in Biomimetic Pattern Recognition √ Data mining for Social Network Data √ Spatial Data Mining & Information Retrieval √ Intelligent Software Agent Systems and Architectures √ Advanced Soft Computing and Multi-Objective Evolutionary Computation √ Perception-Based Intelligent Decision Systems √ Spiritual-Based Intelligent Systems √ Soft Computing in Industry ApplicationsOther issues related to the Advances of Soft Computing in various applications.
期刊最新文献
Insider Threat Prevention in the US Banking System Cybersecurity Strategies for Safeguarding Customer’s Data and Preventing Financial Fraud in the United States Financial Sectors Multilevel Thresholding Image Segmentation Based-Logarithm Decreasing Inertia Weight Particle Swarm Optimization Improvement on I-Devices Using L-GCNN Classifier for Smart Mosque Simulation Supervised Learning Algorithms for Predicting Customer Churn with Hyperparameter Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1