Answers are grounded in this paper and cite their sources.
With the benefit of improving the utilization of hardware resources and the convenience of maintenance by sharing one application instance among multiple tenants, multi-tenancy has become a major paradigm in cloud computing. And with the increasing of individual and diverse requirements of tenants, service selection for multi-tenant service-based systems (SBSs) has become a complex question. However, traditional service selection approaches for multi-tenant SBSs fail to fully consider the competition among service providers to increase the possibility of finding an optimal solution. In this paper, we propose a novel iterative auction based service selection for multiple tenants (IASSMT). During the auction, the auctioneer of multi-tenant SBSs aims at finding an optimal solution that can satisfy all multi-dimensional quality constraints of tenants based on the received bids. Besides, service providers can rebid to obtain more chances of winning by iterations. The results of experimental simulation show that IASSMT can significantly increase the success rate over the existing approaches in finding an optimal solution. Meanwhile, the efficiency (the number of auction rounds and computational time) is satisfactory on different scales.
No takes yet. Share an insight, caveat, or question.
Zhong et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: