Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2905055.2905228acmotherconferencesArticle/Chapter ViewAbstractPublication PagesictcsConference Proceedingsconference-collections
research-article

Collusive User Removal and Trusted Composite Web Service Selection based on QoS attributes

Published: 04 March 2016 Publication History

Abstract

Generally web service selection is performed based on nonfunctional (Quality of Service) attributes. But Quality of Service (QoS) attribute values may not be equal to the published values by the service providers. Therefore, the users want to concern about the trustworthiness of the services or service providers. The trustworthiness of a service is measured by the users' ratings. There may be the dishonest users who provide the fake ratings for commercial benefit. These users are called malicious or collusive users and can be treated like outliers. Now, we have proposed an approach to identify these outliers using data mining approach. Then Composite Web Service Selection is performed using Genetic Algorithms (GA). The problem is to find an optimal concrete service composition plan under users' QoS constraints. The QoS-aware composite web service selection is NP-hard problem. But it can be mapped with Multi-dimensional Multi-choice Knapsack Problem(MMKP), which is NP-complete[6]. Therefore, we use Genetic Algorithm(GA) to find the near-optimal composite service plan with QoS constraints.

References

[1]
E. Al-Masri and Q. H. Mahmoud. Investigating web services on the world wide web. In Proceedings of the 17th international conference on World Wide Web, pages 795--804. ACM, April 2008.
[2]
X. Chen, Z. Zheng, X. Liu, Z. Huang, and H. Sun. Personalized qos-aware web service recommendation and visualization. Services Computing, IEEE Transactions on, 6(1):35--47, March 2013.
[3]
H. Gao, J. Yan, and Y. Mu. Trust-oriented qos-aware composite service selection based on genetic algorithms. Concurrency and Computation: Practice and Experience, 26(2):500--515, February 2014.
[4]
J. Han, M. Kamber, and J. Pei. Data mining: concepts and techniques: concepts and techniques. Elsevier, Waltham, USA, 2011.
[5]
T. Korkmaz and M. Krunz. Multi-constrained optimal path selection. In INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, volume 2, pages 834--843. IEEE, April 2001.
[6]
L. Li, Y. Wang, and E.-P. Lim. Trust-oriented composite service selection with qos constraints. J. UCS, 16(13):1720--1744, July 2010.
[7]
Z. Malik and A. Bouguettaya. Evaluating rater credibility for reputation assessment of web services. In Web Information Systems Engineering--WISE 2007, pages 38--49. Springer, 2007.
[8]
Z. Malik and A. Bouguettaya. Rateweb: Reputation assessment for trust establishment among web services. The VLDB JournalâĂŤ The International Journal on Very Large Data Bases, 18(4):885--911, 2009.
[9]
M. Mitchell. An introduction to genetic algorithms. MIT press, 1998.
[10]
S. Wang, Z. Zheng, Z. Wu, M. R. Lyu, and F. Yang. Reputation measurement and malicious feedback rating prevention in web service recommendation systems. Services Computing, IEEE Transactions on, 8(5):755--767, September/October 2015.
[11]
L. Zeng, B. Benatallah, A. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang. Qos-aware middleware for web services composition. Software Engineering, IEEE Transactions on, 30(5):311--327, May 2004.
[12]
S. Zhao, G. Wu, G. Chen, and H. Chen. Reputation-aware service selection based on qos similarity. Journal of networks, 6(7):950--957, 2011.
  1. Collusive User Removal and Trusted Composite Web Service Selection based on QoS attributes

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies
    March 2016
    843 pages
    ISBN:9781450339629
    DOI:10.1145/2905055
    © 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 March 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Collusive user
    2. Genetic Algorithm
    3. Optimal trust value
    4. QoS
    5. Trust value
    6. Web service composition
    7. k-means clustering

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICTCS '16

    Acceptance Rates

    Overall Acceptance Rate 97 of 270 submissions, 36%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 32
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 03 Oct 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media