The Community for Technology Leaders
RSS Icon
Issue No.02 - April-June (2008 vol.1)
pp: 88-103
Khoi Ahn Phan , Ericson Australia Pty Ltd, Sydney
Zahir Tari , RMIT University, Melbourne
Peter Bertok , RMIT University, Melbourne
Web Services technology provided several advantages over other technologies, however it still has serious limitations, including high latency and high protocol overhead. To improve performance, SOAP network traffic needs to be substantially reduced. This paper presents a novel approach, called similarity-based SOAP multicast protocol (SMP), to address the issue of latency. SMP reduces network traffic by aggregating syntactically similar SOAP messages to form a "compact SMP message";. The addresses of clients are encoded as strings in the SMP message header. The similarity of SOAP messages is measured in pairs and is based both on the message template and on the values of each XML tag in the messages. Each XML node in a SOAP message is indexed with an identifier and its position in the SOAP message. Only the indexed form of a SOAP message is sent to clients. Intermediary routers along the paths from server to clients parse the content of each SMP message passing through them and perform necessary operations to forward it to neighbouring routers. Experiments show that SMP can achieve up to 70% reduction in network traffic compared to traditional SOAP unicast.
Distributed applications, Web-based services
Khoi Ahn Phan, Zahir Tari, Peter Bertok, "Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services", IEEE Transactions on Services Computing, vol.1, no. 2, pp. 88-103, April-June 2008, doi:10.1109/TSC.2008.8
[1] C. Werner, C. Buschmann, T. Jacker, and S. Fischer, “Bandwidth and Latency Considerations for Efficient SOAP Messaging,” Int'l J. Web Services Research, vol. 3, no. 1, pp. 49-67, 2006.
[2] R. Elfwing, U. Paulsson, and L. Lundberg, “Performance of SOAP in Web Service Environment Compared to CORBA,” Proc. Ninth Asia-Pacific Software Eng. Conf. (APSEC '02), pp. 84-94, 2002.
[3] C. Werner, C. Buschmann, and S. Fischer, “Compressing SOAP Messages by Using Differential Encoding,” Proc. IEEE Int'l Conf. Web Services (ICWS '04), pp. 540-547, 2004.
[4] T. Suzumura, T. Takase, and M. Tatsubori, “Optimizing Web Services Performance by Differential Deserialization,” Proc. IEEE Int'l Conf. Web Services (ICWS '05), pp. 185-192, 2005.
[5] K. Devaram and D. Andresen, “SOAP Optimization via Parameterized Client-Side Caching,” Proc. Second Int'l Symp. Cluster Computing and the Grid (CCGrid '02), 439-312, 2002.
[6] D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel, “ALMI: An Application Level Multicast Infrastructure,” Proc. Third Usenix Symp. Internet Technologies and Systems (USITS '01), pp. 49-60, 2001.
[7] B. Zhang, S. Jamin, and L. Zhang, “Host Multicast: A Framework for Delivering Multicast to End Users,” Proc. IEEE INFOCOM '02, pp. 1366-1375, 2002.
[8] N. Abu-Ghazaleh, M. Lewis, and M. Govindaraju, “Differential Serialization for Optimized SOAP Performance,” Proc. 13th IEEE Int'l Symp. High Performance Distributed Computing (HPDC '04), pp.5-64, 2004.
[9] T. Takase, H. Miyashita, T. Suzumura, and M. Tatsubori, “An Adaptive, Fast, and Safe XML Parser Based on Byte Sequences Memorization,” Proc. 14th Int'l Conf. World Wide Web (WWW '05), pp. 692-701, 2005.
[10] S. Makino, M. Tatsubori, K. Tamura, and Y. Nakamura, “Improving WS-Security Performance with a Template-Based Approach,” Proc. IEEE Int'l Conf. Web Services (ICWS '05), pp. 581-588, 2005.
[11] A. Laux and L. Martin, XUpdate Working Draft, http://xmldb-org. xupdate-wd.html, 2000.
[12] R. Boivie, N. Feldman, and C. Metz, “Small Group Multicast: A New Solution for Multicasting on the Internet,” IEEE Internet Computing, vol. 4, no. 4, pp. 75-79, 2000.
[13] A. Boudani, A. Guitton, and B. Cousin, “GXcast: Generalized Explicit Multicast Routing Protocol,” Proc. Ninth Int'l Symp. Computers and Comm. (ISCC '04), pp. 1012-1017, 2004.
[14] A. Boudani and B. Cousin, “SEM: A New Small Group Multicast Routing Protocol,” Proc. 10th Int'l Conf. Telecomm. (ICT '03), pp.450-455, 2003.
[15] C. Dorneles et al., “Measuring Similarity between Collection of Values,” Proc. Sixth Ann. ACM Int'l Workshop Web Information and Data Management (WDM '04), pp. 56-63, 2004.
[16] P. Ganesan, H. Garcia-Molina, and J. Widom, “Exploiting Hierarchical Domain Structure to Compute Similarity,” ACM Trans. Information Systems, vol. 21, no. 1, pp. 1046-8188, 2003.
[17] G.I. Ivchenko1 and S.A. Honov, “On the Jaccard Similarity Test,” J. Math. Sciences, vol. 88, no. 6, pp. 789-794, 2006.
[18] V.I. Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions and Reversals,” Cybernetics and Control Theory J., vol. 10, no. 8, pp. 707-710, 1966.
[19] A. Maedche and S. Staab, “Comparing Ontologies—Similarity Measures and a Comparison Study,” Technical Report 408, Inst. AIFB, Univ. of Karlsruhe, 2001.
[20] Extensible Markup Language (XML), World Wide Web Consortium (W3C), http://www.w3.orgXML/, May 2007.
[21] Y. Ma and R. Chbeir, “Content and Structure Based Approach For XML Similarity,” Proc. Fifth IEEE Int'l Conf. Computer and Information Technology (CIT '05), pp. 136-140, 2005.
[22] A. Mouat, XML Diff and Patch Utilities, http://diffxml.sourceforge. net/docsdocs.html , 2002.
[23] M. Dewey, “Dewey Decimal Classification,” A Classification and Subject Index for Cataloguing and Arranging the Books and Pamphlets of a Library, Kingsport Press,, 2004.
[24] A. Levitin, Introduction to the Design and Analysis of Algorithms, second ed. Addison-Wesley, pp. 165-167, 2007.
[25] J. Lu, T.W. Ling, C.Y Chan, and T. Chen, “From Region Encoding to Extended Dewey: On Efficient Processing of XML Twig Pattern Matching,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 193-204, 2005.
[26] N. Zhang, K. Agrawal, and T. Ozsu, “BlossomTree: Evaluating XPaths in FLWOR Expressions,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 388-389, 2005.
[27] W. Liang and H. Yokota, “LAX: An Efficient Approximate XML Join Based on Clustered Leaf Nodes for XML Data Integration,” Proc. 22nd British Nat'l Conf. Databases (BNCOD '05), pp. 82-97, 2005.
[28] G.K. Zipf, Human Behaviour and the Principle of Least-Effort. Addison-Wesley, 1949.
[29] P. Barford, A. Bestavros, A. Bradley, and M. Crovella, “Changes in Web Client Access Patterns: Characteristics and Caching Implications,” World Wide Web J., vol. 2, no. 2, pp. 15-28, 1999.
[30] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM '99, pp. 126-134, 1999.
[31] A. Roy, OSPF Version 2, IETF RFC 1247,, 1991.
[32] M.K. Shin, Y.J. Kim, K.S. Park, and S.A. Kim, “Explicit Multicast Extension (Xcast+) for Efficient Multicast Packet Delivery,” ETRI J., vol. 23, no. 4, pp. 202-240, 2001.
[33] K.A. Phan, Z. Tari, and P. Bertok, “Optimizing Web Services Performance by Using Similarity-Based Multicast Protocol,” Proc. Fourth European Conf. Web Services (ECOWS '06), pp. 119-128, Dec. 2006.
[34] A. Varga, OMNet++ Discrete Event Simulation System, http:/, 2006.
[35] C. Werner, C. Buschmann, and F. Fischer, “WSDL-Driven SOAP Compression,” Int'l J. Web Services Research, vol. 2, no. 1, pp. 18-35, 2005.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool