基于可计算产品的网络编程
Network Programming via Computable Products
摘要:
用户平面功能(UPF)旨在在3GPP 5G核心网络中提供网络服务。这些服务需要以可证明的属性按需廉价地实现。现有的网络数据平面程序设计语言不能胜任这项任务。一个新的软件范例,提出了UPF。它的灵感来自模型检验的并发反应系统,在概念上,系统的每个组件被建模为一个扩展的有限状态机和他们的产品进行验证。我们展示了如何计算这样的产品的一个例子的UPF和它的状态不变量可以推断,从而消除了需要正式单独验证的产品。代码可以从产品中生成,并在运行中重新生成,以保持UPF必须处理的网络流量概率分布的最佳状态。
英文摘要:
The User Plane Function (UPF) aims to provide network services in the 3GPP 5G core network. These services need to be implemented on demand inexpensively with provable properties. Existing network dataplane programming languages are not up to the task. A new software paradigm is presented for the UPF. It is inspired by model checking a concurrent reactive system where conceptually each component of the system is modeled as an extended finite-state machine and their product is verified. We show how such a product can be computed for one example of a UPF and how its state invariants can be inferred, thereby eliminating the need to formally verify the product separately. Code can be generated from the product and regenerated on the fly to remain optimal for the probability distribution of network traffic the UPF must process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。