Clustering SOAP Web Services on Internet Computing Using Fast Fractals

Dhiah Al-Shammary, I. Khalil, L. George
{"title":"Clustering SOAP Web Services on Internet Computing Using Fast Fractals","authors":"Dhiah Al-Shammary, I. Khalil, L. George","doi":"10.1109/NCA.2011.65","DOIUrl":null,"url":null,"abstract":"The interoperability of Web services has resulted in its adoption for recently-emerging cloud platforms. SOAP (Simple Object Access Protocol) is considered as the main platform independent communication tool for the Cloud Web service. Generally, Cloud Web services suffer performance bottlenecks and congestions that are mainly caused by the encoding of XML messages as they are bigger than the real payloads. In this paper, Fractal clustering model is proposed to compute the Fractal clustering similarity of SOAP messages in order to cluster them and enable the aggregation of SOAP messages to significantly reduce the size of the aggregated SOAP messages. Furthermore, as Fractal is a well-known as a time-consuming technique especially for large dataset, two fast Fractal clustering models have been proposed that are aiming to reduce the required clustering time. The proposed fast Fractal models have tremendously outperformed the classical Fractal model in terms of the processing time and have outperformed both K-means and PCA combined with K-means models in terms of both the processing time and SOAP messages size reduction.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 10th International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2011.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The interoperability of Web services has resulted in its adoption for recently-emerging cloud platforms. SOAP (Simple Object Access Protocol) is considered as the main platform independent communication tool for the Cloud Web service. Generally, Cloud Web services suffer performance bottlenecks and congestions that are mainly caused by the encoding of XML messages as they are bigger than the real payloads. In this paper, Fractal clustering model is proposed to compute the Fractal clustering similarity of SOAP messages in order to cluster them and enable the aggregation of SOAP messages to significantly reduce the size of the aggregated SOAP messages. Furthermore, as Fractal is a well-known as a time-consuming technique especially for large dataset, two fast Fractal clustering models have been proposed that are aiming to reduce the required clustering time. The proposed fast Fractal models have tremendously outperformed the classical Fractal model in terms of the processing time and have outperformed both K-means and PCA combined with K-means models in terms of both the processing time and SOAP messages size reduction.
基于快速分形的互联网计算上的SOAP Web服务聚类
Web服务的互操作性使其被最近出现的云平台所采用。SOAP(简单对象访问协议)被认为是云Web服务独立于平台的主要通信工具。通常,云Web服务会遇到性能瓶颈和拥塞,这主要是由XML消息编码引起的,因为它们比实际有效负载大。本文提出了分形聚类模型来计算SOAP消息的分形聚类相似度,以便对SOAP消息进行聚类,使SOAP消息的聚合能够显著减小聚合SOAP消息的大小。此外,由于分形是一种众所周知的耗时技术,特别是对于大数据集,提出了两种快速分形聚类模型,旨在减少所需的聚类时间。所提出的快速分形模型在处理时间方面大大优于经典分形模型,并且在处理时间和SOAP消息大小减少方面优于K-means和结合K-means模型的PCA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信