论文标题
电话：数据平面中的低延迟故障转移交通工程
TEL: Low-Latency Failover Traffic Engineering in Data Plane
论文作者
论文摘要
现代网络应用程序需要在存在网络故障的情况下进行低延迟的交通工程，同时保留延迟和容量等服务限制的质量。在故障方案中，快速重新公开（FRR）机制被广泛用于交通重新布置。控制平面FRR通常计算备份转发规则，以绕发生故障时绕开数据平面的流量。可以随着可编程数据平面的出现在数据平面中计算此机制。在本文中，我们提出了一个包含两个FRR机制的系统（称为TEL），即Tel-C和Tel-D。第一个计算控制平面中的备份转发规则，满足最大公平分配。第二种机制在数据平面中提供了FRR。两种算法都需要在可编程数据平面上的最小内存，并且非常适合现代的线路速率匹配转发体系结构（例如PISA）。我们在P4可编程软件开关（例如BMV2和Tofino）上实施这两个机制，并在各种拓扑上衡量其性能。从数据中心拓扑结构获得的结果表明，我们的FRR机制可以将流量的完成时间提高到4.6倍 - $ 7.3倍（即小流）和3.1倍$ -12X $ -12X（即大流量），分别与基于再循环的机制相比，例如F10。
Modern network applications demand low-latency traffic engineering in the presence of network failure while preserving the quality of service constraints like delay and capacity. Fast Re-Route (FRR) mechanisms are widely used for traffic re-routing purposes in failure scenarios. Control plane FRR typically computes the backup forwarding rules to detour the traffic in the data plane when the failure occurs. This mechanism could be computed in the data plane with the emergence of programmable data planes. In this paper, we propose a system (called TEL) that contains two FRR mechanisms, namely, TEL-C and TEL-D. The first one computes backup forwarding rules in the control plane, satisfying max-min fair allocation. The second mechanism provides FRR in the data plane. Both algorithms require minimal memory on programmable data planes and are well-suited with modern line rate match-action forwarding architectures (e.g., PISA). We implement both mechanisms on P4 programmable software switches (e.g., BMv2 and Tofino) and measure their performance on various topologies. The obtained results from a datacenter topology show that our FRR mechanism can improve the flow completion time up to 4.6x$-$7.3x (i.e., small flows) and 3.1x$-$12x (i.e., large flows) compared to recirculation-based mechanisms, such as F10, respectively.
