Abstract
One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.
Users
Please
log in to take part in the discussion (add own reviews or comments).