ID	原文	译文
2163	随着云计算技术的不断发展，微服务体系结构逐渐成为一种广泛应用的软件设计风格。	With the continuous development of cloud computing technology, the microservice architecture has gradu-ally become a widely used software design style.
2164	在基于微服务的应用系统中，微服务数量众多、相互依赖关系复杂、持续在线演化等特征使得微服务运行时资源的有效管理面临新的挑战。	In microservice-based applications, different microservices collaborate with one another via interface calls, but they may also compete for limited resources during online evolvement.
2165	本文充分考虑微服务之间的关系特征，提出了一种基于拥塞博弈理论的运行时资源管理方法。	This poses newchallenges for allocating resources efficiently during runtime. To tackle the problem, we propose a novel approach based oncongestion game.
2166	首先，对微服务之间的复杂依赖关系进行建模，给出了带权有向无环图描述的微服务调用关系模型;	Firstly, we use a weighted directed acyclic graph to model the inter-relationship of the microservices that compose an application.
2167	然后，基于微服务关系调用模型对各个微服务的请求到达频率进行计算，并用排队论中的 M/G/1 队列刻画微服务处理请求的过程，进而设计了一种以服务等级协议(Service Level Agreement)满足程度为衡量标准的服务收益函数;	Then we use M /G /1 queue in queue theory to describe the arrival process of access requests, and combine it with the above graph to calculate the arrival rate of access requests to each microservice, which in turn is used toestimate response time in a newly-designed microservice revenue function.
2168	最后利用拥塞博弈模型刻画对计算资源的竞争关系，给出了求解博弈的纳什均衡状态的多项式算法。	Finally, we define resources competing problemas a congestion game where each microservice is a player aiming to maximize its revenue, and propose an algorithm to findNash equilibrium in polynomial time.
2169	实验表明，该方法在计算资源有限的场景下可以有效地提高微服务应用的整体性能。	Experiment results show that our approach can effectively improve the overall perform-ance of the system with limited resources.
2170	为解决群组认证中非法签名难以标定的问题，本文基于数字通信系统中的纠错码理论，提出了一个非适应性组合群组认证方案。	Because it is difficult to identify bad signatures in group authentication schemes, the work is concerned with combinatorial group test based on error correction coding theory in digital communication system and a novel non-adap-tive group authentication scheme is proposed.
2171	该方案首先根据纠错码理论构造认证节点分组算法，然后按照分组进行节点签名的批量认证，再对分组认证结果进行迭代，从而标定非法签名，最后进行了例证演示。	Firstly, the grouping algorithm of all nodes is proposed based on error correc-tion coding theory;secondly, batch certification is implemented according to the groups;thirdly, bad signature is identified byiterative analyses;finally, an example is demonstrated.
2172	复杂度分析表明，针对 n 个签名(含有 r 个非法签名)进行非法者标定的问题，运用群组认证的标定次数远远小于逐一认证的 n 次，准确性演化结果表明当 r 远远小于 n 时，群组认证非法签名的标定成功概率接近于 1。	Complexity analyses show the identification times of the group au-thentication scheme of n signatures with r bad signatures is much less than n times of one-by-one authentication. Accuracyanalyses show the probability of identification of the group authentication scheme is close to 1 when r is much less than n.