A method for optimizing top-k composite services towards preference-aware service dominance

Zhang, S; Lin, W; Dou, W; Chen, J

A method for optimizing top-k composite services towards preference-aware service dominance

Zhang, S Lin, W Dou, W Chen, J

Permalink

Publication Type:: Journal Article
Citation:: International Journal of Web Services Research, 2013, 10 (2), pp. 63 - 86
Issue Date:: 2013-04-01

Closed Access

	Filename	Description	Size
	2013001099OK.pdf		2.31 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, S	en_US
dc.contributor.author	Lin, W	en_US
dc.contributor.author	Dou, W	en_US
dc.contributor.author	Chen, J	en_US
dc.date.issued	2013-04-01	en_US
dc.identifier.citation	International Journal of Web Services Research, 2013, 10 (2), pp. 63 - 86	en_US
dc.identifier.issn	1545-7362	en_US
dc.identifier.uri	http://hdl.handle.net/10453/27176
dc.description.abstract	Web service composition allows users to create value-added composite Web services on existent services, where top-k composite services are helpful for users to find a satisfying composite service efficiently. However, with an increasing number of Web services and users' various composition preferences, computing top-k composite services dynamically for different users is difficult. In view of this challenge, an optimization method for top-k composite services is proposed, based on a preference-aware service dominance relationship. Concretely speaking, firstly, user preferences are modeled with the preference-aware service dominance. Then, in local service selection, a multi-index based algorithm is proposed, named Multi-Index, for computing candidate services of each task dynamically. After that, in global optimization, combined with a service lattice, top-k composite services are selected under a dominant number-aware service ranking. A case study is also presented for illustrating the authors' solution. At last, an experiment was conducted to verify the proposed method. © 2013, IGI Global.	en_US
dc.relation.ispartof	International Journal of Web Services Research	en_US
dc.relation.isbasedon	10.4018/jwsr.2013040104	en_US
dc.subject.classification	Information Systems	en_US
dc.title	A method for optimizing top-k composite services towards preference-aware service dominance	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	10	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	10	en_US

Abstract:

Web service composition allows users to create value-added composite Web services on existent services, where top-k composite services are helpful for users to find a satisfying composite service efficiently. However, with an increasing number of Web services and users' various composition preferences, computing top-k composite services dynamically for different users is difficult. In view of this challenge, an optimization method for top-k composite services is proposed, based on a preference-aware service dominance relationship. Concretely speaking, firstly, user preferences are modeled with the preference-aware service dominance. Then, in local service selection, a multi-index based algorithm is proposed, named Multi-Index, for computing candidate services of each task dynamically. After that, in global optimization, combined with a service lattice, top-k composite services are selected under a dominant number-aware service ranking. A case study is also presented for illustrating the authors' solution. At last, an experiment was conducted to verify the proposed method. © 2013, IGI Global.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/27176