Abstract
SOAP, a de-facto communication protocol of Web services, is popular for its interoperability across organisations. However, SOAP is based on XML and therefore inherits XML’s disadvantage of having voluminous messages. When there are many transactions requesting similar server operations, using conventional SOAP unicast to send SOAP response messages can generate a very large amount of traffic [7]. This paper presents a traffic-constrained SMP routing protocol, called tc-SMP, which is an extension of our previous work on a similarity-based SOAP multicast protocol (SMP) [11]. Tc-SMP looks at the network optimization aspect of SMP and proposes alternative message delivery paths that minimize total network traffic. A tc-SMP algorithm, based on an incremental approach, is proposed and compared for its efficiency and performance advantages over SMP. Simple heuristic methods are also implemented to improve results. From extensive experiments, it is shown that tc-SMP achieves a minimum of 25% reduction in total network traffic compared to SMP with a trade-off of 10% increase in average response time. Compared to conventional unicast, bandwidth consumption can by reduced by up to 70% when using tc-SMP and 50% when using SMP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Ghazaleh, N., Lewis, M.: Differential deserialization for optimized soap performance. In: Proceedings of the 2005 ACM/IEEE Conference on Super-Computing, Seattle, WA, USA, pp. 21–31 (November 2005)
Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16(1), 87–90 (1958)
Chakraborty, D., Chakraborty, G., Shiratori, N.: A dynamic multicast routing satisfying multiple QoS constraints. International Journal of Network Management 13(5), 321–335 (2003)
Chen, S., Nahrstedt, K.: An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions. IEEE Networks Magazine, Special Issue on Transmission and Distribution of Digital Video 12(6), 64–79 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, vol. 2, pp. 595–601. MIT Press and McGraw-Hill (2001)
Elfwing, R., Paulsson, U., Lundberg, L.: Performance of SOAP in Web service environment compared to CORBA. In: Proceedings of the 9th Asia-Pacific Software Engineering Conference, Gold Coast, Australia, pp. 84–94. IEEE Computer Society Press, Los Alamitos (2002)
Govindaraju, M., Slominski, A., Chiu, K., Liu, P., van Engelen, R., Lewis, M.J.: Toward characterizing the performance of SOAP toolkits. In: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, Pittsburgh, USA, pp. 365–372. IEEE Computer Society, Los Alamitos (2004)
Hwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. Elsevier, North-Holland (1992)
Oliveira, C., Pardalos, P., Resende, M.: Optimization problems in multicast tree construction. In: Handbook of Optimization in Telecommunications, pp. 701–733. Kluwer, Dordrecht (2005)
Paul, P., Raghavan, S.: Survey of QoS routing. In: Proceedings of the 15th International Conference on Computer Communication, Mumbai, India, pp. 50–75. International Council for Computer Communication (August 2002)
Phan, K.A., Tari, Z., Bertok, P.: Optimizing Web services performance by using similarity-based multicast protocol. In: Proceedings of the 4th European Conference on Web Services, Zurich, Switzerland, pp. 119–128 (December 2006)
Shaikh, A., Shin, K.: Destination-driven routing for low-cost multicast. IEEE Journal of Selected Areas in Communications 15(3), 373–381 (1997)
Suzumura, T., Takase, T., Tatsubori, M.: Optimizing Web services performance by differential deserialization. In: Proceedings of the IEEE International Conference on Web Services, Orlando, Florida, USA, pp. 185–192. IEEE Computer Society Press, Los Alamitos (2005)
Varga, A.: OMNet++ Discrete Event Simulation System, URL (2006), http://www.omnetpp.org
Werner, C., Buschmann, C., Fischer, F.: WSDL-driven SOAP compression. International Journal of Web Services Research 2(1), 18–35 (2005)
Yuan, X.: Heuristics algorthims for multiconstrained quality-of-service routing. IEEE/ACM Transactions on Networking 10(2), 244–256 (2002)
Zipf, G.K.: Human Behaviour and the Principle of Least-Effort. Addison-Wesley, Cambridge MA (1949)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phan, K.A., Bertok, P., Fry, A., Ryan, C. (2007). Minimal Traffic-Constrained Similarity-Based SOAP Multicast Routing Protocol. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS. OTM 2007. Lecture Notes in Computer Science, vol 4803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76848-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-76848-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76846-3
Online ISBN: 978-3-540-76848-7
eBook Packages: Computer ScienceComputer Science (R0)