TOWARDS AUTOMATIC CONSTRUCTION OF SKYLINE COMPOSITE SERVICES
Keywords:
Services, Skyline, CompositionAbstract
Due to the rapid increase of available web services over the Internet, service-oriented architecture has been regarded as one of the most promising web technologies. Moreover, enterprises are able to employ outsourcing software to build and publish their business applications as services, the latter can be accessible via the Web by other people or organizations. While there are a large number of web services available, often no single web service can satisfy a concrete user request, so one has to “compose” multiple basic services to fulfill a complex requirement. Web service composition enables dynamic and seamless integration of business applications on the Web. The traditional composition methods select the “best” composite service through defining a simple weight-additive method based on a utility function. But a service has multiple dimensions of non- functional properties, so how to assign weight for each QoS dimension is a non-trivial issue. In this article, we propose algorithms to compose skyline or top-k composite services for a given user request automatically. Experimental results show that our approach can find all skyline or a set of top-k composite services effectively and efficiently.
Downloads
References
M. S. Aktas, G. C. Fox, M. Pierce, and S. Oh, “Xml metadata services,” Concurrency and Com-
putation: Practice and Experience, vol. 20, no. 7, pp. 801–823, 2008.
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.
D. Jordan, J. Evdemon, A. Alves, A. Arkin, S. Askary, C. Barreto, B. Bloch, F. Curbera, M. Ford,
Y. Goland et al., “Web services business process execution language version 2.0,” OASIS Standard,
vol. 11, 2007.
Y. Xia, G. Dai, J. Li, T. Sun, and Q. Zhu, “A model-driven approach to predicting dependability
of ws-cdl based service composition,” Concurrency and Computation: Practice and Experience,
vol. 23, no. 10, pp. 1127–1145, 2011.
T. Yu, Y. Zhang, and K.-J. 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 effi-
cient web services selection,” in proceedings of IEEE International Conference on Web Services
(ICWS),. IEEE, 2005, pp. 113–120.
L. Zeng, B. Benatallah, A. H. H. 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. 311–327, 2004.
S. Borzsony, D. Kossmann, and K. Stocker, “The skyline operator,” in Proceedings 17th Interna-
tional Conference on Data Engineering. IEEE, 2001, pp. 421–430.
M. L. Yiu and N. Mamoulis, “Efficient processing of top-k dominating queries on multi-dimensional
data,” in Proceedings of the 33rd international conference on Very large data bases. VLDB
Endowment, 2007, pp. 483–494.
C. Tang, S. Wen, Q. Li, Y. Xiong, and A. Liu, “Probabilistic top-k dominating composite service
selection,” in 2012 IEEE Ninth International Conference on e-Business Engineering (ICEBE).
IEEE, 2012, pp. 1–8.
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, and T. Sellis, “Ranking and clustering web services using
multicriteria dominance relationships,” IEEE Transactions on Services Computing, vol. 3, no. 3,
pp. 163–177, 2010.
S. Lloyd, “Least squares quantization in pcm,” IEEE Transactions on Information Theory, vol. 28,
no. 2, pp. 129–137, 1982.
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,. IEEE, 2005, pp. 780–783.
Random, “Random data gnerator,” http://randdataset/projects/postgresql/org/, accessed in 5
May. 2013.
Y. Liu, A. H. Ngu, and L. Z. Zeng, “Qos computation and policing in dynamic web service
selection,” in Proceedings of the 13th international World Wide Web conference on Alternate
track papers & posters. ACM, 2004, pp. 66–73.
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.
J. Rao and X. Su, “A survey of automated web service composition methods,” in Semantic Web
Services and Web Process Composition. Springer, 2005, pp. 43–54.
S.-C. Oh, D. Lee, and S. R. 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. L. Blum and M. L. Furst, “Fast planning through planning graph analysis,” Artificial intelli-
gence, vol. 90, no. 1, 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, 2010, pp. 42–49.
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.
