Subset Matching based Selection and Ranking (SMSR) of Web Services

Full Text (PDF, 738KB), PP.44-53

Views: 0 Downloads: 0


Md. Abdur Rahman 1,* Md. Belal Hossain 2 Md. Sharifur Rahman 2 Saeed Siddik 2

1. Centre for Advanced Research in Sciences, University of Dhaka, Dhaka, Bangladesh

2. Institute of Information Technology University of Dhaka, Dhaka, Bangladesh

* Corresponding author.


Received: 6 Jan. 2019 / Revised: 14 Jan. 2019 / Accepted: 20 Jan. 2019 / Published: 8 Apr. 2019

Index Terms

Web service composition, selection, ranking, SVD, subset


Web service is a software application, which is accessible using platform independent and language neutral web protocols. However, selecting the most relevant services became one of the vital challenges. Quality of services plays very important role in web service selection, as it determines the quality and usability of a service, including its non-functional properties such as scalability, accessibility, integrity, efficiency, etc. When agent application send request with a set of quality attributes, it becomes challenging to find out the best service for satisfying maximum quality requirements. Among the existing approaches, the single value decomposition technique is popular one; however, it suffers for computational complexity. To overcome this limitation, this paper proposed a subset matching based web service selection and ranking by considering the quality of service attributes. This proposed method creates a quality-web matrix to store available web services and associated quality of service attributes. Then, matrix subsets are created using web service repository and requested quality attributes. Finally, web services are efficiently selected and ranked based on calculated weights of corresponding web services to reduce composition time. Experimental results showed that proposed method performs more efficient and scalable than existing several techniques such as single value decomposition.

Cite This Paper

Abdur Rahman, Belal Hossain, Sharifur Rahman, Saeed Siddik, "Subset Matching based Selection and Ranking (SMSR) of Web Services", International Journal of Information Technology and Computer Science(IJITCS), Vol.11, No.4, pp.44-53, 2019. DOI:10.5815/ijitcs.2019.04.05


[1]Amira Abdelatey, Mohamed Elkawkagy, Ashraf Elsisi, Arabi Keshk,"Extend Web Service Security Negotiation Framework in Privacy", International Journal of Information Technology and Computer Science(IJITCS), Vol.9, No.8, pp.30-39, 2017. DOI: 10.5815/ijitcs.2017.08.04

[2]Neiat AG, Bouguettaya A, Sellis T. Spatio-temporal composition of crowdsourced services. InInternational Conference on Service-Oriented Computing 2015 Nov 16 (pp. 373-382). Springer, Berlin, Heidelberg.

[3]Maamar Z, Benslimane D, Mostéfaoui GK, Subramanian S, Mahmoud QH. Toward behavioral web services using policies. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans. 2008 Nov; 38(6):1312-24.

[4]Aslam MA, Shen J, Auer S, Herrmann M. An integration life cycle for semantic web services composition.Proceedings of the 11th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2007) (pp. 490-495). Melbourne: Swinburne Press.

[5]Randa. Hammami, Yossra. Hadj Kacem, Senda. Souissi, Hatem. Bellaaj, Ahmed. Hadj Kacem ,"Weighted Priority Queuing: A New Scheduling Strategy for Web Services", International Journal of Information Technology and Computer Science(IJITCS), Vol.9, No.2, pp.11-17, 2017. DOI: 10.5815/ijitcs.2017.02.02

[6]Sirin E, Parsia B, Hendler J. Filtering and selecting semantic web services with interactive composition techniques. IEEE Intelligent Systems. 2004 Jul 1(4):42-9.

[7]Maamar2 Z, Mostefaoui SK, Yahyaoui H. Toward an agent-based and context-oriented approach for web services composition. IEEE transactions on knowledge and data engineering. 2005 May;17(5):686-97.

[8]Chan H, Chieu T, Kwok T. Autonomic ranking and selection of web services by using single value decomposition technique. InWeb Services, 2008. ICWS'08. IEEE International Conference on 2008 Sep 23 (pp. 661-666). IEEE.

[9]Kwon J, Kim H, Lee D, Lee S. Redundant-free web services composition based on a two-phase algorithm. InWeb Services, 2008. ICWS'08. IEEE International Conference on 2008 Sep 23 (pp. 361-368). IEEE.

[10]Lamparter S, Ankolekar A, Studer R, Grimm S. Preference-based selection of highly configurable web services. InProceedings of the 16th international conference on World Wide Web 2007 May 8 (pp. 1013-1022). ACM.

[11]Hachemi, Yamina & Benslimane, Sidi Mohamed. (2015). Preference-Based Web Service Composition: Case-Based Planning Approach. International Journal of Information Technology and Computer Science. 7. 74-82. 10.5815/ijitcs.2015.06.10.

[12]Menascé DA. QoS issues in web services. IEEE internet computing. 2002 Nov;6(6):72-5.