Research Article
Location-Aware Web Service Composition Based on the Mixture Rank of Web Services and Web Service Requests
Algorithm 1
| 1. Calculate the number of all the service candidates (); | |
| 2. ; | |
| // is number of service candidates, sort in descending order; | |
| // is a set of the abstract service ID | |
| // is a set of the number of the service requests to different abstract services. | |
| 3. For m=1:M | |
| 3.1 ; | |
| //for the abstract service sm, find a schedule method; | |
| //this step supposes that every requirement to the QoS is a hard requirement; | |
| //mapc-r is a map between the service candidate of the abstract service sm and service | |
| request to the abstract service sm; | |
| //unr is a service request set that cannot be satisfied; | |
| 3.2 Delete the service process that includes the abstract service and the request to the | |
| abstract service cannot be satisfied; | |
| EndFor | |
| 4. For m=1:M | |
| 4.1 | |
| //this step considers the requirement to the QoS that is relaxable; | |
| //mapc-r is a map between the service candidate of the abstract service sm and service | |
| request to the abstract service sm; | |
| //unr is a service request set that cannot be satisfied; | |
| 4.2 Delete the service process that includes the abstract service and the request to the | |
| abstract service that cannot be satisfied; | |
| 5. Endfor |