Skip to main content
Log in

Probabilistic top-K dominating services composition with uncertain QoS

  • Special Issue Paper
  • Published:
Service Oriented Computing and Applications Aims and scope Submit manuscript

Abstract

Traditional service selection schemes require users to define a utility function by assigning weights to each quality-of-service (QoS) metric. To relieve users from the professional knowledge, skyline techniques have been studied recently by several researchers. However, the size of skyline services is sometimes not easy controlled due to intrinsic attributes of services. Additionally, we observe that most QoS metrics may fluctuate during run-time. Considering such uncertainty and dynamics, in this paper, we propose to obtain probabilistic top-k dominating services with uncertain QoS. Different from previous works, our approach employs the probabilistic characteristic of service instances and calculates the dominating abilities of services so as to achieve an accurate selection. Experimental results have shown the feasibility and effectiveness of our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Papazoglou M (2003) Web services and business transactions. World Wide Web 6(1):49–91

    Article  Google Scholar 

  2. Borzsony S, Kossmann D, Stocker K (2001) The skyline operator. In: Proceedings of 17th international conference on data engineering. IEEE, pp 421–430

  3. Tan K, Eng P, Ooi B (2001) Efficient progressive skyline computation. In: Proceedings of the international conference on very large data bases, pp 301–310

  4. Soliman M, Ilyas I, Chen-Chuan Chang K (2007) Top-k query processing in uncertain databases. In: Proceedings of IEEE 23rd international conference on data engineering, pp 896–905

  5. Ilyas I, Beskales G, Soliman M (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv (CSUR) 40(4):11

    Article  Google Scholar 

  6. Liu Y, Ngu A, Zeng L (2004) 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, pp 66–73

  7. Serhani M, Dssouli R, Hafid A, Sahraoui, H (2005) A qos broker based architecture for efficient web services selection. In: Proceedings of IEEE international conference on web services (ICWS). IEEE, pp 113–120

  8. Chomicki J, Godfrey P, Gryz J, Liang D (2003) Skyline with presorting. In: Proceedings of the international conference on data engineering. IEEE Computer Society Press, 1998, pp 717–719

  9. Godfrey P, Shipley R, Gryz J (2005) Maximal vector computation in large data sets. In: Proceedings of the 31st international conference on very large data bases. VLDB Endowment, pp 229–240

  10. Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th international conference on very large data bases, pp 275–286

  11. Papadias D, Tao Y, Fu G, Seeger B (2005) Progressive skyline computation in database systems. ACM Trans Database Syst (TODS) 30(1):41–82

    Article  Google Scholar 

  12. Bartolini I, Ciaccia P, Patella M (2008) Efficient sort-based skyline evaluation. ACM Trans Database Syst (TODS) 33(4):31

    Article  Google Scholar 

  13. Su I, Chung Y, Lee C (2010) Top-k combinatorial skyline queries. In: Database systems for advanced applications. Springer, pp 79–93

  14. Lian X, Chen L (2009) Top-k dominating queries in uncertain databases. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, pp 660–671

  15. Zhang W, Lin X, Zhang Y, Pei J, Wang W (2010) Threshold-based probabilistic top-k dominating queries. VLDB J 19(2):283–305

    Article  Google Scholar 

  16. Yiu M, Mamoulis N (2009) Multi-dimensional top-k dominating queries. VLDB J 18(3):695–718

    Article  Google Scholar 

  17. Yiu ML, Mamoulis, N (2007) Efficient processing of top-k dominating queries on multi-dimensional data. In: Proceedings of the 33rd international conference on very large data bases, pp 483–494

  18. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. ACM, 14(2)

  19. Yu Q, Bouguettaya A (2010) Computing service skylines over sets of services. In: 2010 IEEE international conference on web services (ICWS). IEEE, pp 481–488

  20. Alrifai M, Skoutas D, Risse T (2010) Selecting skyline services for qos-based web service composition. In: Proceedings of the 19th international conference on World wide web. ACM, pp 11–20

  21. Benouaret K, Benslimane D, Hadjali A (2012) Selecting skyline web services from uncertain qos. In: Services computing (SCC), 2012 IEEE 9th international conference on IEEE, pp 523–530

  22. Yu Q, bouguettaya A (2010) Computing service skyline from uncertain qows. IEEE Trans Serv Comput 3(1):16–29

    Article  Google Scholar 

  23. Skoutas D, Sacharidis D, Simitsis A, Kantere V, Sellis T (2009) 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, pp 898–909

  24. Soliman M, Ilyas I, Chang K (2008) Probabilistic top-k and ranking-aggregate queries. ACM Trans Database Syst (TODS) 33(3):13

    Article  Google Scholar 

  25. Benouaret K, Benslimane D, Hadjali A, Barhamgi M (2011) Top-k web service compositions using fuzzy dominance relationship. In: Proceedings of 2011 IEEE international conference on services computing (SCC). IEEE, pp 144–151

  26. Barbon F, Traverso P, Pistore M, Trainotti M (2006) Run-time monitoring of instances and classes of web service compositions. In: Proceedings of IEEE international conference on web services. IEEE, pp 63–71

  27. Jurca R, Faltings B, Binder W (2007) Reliable qos monitoring based on client feedback. In: Proceedings of the 16th international conference on World Wide Web. ACM, pp 1003–1012

  28. Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Advances in spatial and temporal databases. pp 443–459

  29. Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. ACM SIGMOD Rec 30(2):401–412

    Article  Google Scholar 

  30. Atallah M, Qi Y, Yuan H (2011) Asymptotically efficient algorithms for skyline probabilities of uncertain data. ACM Trans Database Syst 32(2):12

    Google Scholar 

  31. Blake M, Tsui K, Wombacher A (2005) 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, pp 780–783

Download references

Acknowledgments

This work has been supported by the Natural Science Foundations of China with the project 61003044 and the Research Foundation of Ningbo Institute of Technology, Zhejiang University, with the project 1140157G202. This work also supported by the Ningbo Natural Science Foundation and the Natural Science Foundation of Jiangsu Province under Grant No. 2012A610018 and BK2010257, respectively.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chaogang Tang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wen, S., Tang, C., Li, Q. et al. Probabilistic top-K dominating services composition with uncertain QoS. SOCA 8, 91–103 (2014). https://doi.org/10.1007/s11761-013-0152-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11761-013-0152-4

Keywords

Navigation