Journal of Computing Science and Engineering

  • 제6권2호
  • /
  • Pages.89-104
  • /
  • 2012
  • /
  • 1976-4677(pISSN)
  • /
  • 2093-8020(eISSN)
한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지
DOI QR코드

DOI QR Code

Dominance-Based Service Selection Scheme with Concurrent Requests

  • Tang, Chaogang (Department of Computer Science and Technology, University of Science and Technology of China, Department of Computer Science, City University of Hong Kong) ;
  • Li, Qing (Department of Computer Science, City University of Hong Kong) ;
  • Xiong, Yan (Department of Computer Science and Technology, University of Science and Technology of China) ;
  • Wen, Shiting (Department of Computer Science and Technology, University of Science and Technology of China) ;
  • Liu, An (Department of Computer Science and Technology, University of Science and Technology of China, State Key Laboratory of Software Engineering, Wuhan University) ;
  • Zhong, Farong (Department of Computer Science, Zhejiang Normal University)
  • 투고 : 2012.03.17
  • 심사 : 2012.04.10
  • 발행 : 2012.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

키워드

참고문헌

  1. X. Lian and L. Chen, "Top-k dominating queries in uncertain database," Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, Saint-Petersburg, Russia, 2009, pp. 660-671.
  2. W. Zhang, X. Lin, Y. Zhang, J. Pei, and W. Wang, "Threshold- based probabilistic top-k dominating queries," The VLDB Journal, vol. 19, no. 2, pp. 283-305, 2010. https://doi.org/10.1007/s00778-009-0162-1
  3. M. L. Yiu and N. Mamoulis, "Multi-dimensional top-k dominating queries," The VLDB Journal, vol. 18, no. 3, pp. 695-718, 2009. https://doi.org/10.1007/s00778-008-0117-y
  4. D. Liu, C. Wan, N. Xiong, J. H. Park, and S. S. Yeoe, "Global top-k aggregate queries based on X-tuple in uncertain database," Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops, Perth, Australia, 2010, pp. 814-821.
  5. M. L. Yiu and N. Mamoulis, "Efficient processing of top-k dominating queries on multi-dimensional data," Proceedings of the 33rd International Conference on Very Large Data Bases, Vienna, Austria, 2007, pp. 483-494.
  6. I. Bartolini, P. Ciaccia, and M. Patella, "Efficient sort-based skyline evaluation," ACM Transactions on Database Systems, vol. 33, no. 4, article no. 31, 2008.
  7. S. Borzsonyi, D. Kossmann, and K. Stocker, "The skyline operator," Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 2001, pp. 421-430.
  8. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with presorting," Proceedings of the 19th International Conference on Data Engineering, Bangalore, India, 2003, pp. 717-719.
  9. P. Godfrey, R. Shipley, and J. Gryz, "Maximal vector computation in large data sets," Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, 2005, pp. 229-240.
  10. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: an online algorithm for skyline queries," Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, 2002, pp. 275-286.
  11. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive skyline computation in database systems," ACM Transactions on Database Systems, vol. 30, no. 1, pp. 41-82, 2005. https://doi.org/10.1145/1061318.1061320
  12. K. L. Tan, P. K. Eng, and B. C. Ooi, "Efficient progressive skyline computation," Proceedings of the 17th International Conference on Very Large Data Bases, Rome, Italy, 2001, pp. 301-310.
  13. I. F. Su, Y. C. Chung, and C. Lee, "Top-k combinatorial skyline queries," Proceedings of the 15th International Conference on Database Systems for Advanced Applications (volume part II), Tsukuba, Japan, 2010, pp. 79-93.
  14. M. A. Soliman, I. F. Ilyas, and K. C. C. Chang, "Probabilistic top-k and ranking-aggregate queries," ACM Transactions on Database Systems, vol. 33, no. 3, article no. 13, 2008.
  15. A. Guttman, "R-tree: a dynamic index structure for spatial searching," Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, 1984, pp. 47-57.
  16. Y. Liu, A. H. Ngu, and L. Z. Zeng, "QoS computation and policing in dynamic web service selection," Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers & Posters, Manhattan, NY, 2004, pp. 66-73.
  17. M. A. Serhani, R. Dssouli, A. Hafid, and H. Sahraoui, "A QoS broker based architecture for efficient web services selection," Proceedings of the IEEE International Conference on Web Services, Orlando, FL, 2005, pp. 113-120.
  18. Q. Yu and A. Bouguettaya, "Computing service skylines over sets of services," Proceedings of the IEEE International Conference on Web Services, Miami, FL, 2010, pp. 481-488.
  19. D. Skoutas, D. Sacharidis, A. Simitsis, and V. Kantere, and T. Sellis, "Top-k dominant web services under multi-criteria matching," Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, Saint-Petersburg, Russia, 2009, pp. 898-909.
  20. M. Alrifai, D. Skoutas, and T. Risse, "Selecting skyline services for QoS-based web service composition," Proceedings of the 19th International Conference on World Wide Web, Raleigh, North Carolina, 2010, pp. 11-20.
  21. D. Skoutas, and D. Sacharidis, A. Simitsis, and T. Sellis, "Serving the sky: discovering and selecting semantic web services through dynamic skyline queries," Proceedings of the IEEE International Conference on Semantic Computing, Santa Clara, CA, 2008, pp. 222-229.
  22. Q. Yu and A. Bouguettaya, "Computing service skyline from uncertain QoWS," IEEE Transactions on Services Computing, vol. 3, no. 1, pp. 16-29, 2010. https://doi.org/10.1109/TSC.2010.7
  23. 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. https://doi.org/10.1109/TSE.2004.11
  24. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao, "Efficient OLAP operations in spatial data warehouses," Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Database, Redondo Beach, CA, 2001, pp. 443-459.
  25. I. Lazaridis and S. Mehrotra, "Progressive approximate aggregator queries with a multi-resolution tree structure," Proceedings of the ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, 2001, pp. 401-412.
  26. L. P. Slothouber, "A model of web server performance," Proceedings of the 5th International World Wide Web Conference, Paris, France, 1996.