Minimal Traffic-Constrained Similarity-Based SOAP Multicast Routing Protocol

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.

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

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

[3]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

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

[5]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[6]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[7]  Norio Shiratori,et al.  A dynamic multicast routing satisfying multiple QoS constraints , 2003, Int. J. Netw. Manag..

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

[9]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[10]  YuanXin.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002 .

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

[12]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[13]  S. V. Raghavan,et al.  Survey of QoS routing , 2002 .

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

[15]  Pu Liu,et al.  Toward characterizing the performance of SOAP toolkits , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[16]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[17]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

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

[19]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.