摘要：The increasing momentum of service-oriented architecture has led to the emergence of divergent delivered services, where service selection is meritedly required to obtain the target service fulfilling the requirements from both users and service providers. Despite many existing works have extensively handled the issue of service selection, it remains an open question in the case where requests from multiple users are performed simultaneously by a certain set of shared candidate services. Meanwhile, there exist some constraints enforced on the context of service selection, e.g. service placement location and contracts between users and service providers. In this paper, we focus on the QoS-aware service selection with constraints from a fairness aspect, with the objective of achieving max-min fairness across multiple service requests sharing candidate service sets. To be more specific, we formulate this problem as a lexicographical maximization problem, which is far from trivial to deal with practically due to its inherently multi-objective and discrete nature. A fairness-aware algorithm for concurrent service selection (FASS) is proposed, whose basic idea is to iteratively solve the single-objective subproblems by transforming them into linear programming problems. Experimental results based on real-world datasets also validate the effectiveness and practicality of our proposed approach.
© 2019 IEEE.

卷、期、页：p255-259

发表日期：2019-07-01

期刊分区（SCI为中科院分区）：无

收录情况：EI（工程索引）

发表期刊名称：Proceedings - 2019 IEEE International Conference on Web Services, ICWS 2019 - Part of the 2019 IEEE World Congress on Services

参与作者：李松远,程渤,崔立真,史玉良

第一作者：黄霁崴

论文类型：会议论文

论文概要：李松远,黄霁崴,程渤,崔立真,史玉良，FASS: A fairness-aware approach for concurrent service selection with constraints，Proceedings - 2019 IEEE International Conference on Web Services, ICWS 2019 - Part of the 2019 IEEE World Congress on Services，2019，p255-259

论文题目：FASS: A fairness-aware approach for concurrent service selection with constraints