QoS-aware service replication

Service composition is a useful technique to assemble light, independent services to meet the complicated and dynamic requirements. Previous research has addressed the quality-of-service (QoS) aware composition path selection problem. However, as the requests growing, the selected service composition path may violate the QoS requirements. In this case, more service replicas should be deployed on suitable nodes to improve the QoS. But which service component should be selected and where these service replicas should be deployed is a challenge. In this paper, we make a deep study on this service replication problem. We give a detailed description of service replication triggering time. And then, we propose LDCS (<u>L</u>ongest <u>D</u>elay Service <u>C</u>omponent <u>S</u>election) to select the bottle-neck service component by evaluating the real-time performance of all these components. Finally, we employ MACP (<u>M</u>aximum <u>A</u>vailable <u>C</u>apacity <u>P</u>ath) algorithm to select a suitable node to deploy this service replica. Simulation results approve that our approach is effective and efficient.

[1]  Klara Nahrstedt,et al.  Finding service paths in a media service proxy network , 2001, IS&T/SPIE Electronic Imaging.

[2]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[3]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[4]  Raymond A. Paul,et al.  Services-oriented dynamic reconfiguration framework for dependable distributed computing , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[5]  Weisong Shi,et al.  CANS: Composable, Adaptive Network Services Infrastructure , 2001, USITS.

[6]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[7]  Jie Liu,et al.  Greedy is Good: On Service Tree Placement for In-Network Stream Processing , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[8]  A. Z. Spector,et al.  Achieving application requirements , 1990 .

[9]  Guoliang Xue,et al.  Multiconstrained QoS Routing: Greedy is Good , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[10]  Klara Nahrstedt,et al.  SpiderNet: an integrated peer-to-peer service composition framework , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[11]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Thomas Risse,et al.  Combining global optimization with local selection for efficient QoS-aware service composition , 2009, WWW '09.

[13]  Ricardo Jiménez-Peris,et al.  WS-replication: a framework for highly available web services , 2006, WWW '06.

[14]  Maria Luisa Villani,et al.  QoS-aware replanning of composite Web services , 2005, IEEE International Conference on Web Services (ICWS'05).

[15]  Douglas M. Blough,et al.  The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[16]  Randy H. Katz,et al.  The SAHARA Model for Service Composition across Multiple Providers , 2002, Pervasive.

[17]  Yuen-Tak Yu,et al.  A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions , 2006, J. Syst. Softw..

[18]  Yilin Shen,et al.  A middleware for replicated Web services , 2005, IEEE International Conference on Web Services (ICWS'05).

[19]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[20]  Tao Yu,et al.  Service selection algorithms for Web services with end-to-end QoS constraints , 2004, Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004..

[21]  Randy H. Katz,et al.  Load balancing and stability issues in algorithms for service composition , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Farokh B. Bastani,et al.  QoS-Reconfigurable Web Services and Compositions for High-Assurance Systems , 2008, Computer.

[23]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[24]  Klara Nahrstedt,et al.  Distributed multimedia service composition with statistical QoS assurances , 2006, IEEE Transactions on Multimedia.

[25]  Raymond A. Paul,et al.  Dynamic System Reconfiguration Via Service Composition for Dependable Computing , 2005, Monterey Workshop.

[26]  Peter A. Dinda,et al.  The statistical properties of host load , 1999, Sci. Program..

[27]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[28]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[29]  Mohan Kumar,et al.  Dynamic Service Composition in Pervasive Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.