有状态数据平面中的最佳状态复制
Optimal state replication in stateful data planes
摘要：
在SDN有状态数据平面中，交换机可以执行算法以基于本地状态来处理流量。这种方法允许将决策从控制器卸载到交换机，从而减少对网络事件做出反应的延迟。我们认为分布式网络应用程序，在每个交换机上的本地副本的网络范围内的状态的基础上处理流量。跨多个交换机复制状态带来了许多挑战，因为状态副本的数量及其放置会影响副本之间的数据流量和同步流量。在我们的工作中，我们制定了复制状态的最优放置问题，考虑到数据流量路由，以确保网络应用程序影响适当的流量，和副本之间的同步流量，以确保状态的一致性。由于找到最优解所需的高复杂性，我们提出了一种近似算法，能够扩展到大型网络实例。我们数值计算表明，该算法，尽管它的简单性，很好地逼近最优解。我们还显示了复制的状态相对于单副本的情况下，到目前为止，在文献中考虑的有益效果。最后，我们提供了一个渐近分析，以找到最佳的副本数。
英文摘要：
In SDN stateful data planes, switches can execute algorithms to process traffic based on local states. This approach permits to offload decisions from the controller to the switches, thus to reduce the latency to react to network events. We consider distributed network applications that process traffic at each switch based on local replicas of network-wide states. Replicating a state across multiple switches poses many challenges, because the number of state replicas and their placement affects both the data traffic and the synchronization traffic among the replicas. In our work, we formulate the optimal placement problem for replicated states, taking into account the data traffic routing, to ensure that the network applications affect the proper traffic flows, and the synchronization traffic between replicas, to ensure state coherence. Due to the high complexity required to find the optimal solution, we propose an approximated algorithm able to scale to large network instances. We show numerically that this algorithm, despite its simplicity, approximates quite well the optimal solution. We also show the beneficial effects of replicating the states with respect to the single-replica scenario, so far considered in the literature. Finally, we provide an asymptotic analysis to find the optimal number of replicas.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
