eSMP: A Multicast Protocol to Minimize SOAP Network Traffic in Low Bandwidth Environments

Web services, which are built on SOAP as the transport protocol, have emerged in recent years as a promising technology to enable interoperability between distributed applications. As such, SOAP may be used to handle a large number of transactions; and consequently it is desirable to have SOAP perform efficiently in high traffic environments. This paper presents eSMP, an extension of our previous work on a similarity-based SOAP multicast protocol (SMP). eSMP offers improvements over SMP in terms of traffic size by using its own routing protocol instead of the conventional shortest path algorithm to route messages to paths that will minimize the number of bytes transmitted in the network. From extensive experiments, it is shown that eSMP achieves a minimum of 25 percent reduction in total network traffic than SMP with a trade-off of 10 percent increase in average response time. Compared to unicast, bandwidth consumptions can by reduced by up to 80 percent when using eSMP and 70 percent when using SMP. Therefore, eSMP is suitable for applications where bandwidth requirement is critical but not time.

[1]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[2]  Edmundo Monteiro,et al.  A Survey of QoS Routing Algorithms , 2022 .

[3]  Zahir Tari,et al.  Optimizing Web Services Performance by Using Similarity-Based Multicast Protocol , 2006, 2006 European Conference on Web Services (ECOWS'06).

[4]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[8]  Michiaki Tatsubori,et al.  Optimizing Web services performance by differential deserialization , 2005, IEEE International Conference on Web Services (ICWS'05).

[9]  Niki Pissinou,et al.  Efficient implementations of bounded shortest multicast algorithm , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[10]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Christian Werner,et al.  WSDL-Driven SOAP Compression , 2005, Int. J. Web Serv. Res..

[12]  Panos M. Pardalos,et al.  Optimization Problems in Multicast Tree Construction , 2006, Handbook of Optimization in Telecommunications.

[13]  Michiaki Tatsubori,et al.  Improving WS-security performance with a template-based approach , 2005, IEEE International Conference on Web Services (ICWS'05).

[14]  Azer Bestavros,et al.  Changes in Web client access patterns: Characteristics and caching implications , 1999, World Wide Web.

[15]  Liang Guo,et al.  QDMR: an efficient QoS dependent multicast routing algorithm , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[16]  Lars Lundberg,et al.  Performance of SOAP in Web Service environment compared to CORBA , 2002, Ninth Asia-Pacific Software Engineering Conference, 2002..

[17]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[18]  Mohamed F. Mokbel,et al.  AN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS , 2001 .

[19]  Michael J. Lewis,et al.  Differential Deserialization for Optimized SOAP Performance , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[20]  Soundar R. T. Kumara,et al.  Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm , 2007, Int. J. Web Serv. Res..