论文标题
服务功能链的容忍度
Fault Tolerance for Service Function Chains
论文作者
论文摘要
企业网络流量通常会遍历形成服务功能链的一系列中间箱，或者仅仅是链条。当沿链条发生故障时，对企业应用程序的可用性和可靠性至关重要。使链断层耐受耐受性使人具有挑战性，因为如果发生故障，中间箱的状态必须正确，快速恢复，同时提供较高的吞吐量和低潜伏期。 在本文中，我们介绍了FTC，新颖的系统设计和方案，用于耐故障服务功能链接。 FTC为长度f+1或更长时间的链的最多F Midderbox故障提供了强大的一致性，而无需专用复制节点。在FTC中，收集了由中间框的数据包处理引起的状态更新，将包装回到数据包中，然后沿着链条发送以复制。对FTC实施的评估表明，与最先进的状态相比，FTC的吞吐量提高了2-3.5倍，其中两到五个中间箱的链条。
Enterprise network traffic typically traverses a sequence of middleboxes forming a service function chain, or simply a chain. Tolerating failures when they occur along chains is imperative to the availability and reliability of enterprise applications. Making a chain fault-tolerant is challenging since, in the event of failures, the state of faulty middleboxes must be correctly and quickly recovered while providing high throughput and low latency. In this paper, we introduce FTC, novel system design and protocol for fault-tolerant service function chaining. FTC provides strong consistency with up to f middlebox failures for chains of length f+1 or longer without requiring dedicated replica nodes. In FTC, state updates caused by packet processing at a middlebox are collected, piggybacked into the packet, and sent along the chain to be replicated. The evaluation of our FTC implementation shows that compared with the state of art [46], FTC improves throughput by 2-3.5x for a chain of two to five middleboxes.
