{"title":"使用可变和固定长度编码的SOAP Web服务压缩","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":"{\"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}","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}
SOAP Web Services Compression Using Variable and Fixed Length Coding
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.