Semantic web services composition using enhanced beam stack search

Other Title(s)

تجميع خدمات الويب دلاليا باستخدام خوارزمية البحث مكدسة الحزمة المعززة

Dissertant

Khazindar, Tījan Taj al-Din Jar Allah

Thesis advisor

Barakah, Ribhi Sulayman

University

Islamic University

Faculty

Faculty of Information Technology

Department

Information Technology

University Country

Palestine (Gaza Strip)

Degree

Master

Degree Date

2017

English Abstract

Semantic web services composition is a set of web services and a user request, we need to find the best applicable sequence of web services satisfying the user's request, fulfiling his requirements.

Each web service has functional and non-functional requirements.

The problem, is finding the web services composition that fulfills the non-functional requirements automatically without without involvement the user.

In this research, we take into consideration the non-functional properties to form a quality based web services composition specifically depending on response time and throughput (the quantity of efficiency produced over time).

We enhanced the heuristic Beam Stack Search algorithm and employed it to search automatically through the web services search space for a composition satisfying the required qualities.

Number of experiments were conducted to form compositions on several web services test set sizes; 5000, 10000, and 15000, such that running the Enhanced Beam Stack Search with different beam width sizes; 120, 150, 300, and 600.

The results indicate the ability of the algorithm to achieve the required compositions with the respective qualities.

The beam width parameter of the algorithm plays an important role on the quality of the formed composition.

As the beam width increases, the throughput of the formed composition decreases and vice versa, i.e., results obtained when using the 15000 test set size for optimal solution throughput are 848, 773, 311, and 192 sequentially by using the mentioned consequent beam widths increasingly.

Results also showed that as the test set size increases, the algorithm performs better in terms of throughput.

If the user wants the minimum response time he will take the first found solution.

While, if he is interested in the best-found throughput, he will choose the optimal solution.

Main Subjects

Information Technology and Computer Science

No. of Pages

73

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-905918