欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
Web服务社区是将功能类似的Web服务集中到一起为用户提供服务,当大量用户同时访问社区时,会出现排队现象。用户在社区中排队时会占用一部分资源,从而会产生一部分额外的成本。为此研究了如何设置最优的服务数使得这部分的额外成本最小。给出Web服务社区的定义,将在服务社区中排队的问题映射成排队论问题,确定排队模型为M/M/n。计算在稳定状态时用户的排队长度,得出在社区中排队的用户数量。结合Web服务社区中的成本因素确定成本函数,结合经济学中的边际分析法求出最佳的服务数。实验表明：该方法可以有效地找出最优的服务数,且效率较高。
英文摘要：
Web service community collect similar Web services to provide services to users. There will be queuing phenomenon when a large number of users access to the community at the same time. Users will take up a portion of the resources when they are queuing in the community,so that a portion of the extra cost will be generated,aiming at this problem,study how to set up the optimal service number,so that the extra cost of this part is minimum. Give the definition of Web service community,and the problem of queuing in the service community is mapped into the problem of queuing theory,the queuing model is M / M / n. Calculate the queue length of users in steady state,and get the number of queuing users in the community. The cost function is determined by the cost factor in the Web service community. The optimal service number is obtained by the marginal analysis method in economics. Experiments show that the method can effectively find the optimal number of services,and the efficiency of the method is relatively high.
同期刊论文项目
同项目期刊论文
期刊信息
位置：