Browse State-of-the-Art › Service Composition

Service Composition

6 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Miscellaneous

Let T be the task that the service composition needs to accomplish. The task T can be granulated to T 1 , T 2 , T 3 , T 4 , … , T n . i.e. T = {T 1 , T 2 , T 3 , T 4 , … , T n } . For each task T i , a set of service S i = S i 1 , S i 2 , S i 3 , … , S i m is discovered during the service discovery process such that all services in a set S i perform the same function and have the same input and output parameters (See Figure 2). S 1 = {S 11 , S 12 , S 13 , … , S 1m } , S 2 = {S 21 , S 22 , S 23 , … , S 2m } , S 3 = {S 31 , S 32 , S 33 , … , S 3m } , … , S n = {S n 1 , S n 2 , S n 3 , … , S n m } We need to select one service from each set S i in order to compose the big service such that the overall QoS attributes of the big service are optimal. The total number of the possible distinct service composition is n m . Let k be the the number of QoS attributes. Then the total num- ber of comparisons required are kn m . We need at least kn m comparisons to find whether the solution is optimal, thus making the problem as NP-Hard.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

6 shown of 6 papers with code (45 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections