QoS-oriented service composition based on mapping relation tree

Abstract

Service composition is a hot and active research area in service-oriented computing which has gained great momentum. An quality of service (QoS) oriented and tree-based approach was proposed to implement service composition efficiently. Firstly, service descriptions were transformed to mapping relations which denote the association between input and output concepts. Then, the service composition problems were resolved by building mapping relation tree dynamically based on the divide and conquer method, and all mapping relation trees were combined without redundant branch to obtain the composition scheme. Finally, the optimal composition scheme was chosen based on quality of service attributes including the preference of service request. Experiment results illustrate that this method can improve the composition efficiency and reduce the searching time by increasing the number of services in repository.

Keywords

service composition / quality of service / mapping relation tree / divide and conquer

References

[1] GeorgakopoulosD., PapazoglouM. P.Service-oriented computing [M], 2009Massachusetts LondonMIT Press1-28

[2] BerardiD., CalvaneseD., GiacomoG. D., LenzeriniM., MecellaM.. Automatic service composition based on behavioral descriptions [J]. International Journal of Cooperative Information Systems, 2005, 14(4): 333-376

[3] RaoJ.-h., SuX.-meng.. A survey of automated web service composition methods [C]. Proceedings of the First International Workshop on Semantic Web Services and Web Process Composition, 2005San DiegoSpringer-Verlag43-54

[4] YangF.-c., SuS., LiZhen.. Hybrid QoS-aware semantic web service composition strategies [J]. Science in China Series F: Information Sciences, 2008, 51(11): 1822-1840

[5] SteinS., PayneT. R., JenningsN. R.. Flexible provisioning of web service workflows [J]. ACM Transactions on Internet Technology, 2009, 9(1): 1-45

[6] CicirelliF., FurfaroA., NigroL.. A service-based architecture for dynamically reconfigurable workflows [J]. Journal of Systems and Software, 2010, 83(7): 1148-1164

[7] ChiY. L., LeeH. M.. A formal modeling platform for composing web services [J]. Expert Systems with Applications, 2008, 34(2): 1500-1507

[8] ValeroV., CambroneroM. E., DíazG., MaciàH.. A Petri net approach for the design and analysis of Web Services Choreographies [J]. The Journal of Logic and Algebraic Programming, 2009, 78(5): 359-380

[9] LucchiR., MazzaraM.. A pi-calculus based semantics for WS-BPEL [J]. The Journal of Logic and Algebraic Programming, 2007, 70(1): 96-118

[10] OzorhanE. K., KubanE. K., CicekliN. K.. Automated composition of web services with the abductive event calculus [J]. Information Sciences, 2010, 180(19): 3589-3613

[11] RaoJ.-h., KüngasP., MatskinM.. Composition of semantic web services using linear logic theorem proving [J]. Information Systems, 2006, 31(4): 340-360

[12] DingY.-s., SunH.-b., HaoK.-rong.. A bio-inspired emergent system for intelligent Web service composition and management [J]. Knowledge-Based Systems, 2007, 20(5): 457-465

[13] WangJ.-s., LiZ.-j., LiM.-jun.. Composing semantic web services with description logics [J]. Chinese Journal of Software, 2008, 19(4): 967-980

[14] ShinD. H., LeeK. H., SudaT.. Automated generation of composite web services based on functional semantics [J]. Web Semantics: Science, Services and Agents on the World Wide Web, 2009, 7(4): 332-343

[15] LiuZ., RanganathanA., RiabovA.. Modeling web services using semantic graph transformations to aid automatic composition [C]. Proceedings of IEEE International Conference on Web Services, 2007Salt Lake CityIEEE78-85

[16] HennigP., BalkeW. T.. Highly scalable web service composition using binary tree-based parallelization [C]. Proceedings of IEEE International Conference on Web Services, 2010MiamiIEEE123-130

[17] LiuJ.-m., GuN., ShiB.-le.. Non-backtrace backward chaining dynamic composition of web services based on mediator [J]. Journal of Computer Research and Development, 2005, 42(7): 1153-1158

[18] DengS.-g., WuJ., LiY., WuZ.-hui.. Automatic web service composition based on backward tree [J]. Chinese Journal of Software, 2007, 18(8): 1896-1910

[19] KoJ. M., KimC. O., KwonI. H.. Quality-of-service oriented web service composition algorithm and planning architecture [J]. The Journal of Systems and Software, 2008, 81(11): 2079-2090

[20] MabroukN. B., BeaucheS., KuznetsovaE., GeorgantasN., IssarnyV.. QoS-aware service composition in dynamic service oriented environments [C]. Proceedings of 10th International Middleware Conference, 2009UrbanaSpringer-Verlag123-142

[21] ResnikP.. Semantic similarity in a taxonomy: An Information-based measure and its application to problems of ambiguity in natural language [J]. Journal of Artificial Intelligence Research, 1999, 11: 95-130

[22] CormenT. H., LeisersonC. E., RivestR. L., SteinC.Introduction to algorithms, 2001(Second Edition)LondonMIT Press27-34

[23] YagerR. R., XuZ.-shui.. The continuous ordered weighted geometric operator and its application to decision making [J]. Fuzzy Sets and Systems, 2006, 157(10): 1393-1402

[24] XuZ.-shui.. On multi-period multi-attribute decision making [J]. Knowledge-Based Systems, 2008, 21(2): 164-171

[25] XuJ.-p., WuWei.Multiple attribute decision making theory and methods [M], 2006BeijingTsinghua University Press45-47

[26] DengH. P., YehC. H., WillisR. J.. Inter-company comparison using modified TOPSIS with objective weights [J]. Computers and Operations Research, 2000, 27(10): 963-973

[27] WangT. C., LeeH. D.. Developing a fuzzy TOPSIS approach based on subjective weights and objective weights [J]. Expert Systems with Applications, 2009, 36(5): 8980-8985

[28] MohajeriA., AlipourM.. Shannon information entropy of fractional occupation probability as an electron correlation measure in atoms and molecules [J]. Chemical Physics, 2009, 360(1/2/3): 132-136