Loading [MathJax]/jax/output/SVG/jax.js
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 21 Issue 4
July  2006
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Xiao-Ling Wang, Sheng Huang, Ao-Ying Zhou. QoS-Aware Composite Services Retrieval[J]. Journal of Computer Science and Technology, 2006, 21(4): 547-558.
Citation: Xiao-Ling Wang, Sheng Huang, Ao-Ying Zhou. QoS-Aware Composite Services Retrieval[J]. Journal of Computer Science and Technology, 2006, 21(4): 547-558.
shu

QoS-Aware Composite Services Retrieval

  • Department of Computer Science and Engineering, Fudan University, Shanghai 200433, P.R. China

More Information
  • Revised Date: May 07, 2006
  • Published Date: July 14, 2006
    Abstract
  • For current service-oriented applications, individual web serviceusually cannot meet the requirements arising from real worldapplications, so it is necessary to combine the functionalities ofdifferent web services to obtain a composite service in responseto users' service requests. In order to address the problem of webservice composition, this paper proposes an efficient approach tocomposing basic services in case no any individual service can fullysatisfy users' requests. Compared with the general strategiesadopted in most previously proposed approaches where only the bestcomposition solution is produced, the QoS-aware service compositionapproach is given and top k solutions in the framework are provided,rather than focusing on obtaining the best composition solution, sincethe presented approach allows more candidates that are likely to meetthe requirements of the users. The approach is based on a succinctbinary tree data structure, and a system, named ATC (Approach to Top-kComposite services retrieval) system is implemented. In ATC, QoS istaken into account for composite service, and a heuristic-based searchmethod is proposed to retrieve top k composite service. Some extensiveexperiments are designed and two web service benchmarks are used forperformance study. The experimental results show that the proposedapproach can assure high precision and efficiency for composite servicesearch.
    • FullText(HTML)
    • References (19)
  • [1]
    Yue K, Wang X, Zhou A. The underlying techniques for web services: A survey. -\it Journal of Software}, 2004, 15(3): 428--442.
    [2]
    EEE05contest. http://www.comp.hkbu.edu.hk/eee05/contest/.
    [3]
    ICDBE05contest. http://www.comp.hkbu.edu.hk/ctr/wscha\-llenge/icebe05challenge.html.
    [4]
    UDDI: http://www.uddi.org/.
    [5]
    Dong X, Halevy A, Madhavan J, Nemes E, Zhang J. Similarity search for web service. In -\it Proc. the 30th VLDB Conference}, Toronto, Canada, August 2004, pp.372--383.
    [6]
    Leymann F, Roller D \it et al. \rm Web services and business process management. -\it IBM System Journal}, 2002, 41(2): 198--211.
    [7]
    Berners-Lee T, Hendler J, Lassila O. The semantic web. -\it Scientific American}, May 2001, 284(5): 34--43.
    [8]
    S McIlraith, T C Son, H Zeng. Semantic web services. -\it IEEE Intelligent Systems}, 2001, 16(2): 46--53.
    [9]
    S McIlraith, D L Martin. Bringing semantics to web services. -\it IEEE Intelligent Systems}, 2003, 18(1): 90--93.
    [10]
    S Agarwal, A Ankolekar. Automatic matchmaking of web services. In -\it Proc. The 15th International World Wide Web Conference}, ACM, Edinburgh, Scotland, May 2006, pp.170--171.
    [11]
    J Zhang, J Y Chung, C K Chang -\it et al}. WS-Net: A Petri-net based specification model for web services. In -\it Proc. The 2nd IEEE Int. Conf. Web Services}, San Diego, USA, 2004, pp.420--427.
    [12]
    R Hamadi, B Benatallah. A Petri-net based model for web service composition. In -\it Proc. The 14th Australasian Database Conf. Database Technologies}, Australian Computer Society, 2003, pp.191--200.
    [13]
    F Casati, M C Shan. Dynamic and adaptive composition of e-services. -\it Information Systems}, 2001, 26(3): 143--162.
    [14]
    OWL-S: Semantic markup for web services, 2003. Available at http://www.daml.org/services/ owl-s/1.0/owl-s.html.
    [15]
    D Roman, H Lausen, U Keller. Web Services Modeling Ontology (WSMO). http://www.wsmo.org/2004/d2/v0.2/20040306/.
    [16]
    R Akkiraju, J Farrell, J Miller -\it et al}. Web Service Semantics --WSDL-S. http://www.w3.org/Submission/WSDL-S/, 2005.
    [17]
    S Ponnekanti, A Fox. SWORD: A developer toolkit for web service composition. In -\it Proc. The 11th International World Wide Web Conference}, Hawaii, USA, 2002. http://www2002.org/CDROM/alternate/786/
    [18]
    S C Oh, B W On, E J Larson, D Lee. BF*: Web services discovery and composition as graph search problem. In -\it Proc. The 2005 IEEE International Conference on E-Technology, E-Commerce and E-Service}, Hong Kong, 2005, pp.784--786.
    [19]
    E Christensen, F Curbera, G Meredith, S Weerawarana. Web service Description Language (WSDL). http://www.w3.org/TR/wsdl.
    • Relative Articles

  • Related Articles

    [1]Xue-Qin Chang, Cheng-Yang Luo, Han-Lin Yu, Xin-Wei Cai, Lu Chen, Qing Liu, Yun-Jun Gao. Answering Non-Answer Questions on Reverse Top-k Geo-Social Keyword Queries[J]. Journal of Computer Science and Technology, 2022, 37(6): 1320-1336. DOI: 10.1007/s11390-022-2414-0
    [2]Hong-Fei Xu, Yu Gu, Jian-Zhong Qi, Jia-Yuan He, Ge Yu. Diversifying Top-k Routes with Spatial Constraints[J]. Journal of Computer Science and Technology, 2019, 34(4): 818-838. DOI: 10.1007/s11390-019-1944-6
    [3]Rui Zhu, Bin Wang, Shi-Ying Luo, Xiao-Chun Yang, Guo-Ren Wang. Approximate Continuous Top-k Query over Sliding Window[J]. Journal of Computer Science and Technology, 2017, 32(1): 93-109. DOI: 10.1007/s11390-017-1708-0
    [4]Ming-Wei Zhang, Bin Zhang, Ying Liu, Jun Na, Zhi-Liang Zhu. Web Service Composition Based on QoS Rules[J]. Journal of Computer Science and Technology, 2010, 25(6): 1143-1156. DOI: 10.1007/s11390-010-1091-6
    [5]Shou-Xin Wang, Li Zhang, Shuai Wang, Xiang Qiu. A Cloud-Based Trust Model for Evaluating Quality of Web Services[J]. Journal of Computer Science and Technology, 2010, 25(6): 1130-1142. DOI: 10.1007/s11390-010-1090-7
    [6]An Liu, Hai Liu, Qing Li, Liu-Sheng Huang, Ming-Jun Xiao. Constraints-Aware Scheduling for Transactional Services Composition[J]. Journal of Computer Science and Technology, 2009, 24(4): 638-651.
    [7]Bang-Yu Wu, Chi-Hung Chi, Shi-Jie Xu, Ming Gu, Jia-Guang Sun. QoS Requirement Generation and Algorithm Selection for Composite Service Based on Reference Vector[J]. Journal of Computer Science and Technology, 2009, 24(2): 357-372.
    [8]Yu Dai, Lei Yang, Bin Zhang. QoS-Driven Self-Healing Web Service Composition Based on Performance Prediction[J]. Journal of Computer Science and Technology, 2009, 24(2): 250-261.
    [9]Jian Yu, Yan-Bo Han, Jun Han, Yan Jin, Paolo Falcarin, Maurizio Morisio. Synthesizing Service Composition Models on the Basis of Temporal Business Rules[J]. Journal of Computer Science and Technology, 2008, 23(6): 885-894.
    [10]Jun Zhang, Zhao-Hui Peng, Shan Wang, Hui-Jing Nie. CLASCN: Candidate Network Selection for Efficient Top-k Keyword Queries over Databases[J]. Journal of Computer Science and Technology, 2007, 22(2): 197-207.
    • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (27) PDF downloads (1754) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return