当前位置: X-MOL 学术IEEE Trans. Serv. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
User Grouping for Sharing Services with Capacity Limit
IEEE Transactions on Services Computing ( IF 5.5 ) Pub Date : 2018-02-27 , DOI: 10.1109/tsc.2018.2810120
Xiping Liu , Wanchun Dou , Xin Wang

Sharing a service among multiple users could bring benefit to users by reducing their service price and also benefit service providers by allowing them to make more profit. Shared services usually have a capacity limit. To construct a win-win situation between users and providers through service sharing, it is necessary to reasonably organize users with similar service requests into groups under the limits of group sizes. This paper explores methods to enable user grouping for sharing services with the limit on the group size. Based on user request descriptions and evaluation, a connection relation is built to present which two users could be in a group. Semi-groups can be derived from the connection relation and two grouping schemes satisfying the group size limit are further determined through proposed algorithms to meet different service expectations. Finally, a case study and a simulation are given to demonstrate the effectiveness of the proposed methods in grouping users to provide higher service benefits to both users and providers.

中文翻译:

具有容量限制的共享服务的用户分组

在多个用户之间共享服务可以通过降低他们的服务价格为用户带来收益,也可以通过允许他们获得更多利润来使服务提供商受益。共享服务通常有容量限制。为了通过服务共享在用户和提供者之间建立双赢的局面,有必要在组大小的限制下合理地将具有类似服务请求的用户组织到组中。本文探讨了使用户分组以共享服务而不受组大小限制的方法。基于用户请求的描述和评估,建立了一个连接关系以表示两个用户可以在一个组中。可以从连接关系中得出半群,并通过提出的算法进一步确定满足群大小限制的两种分组方案,以满足不同的服务期望。最后,通过案例研究和仿真来证明所提出的方法在将用户分组以向用户和提供者提供更高服务收益方面的有效性。
更新日期:2018-02-27
down
wechat
bug