Information Technology Reference
In-Depth Information
services while others are real services. The
sales management service
references a series of other services to perform the sales processing
service. These services are
order management service
—for recording
details of the order;
customer payment service
—for checking the
credit of the customers and taking the payment associated with the
order; and
logistics service
—for checking availability of the ordered
goods (
warehouse management service
) and for getting the goods
dispatched to the customer (
transportation management service
).
The
customer payment service
can be assembled through two
approaches, the
remittance service
and the
bank account service
.The
available
Bank
1-3
account services
that are external services can be
referenced by the
customer payment service
. There are also two kinds of
product inquiry services, that is, provider indexed and application area
indexed. The product inquiry services are referenced by both
order
management service
and
warehouse management service
.
The simplest MADM problem focuses on two attributes. This
subclass of problems is known as dual attribute optimization. To
illustrate the approach, we use two quality dimensions, that is, cost
c
1
and availability
c
2
. Other quality attributes can be applied or
included without any substantial changes.
According to Definition 5.3, the correspondent SC-net is shown in
Figure 5.6. The Web services that
p
0
and
p
1
22
denote and their QoS
attributes, for example, cost and availability, are shown in Table 5.2.
Using the previously introduced aggregation functions and associ-
ation algorithm, we have the QoS attribute vector for cost
V
1
and
availability
V
2
as follows:
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
L
þ
;
V
1
¼ð
40
;
10
;
100
;
L
þ
;
25
;
20
;
60
;
30
;
28
;
22
;
25
;
10
;
50
;
20
;
50
;
35
;
60
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
Þ
L
;
L
;
L
;
L
;
L
;
L
;
L
;
L
;
L
;
L
;
L
;
L
;
V
2
¼ð
0
:
11
;
0
:
36
;
L
;
0
:
05
;
0
:
02
;
0
:
06
;
0
:
19
;
0
:
13
;
0
:
01
;
0
:
04
;
0
:
11
;
0
:
08
;
0
:
17
;
0
:
08
;
0
:
11
;
0
:
03
;
0
:
05
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
;
0
Þ
Then the problem can be formulated as follows:
¼
P
2
Maximize
f
1
G
j
w
j
j
¼
