Quality-aware service selection for multi-tenant service oriented systems based on combinatorial auction

Li, Xuejun, Zhong, Yunxiang, He, Qiang, Chen, Feifei, Zhang, Xuyun, Dou, Wanchun and Yang, Yun 2019, Quality-aware service selection for multi-tenant service oriented systems based on combinatorial auction, IEEE access, vol. 7, pp. 35645-35660, doi: 10.1109/ACCESS.2019.2902131.

Attached Files
Name Description MIMEType Size Downloads

Title Quality-aware service selection for multi-tenant service oriented systems based on combinatorial auction
Author(s) Li, Xuejun
Zhong, Yunxiang
He, Qiang
Chen, FeifeiORCID iD for Chen, Feifei orcid.org/0000-0001-5455-3792
Zhang, Xuyun
Dou, Wanchun
Yang, Yun
Journal name IEEE access
Volume number 7
Start page 35645
End page 35660
Total pages 16
Publisher IEEE
Place of publication Piscataway, N.J.
Publication date 2019
ISSN 2169-3536
Keyword(s) Science & Technology
Computer Science, Information Systems
Engineering, Electrical & Electronic
Computer Science
Cloud computing
service oriented systems
multiple tenancy
service selection
combinatorial auction
integer programming
Summary Multi-tenant service-oriented systems (SOSs) have become a major software engineering paradigm in the cloud environment. Instead of serving a single end-user, a multi-tenant SOS provides multiple tenants with similar and yet customized functionalities and potentially different quality-of-service (QoS) values. Multiple tenants' differentiated multi-dimensional quality constraints for the SOS further complicates the NP-hard problem of quality-aware service selection. Existing quality aware service selection approaches suffer from poor success rates of finding a solution, especially in scenarios where tenants' quality constraints are stringent, due to the lack of systematic consideration of three critical issues: 1) the need to fulfil multiple tenants' differentiated quality constraints; 2) the competition among service providers; and 3) the complementarity between services. This paper proposes a novel approach called combinatorial auction-based service selection for multi-tenant SOSs (CASSMT) to support effective quality-aware service selection for multi-tenant SOSs. CASSMT allows service providers to bid for the services of an SOS expressively. Based on received bids (i.e., QoS offers), CASSMT attempts to find a solution that achieves the system developer's optimization goal while fulfilling all tenants' quality constraints for the SOS. When no solution can be found based on the current bids, service providers can improve their bids to increase their chances of winning, which in the meantime, increases the chances of finding a solution. The experimental results show that CASSMT outperforms representative approaches in the success rate of finding a solution and system optimality. Meanwhile, its efficiency, measured by the number of auction rounds and computation time, is demonstrated to be satisfactory in scenarios on different scales.
Language eng
DOI 10.1109/ACCESS.2019.2902131
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2019, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30121173

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 63 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Tue, 30 Apr 2019, 16:01:35 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.