PROCESSING MULTIPLE REQUESTS TO CONSTRUCT SKYLINE COMPOSITE SERVICES

Authors

  • SHITING WEN Ningbo Institute of Technology, Zhejiang University, Ningbo, China
  • QING LI City University of Hong Kong, Hong Kong, China
  • CHAOGANG TANG China University of Mining and Technology, Xuzhou, China
  • AN LIU University of Science and Technology of China, Hefei, China
  • LIUSHENG HUANG University of Science and Technology of China, Hefei, China
  • YANGGUANG LIU Ninbo Institute of Technology, Zhejiang University, Ningbo, China

Keywords:

Web Services, Skyline Composition, Materialization

Abstract

The performance of a composite service is determined by the performance of involved component services. When multiple non-functional criteria are considered, users are re- quired to express their preferences over different quality attributes as numeric weights in existing methods. However, this imprecise method may not reflect the natural ordering of services and thus could miss some user-desired services. In this paper, we propose a com- position framework to construct multiple skyline composite services for each individual request. We also discuss how a service registry can effectively deal with multiple requests simultaneously by materializing the intermediate composite services. We evaluate the efficiency and effectiveness of our methods through extensive experiments.

 

Downloads

Download data is not yet available.

References

A. Liu, Q. Li, L. Huang, and M. Xiao, “Facts: A framework for fault-tolerant composition of

transactional web services,” Services Computing, IEEE Transactions on, vol. 3, no. 1, pp. 46–59,

R. Haesen, M. Snoeck, W. Lemahieu, and S. Poelmans, “On the definition of service granularity

and its architectural impact,” in Advanced Information Systems Engineering. Springer, 2008, pp.

–389.

L. Zeng, B. Benatallah, A. Ngu,M. Dumas, J. Kalagnanam, and H. Chang, “Qos-aware middleware

for web services composition,” IEEE Transactions on Software Engineering, vol. 30, no. 5, pp.

–327, 2004.

T. Yu, Y. Zhang, and K. Lin, “Efficient algorithms for web services selection with end-to-end qos

constraints,” ACM Transactions on the Web (TWEB), vol. 1, no. 1, p. 6, 2007.

M. Alrifai and T. Risse, “Combining global optimization with local selection for efficient qos-

aware service composition,” in Proceedings of the 18th international conference on World wide

web. ACM, 2009, pp. 881–890.

M. Serhani, R. Dssouli, A. Hafid, and H. Sahraoui, “A qos broker based architecture for efficient

web services selection,” in Proceedings 2005 IEEE International Conference on Web Services ICWS

IEEE, 2005, pp. 113–120.

D. Ardagna and B. Pernici, “Adaptive service composition in flexible processes,” IEEE Transac-

tions on Software Engineering, vol. 33, no. 6, pp. 369–384, 2007.

S. Wen, Q. Li, L. Yue, A. Liu, C. Tang, and F. Zhong, “Crp: context-based reputation propagation

in services composition,” Service Oriented Computing and Applications, vol. 6, no. 3, pp. 231–248,

S. Borzsony, D. Kossmann, and K. Stocker, “The skyline operator,” in Proceedings of the 17th

International Conference on Data Engineering. IEEE, 2001, pp. 421–430.

Q. Yu and A. Bouguettaya, “Computing service skyline from uncertain qows,” IEEE Transactions

on Services Computing, vol. 3, no. 1, pp. 16–29, 2010.

M. Alrifai, D. Skoutas, and T. Risse, “Selecting skyline services for qos-based web service compo-

sition,” in Proceedings of the 19th international conference on World wide web. ACM, 2010, pp.

–20.

D. Skoutas, D. Sacharidis, A. Simitsis, V. Kantere, and T. Sellis, “Top-k dominant web services

under multi-criteria matching,” in Proceedings of the 12th international conference on extending

database technology: advances in database technology. ACM, 2009, pp. 898–909.

J. Yang, K. Karlapalem, and Q. Li, “Algorithms for materialized view design in data warehousing

environment,” in Proceedings of the International Conference on Very Large Data Bases. Institute

of Electrical and Electronics Engineering(IEEE), 1997, pp. 136–145.

M. Blake, K. Tsui, and A. Wombacher, “The eee-05 challenge: A new web service discovery and

composition competition,” in Proceedings of IEEE International Conference on e-Technology,

e-Commerce and e-Service, EEE 2005. IEEE, 2005, pp. 780–783. [Online]. Available:

http://ws-challenge.georgetown.edu/ws-challenge/The%20EEE.html

“Random data generator:http://randdataset.projects.postgresql.org/.”

J. Rao and X. Su, “A survey of automated web service composition methods,” Semantic Web

Services and Web Process Composition, pp. 43–54, 2005.

S. Oh, D. Lee, and S. Kumara, “Web service planner (wspr): An effective and scalable web service

composition algorithm,” International Journal of Web Services Research (IJWSR), vol. 4, no. 1,

pp. 1–22, 2007.

A. Blum and M. Furst, “Fast planning through planning graph analysis,” Artificial intelligence,

vol. 90, no. 1-2, pp. 281–300, 1997.

W. Jiang, C. Zhang, Z. Huang,M. Chen, S. Hu, and Z. Liu, “Qsynth: a tool for qos-aware automatic

service composition,” in 2010 IEEE International Conference on Web Services (ICWS). IEEE,

, pp. 42–49.

Downloads

Published

2014-03-01

How to Cite

WEN, S. ., LI, Q., TANG, C. ., LIU, A. ., HUANG, L., & LIU, Y. (2014). PROCESSING MULTIPLE REQUESTS TO CONSTRUCT SKYLINE COMPOSITE SERVICES. Journal of Web Engineering, 13(1-2), 053–066. Retrieved from https://journals.riverpublishers.com/index.php/JWE/article/view/3945

Issue

Section

Articles