SOAP Web Services Compression Using Variable and Fixed Length Coding

Dhiah Al-Shammary, I. Khalil
{"title":"SOAP Web Services Compression Using Variable and Fixed Length Coding","authors":"Dhiah Al-Shammary, I. Khalil","doi":"10.1109/NCA.2010.18","DOIUrl":null,"url":null,"abstract":"SOAP Web services create high network traffic because of its generated large XML messages resulting in poor network performance. Therefore, enhancing the performance of Web services by compressing SOAP messages is considered to be an important issue. Compression ratios achieved by most of the existing techniques and tools are not high enough, and even a tiny improvement could save tremendous amount of network bandwidth in emerging cloud and mobile scenarios. In this paper, we try to achieve this objective by proposing two innovative techniques capable of reducing small as well as very large messages. Instead of encoding the characters of XML message individually, Fixed-length encoding and Huffman encoding as a variable-length technique are developed to deal with XML tags as individual input items. XML tree and binary tree are constructed that support the encoding algorithm by removing the closing tags. A high Compression Ratio has been achieved that is up to 7.8 and around 13.5 for large and very large messages respectively.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Ninth IEEE International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2010.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

SOAP Web services create high network traffic because of its generated large XML messages resulting in poor network performance. Therefore, enhancing the performance of Web services by compressing SOAP messages is considered to be an important issue. Compression ratios achieved by most of the existing techniques and tools are not high enough, and even a tiny improvement could save tremendous amount of network bandwidth in emerging cloud and mobile scenarios. In this paper, we try to achieve this objective by proposing two innovative techniques capable of reducing small as well as very large messages. Instead of encoding the characters of XML message individually, Fixed-length encoding and Huffman encoding as a variable-length technique are developed to deal with XML tags as individual input items. XML tree and binary tree are constructed that support the encoding algorithm by removing the closing tags. A high Compression Ratio has been achieved that is up to 7.8 and around 13.5 for large and very large messages respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用可变和固定长度编码的SOAP Web服务压缩
SOAP Web服务产生了很高的网络流量,因为它生成了大量的XML消息,导致网络性能很差。因此,通过压缩SOAP消息来增强Web服务的性能被认为是一个重要的问题。大多数现有技术和工具实现的压缩比都不够高,在新兴的云和移动场景中,即使是微小的改进也可以节省大量的网络带宽。在本文中,我们试图通过提出两种能够减少小消息和非常大消息的创新技术来实现这一目标。代替对XML消息的字符单独编码,开发了固定长度编码和Huffman编码作为变长技术来处理作为单独输入项的XML标记。通过去掉结束标记,构造了支持编码算法的XML树和二叉树。已经实现了高压缩比,大消息和超大消息的压缩比分别高达7.8和13.5左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Performance Model of Gossip-Based Update Propagation QoS-enabled Video Streaming in Wireless Sensor Networks Distributed Clustering Algorithms for Lossy Wireless Sensor Networks Colocation as a Service: Strategic and Operational Services for Cloud Colocation Under the Cloud: A Novel Content Addressable Data Framework for Cloud Parallelization to Create and Virtualize New Breeds of Cloud Applications
×
引用
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