We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen...We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11971486)。
文摘We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.
文摘传统信任协商存在对凭证和访问控制策略的安全防护不足、无法避免策略循环依赖等问题,不适用于安全性要求较高的应用环境。在对信任协商过程中现有敏感资源分类进行扩充的基础上,提出了一个基于完全敏感资源防护的信任协商算法(full privacy preservation based TNS,FPPB_TNA)。该算法采用广度优先搜索方法对协商双方的资源披露进行控制,通过安全双方计算对完全敏感资源进行保护,不仅提高了算法的执行效率,而且有效地解决了策略循环依赖问题。算法分析和应用实例证明FPPB_TNA算法具有较好的安全性和完备性。
