Collaborative Research: FMitF: Track I: Game Theoretic Updates for Network and Cloud Functions

合作研究：FMitF：第一轨：网络和云功能的博弈论更新

• 批准号: 2318970
• 负责人: Jedidiah McClurg
• 金额: $ 35.5万
• 依托单位: Colorado State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-01-15 至 2024-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2318970&HistoricalAwards=false
• 关键词: Collaborative; Research; FMitF; Track; Game

Updates are common in cloud-computing networks, and they occur for many reasons. Some network updates are planned while others are unplanned and automated. Since network updates can take seconds or minutes to complete, and cloud-computing networks must be "always on", updates must be efficient and transparent. Researchers have proposed various abstractions for network updating that leverage advances in formal methods to synthesize update plans and protocols, ensuring that the system remains well-behaved during an ongoing update. However, despite several high-profile cases of network updates gone wrong, operators continue to use relatively naive approaches. We investigate key shortcomings of prior work on update abstractions that limit their utility and widespread use in practice, and develop a new abstraction that addresses the heterogeneity, scale, and dynamic nature of real-world updates. The project's novelties are (1) a new game-theoretic foundation for network updates, (2) algorithms for synthesizing update controllers that are robust to failures and changing conditions during the update, (3) algorithms for explaining update failures, (4) a language design that allows synthesized controllers to be safely modified, and (5) implementations and evaluations of these mechanisms for virtual network functions and serverless-computing platforms. The project provides network operators with tools that make updates to networked systems easier, safer, and more reliable, and develops a framework that makes datacenter computing more reliable and secure.Some specific key shortcomings of previous work on network updates are the following. (1) They assume that the network behaves predictably during the update. However, at scale, network demands and concurrent updates can cause unpredictable or even adversarial behavior in response to the update. (2) They have limited explanatory power when an update plan cannot be found or cannot be completed. (3) They make it hard for operators to choose between alternative update plans. This project consists of a comprehensive research plan to address these shortcomings. The key technical innovation is a formulation of updates as the search for a winning strategy in a two-player game, between the operator (or control plane) and the network. This formulation allows a uniform modeling of key elements, including hardware and software failures, variations in demand, and the addition and removal of network elements. To produce updates that are robust to changing conditions and failures, this work uses program-synthesis techniques to automatically generate an update controller that corresponds to a winning strategy in the game. To help operators when fatal errors occur, the project develops algorithms that exploit this game-theoretic formulation to explain the root cause of update failures and present alternatives. Finally, to give operators more control over updates, the investigators develop approaches for synthesizing update controllers that are interpretable and modifiable. The game-theoretic formulation is applicable to several kinds of networked systems, and the project will instantiate and evaluate our tools for platforms that implement virtual network functions and serverless functions.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

更新在云计算网络中很常见，并且出于许多原因而发生。一些网络更新计划，而其他网络更新则计划外和自动化。由于网络更新可能需要几秒钟或几分钟的时间才能完成，并且必须“始终”进行云计算网络，因此更新必须是有效且透明的。研究人员提出了各种摘要，用于网络更新，以利用正式方法的进步来综合更新计划和协议，以确保系统在正在进行的更新过程中保持良好状态。但是，尽管有几个备受瞩目的网络更新案例出错，但运营商仍在使用相对幼稚的方法。我们调查了更新摘要的先前工作的关键缺点，这些缺点限制了它们的实用性和在实践中广泛使用，并开发了一种新的抽象，以解决现实世界更新的异质性，规模和动态性质。该项目的新颖性是（1）用于网络更新的新游戏理论基础，（2）用于合成更新控制器的算法，该算法在更新过程中对失败和不断变化的条件稳健，（3）算法解释更新失败，（4）允许无效修改和评估这些机制的语言定义，并允许使用这些机制和（5）符合这些机制的功能，并且（5）适用于这些机制的功能，并符合这些机制的功能，并适用于5）。平台。该项目为网络运营商提供了使网络系统更新更容易，更安全且更可靠的工具，并开发了一个框架，使数据中心计算更可靠，更安全。 （1）他们认为网络在更新过程中的行为可以预见。但是，根据更新，网络需求和并发更新可能会导致不可预测的甚至对抗性行为。 （2）当找不到或找不到更新计划时，它们的解释能力有限。 （3）他们使操作员很难在替代更新计划之间进行选择。该项目由解决这些缺点的全面研究计划组成。关键的技术创新是在两人游戏，操作员（或控制平面）和网络之间寻找获胜策略的更新的表述。该公式允许对关键元素进行统一的建模，包括硬件和软件故障，需求变化以及网络元素的添加和删除。为了产生对不断变化的条件和失败的更新，此工作使用程序合成技术自动生成与游戏中获胜策略相对应的更新控制器。为了帮助操作员在发生致命错误时，该项目开发了利用此游戏理论公式的算法来解释更新失败的根本原因并提供了替代方案。最后，为了使操作员对更新的更多控制，研究人员开发了可解释和修改的更新控制器的方法。游戏理论配方适用于几种网络系统，该项目将对实施虚拟网络功能和无服务器功能的平台进行实例化和评估。该奖项反映了NSF的法定任务，并被认为是值得通过基金会的知识分子优点和更广泛的影响审查标准来通过评估来获得支持的。