C-DRM:解决云服务选择不确定性的合并P-TOPSIS熵技术

IF 2 4区 计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS Information Technology and Control Pub Date : 2022-09-23 DOI:10.5755/j01.itc.51.3.30881
K. Nivitha, Pabitha Parameshwaran
{"title":"C-DRM:解决云服务选择不确定性的合并P-TOPSIS熵技术","authors":"K. Nivitha, Pabitha Parameshwaran","doi":"10.5755/j01.itc.51.3.30881","DOIUrl":null,"url":null,"abstract":"Cloud Computing is diversified with its services exponentially and lured large number of consumers towards the technology indefinitely. It has become a highly challenging problem to satiate the user requirements. Most of the existing system ingest large search space or provide inappropriate service; hence, there is a need for the reliable and space competent service selection/ranking in the cloud environment. The proposed work introduces a novel pruning method and Dual Ranking Method (DRM) to rank the services from n services in terms of space conserving and providing reliable service quenching the user requirements as well. Dual Ranking Method (DRM) is proposed focusing on the uncertainty of user preferences along with their priorities; converting it to weights with the use of Jensen-Shannon (JS) Entropy Function. The ranking of service is employed through Priority-Technique for Order of Preference by Similarity to Ideal Solution (P-TOPSIS) and space complexity is reduced by novel Utility Pruning method. The performance of the proposed work  Clustering – Dual Ranking Method (C-DRM) is estimated in terms of accuracy, Closeness Index (CI) and space complexity have been validated through case study where results outperforms the existing approaches","PeriodicalId":54982,"journal":{"name":"Information Technology and Control","volume":"38 1","pages":"592-605"},"PeriodicalIF":2.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"C-DRM: Coalesced P-TOPSIS Entropy Technique addressing Uncertainty in Cloud Service Selection\",\"authors\":\"K. Nivitha, Pabitha Parameshwaran\",\"doi\":\"10.5755/j01.itc.51.3.30881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing is diversified with its services exponentially and lured large number of consumers towards the technology indefinitely. It has become a highly challenging problem to satiate the user requirements. Most of the existing system ingest large search space or provide inappropriate service; hence, there is a need for the reliable and space competent service selection/ranking in the cloud environment. The proposed work introduces a novel pruning method and Dual Ranking Method (DRM) to rank the services from n services in terms of space conserving and providing reliable service quenching the user requirements as well. Dual Ranking Method (DRM) is proposed focusing on the uncertainty of user preferences along with their priorities; converting it to weights with the use of Jensen-Shannon (JS) Entropy Function. The ranking of service is employed through Priority-Technique for Order of Preference by Similarity to Ideal Solution (P-TOPSIS) and space complexity is reduced by novel Utility Pruning method. The performance of the proposed work  Clustering – Dual Ranking Method (C-DRM) is estimated in terms of accuracy, Closeness Index (CI) and space complexity have been validated through case study where results outperforms the existing approaches\",\"PeriodicalId\":54982,\"journal\":{\"name\":\"Information Technology and Control\",\"volume\":\"38 1\",\"pages\":\"592-605\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Technology and Control\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.5755/j01.itc.51.3.30881\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Technology and Control","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.5755/j01.itc.51.3.30881","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 6

摘要

云计算的服务呈指数级多样化,吸引了大量的消费者无限期地使用这项技术。如何满足用户的需求已成为一个极具挑战性的问题。现有系统大多占用较大的搜索空间或提供不适当的服务;因此,需要在云环境中进行可靠的、空间合理的服务选择/排序。提出了一种新的剪枝方法和双排序方法(Dual Ranking method, DRM),从节省空间和提供满足用户需求的可靠服务的角度对n个服务进行排序。针对用户偏好及其优先级的不确定性,提出了双排序方法;利用Jensen-Shannon (JS)熵函数将其转换为权重。该方法采用理想解相似性优先排序技术(P-TOPSIS)对服务进行排序,并采用新的效用修剪方法降低空间复杂度。本文提出的聚类-双排序方法(C-DRM)的性能在准确性方面进行了估计,通过案例研究验证了接近指数(CI)和空间复杂性,结果优于现有方法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
C-DRM: Coalesced P-TOPSIS Entropy Technique addressing Uncertainty in Cloud Service Selection
Cloud Computing is diversified with its services exponentially and lured large number of consumers towards the technology indefinitely. It has become a highly challenging problem to satiate the user requirements. Most of the existing system ingest large search space or provide inappropriate service; hence, there is a need for the reliable and space competent service selection/ranking in the cloud environment. The proposed work introduces a novel pruning method and Dual Ranking Method (DRM) to rank the services from n services in terms of space conserving and providing reliable service quenching the user requirements as well. Dual Ranking Method (DRM) is proposed focusing on the uncertainty of user preferences along with their priorities; converting it to weights with the use of Jensen-Shannon (JS) Entropy Function. The ranking of service is employed through Priority-Technique for Order of Preference by Similarity to Ideal Solution (P-TOPSIS) and space complexity is reduced by novel Utility Pruning method. The performance of the proposed work  Clustering – Dual Ranking Method (C-DRM) is estimated in terms of accuracy, Closeness Index (CI) and space complexity have been validated through case study where results outperforms the existing approaches
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Technology and Control
Information Technology and Control 工程技术-计算机:人工智能
CiteScore
2.70
自引率
9.10%
发文量
36
审稿时长
12 months
期刊介绍: Periodical journal covers a wide field of computer science and control systems related problems including: -Software and hardware engineering; -Management systems engineering; -Information systems and databases; -Embedded systems; -Physical systems modelling and application; -Computer networks and cloud computing; -Data visualization; -Human-computer interface; -Computer graphics, visual analytics, and multimedia systems.
期刊最新文献
Model construction of big data asset management system for digital power grid regulation Melanoma Diagnosis Using Enhanced Faster Region Convolutional Neural Networks Optimized by Artificial Gorilla Troops Algorithm A Scalable and Stacked Ensemble Approach to Improve Intrusion Detection in Clouds Traffic Sign Detection Algorithm Based on Improved Yolox Apply Physical System Model and Computer Algorithm to Identify Osmanthus Fragrans Seed Vigor Based on Hyperspectral Imaging and Convolutional Neural Network
×
引用
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