Swift

Holterbach, Thomas; Vissicchio, Stefano; Dainotti, Alberto; Vanbever, Laurent

doi:10.1145/3098822.3098856

Cited by 40 publications

(27 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A BGP route contains the destination IP prefix destination, the sequence of traversed ASes (i.e., the AS_PATH) and some additional information that is not relevant for this section. When an AS receives a new BGP route, it extracts the destination IP • Delayed Internet routing convergence [224] • Locating Internet Routing Instabilities [225] • Achieving sub-50 milliseconds recovery upon BGP peering link failures [15] • Limiting Path Exploration in BGP [226] • R-BGP: Staying Connected In a Connected World [227] • LOUP: The Principles and Practice of Intra-Domain Route Dissemination [228] • BGP Prefix Independent Convergence [28] • SWIFT: Predictive Fast Reroute [229] • Blink: Fast Connectivity Recovery Entirely in the Data Plane [230] Fig . 21: Timeline of the selected documents and solutions related to inter-domain network-layer fast recovery (entries marked in gray provide the general context).…”

Section: A Background On Bgp Route Computationmentioning

confidence: 99%

“…First, the Internet is not administered by a single organization, but it rather consists of thousands of independent interconnected network organizations with possibly conflicting goals. Second, BGP convergence is significantly slower than intra-domain routing protocols (i.e., on the order of minutes compared to hundreds of milliseconds/seconds for intradomain protocols) [224], [229]- [233]. Finally, Internet routing protocols must guarantee connectivity towards hundreds of thousands of destination IP prefixes.…”

Section: B Challengesmentioning

confidence: 99%

“…As the number of prefixes can be on the order of tens of thousands, being able to update the forwarding tables quickly is of paramount importance. For example, the reported results of previous measurements indicate that it can take several seconds to update tens of thousands of prefixes [229]. Second, one cannot assume that all ASes will deploy FRR mechanisms.…”

Section: B Challengesmentioning

confidence: 99%

See 2 more Smart Citations

A Survey of Fast Recovery Mechanisms in the Data Plane

Chiesa¹,

Kamisiński²,

Rak³

et al. 2020

Preprint

View full text Add to dashboard Cite

In order to meet their stringent dependability requirements, most modern communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art and compile open research questions.<br>

show abstract

Section: A Background On Bgp Route Computationmentioning

confidence: 99%

Section: B Challengesmentioning

confidence: 99%

Section: B Challengesmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Fast Recovery Mechanisms in the Data Plane

Chiesa¹,

Kamisiński²,

Rak³

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Connectivity disruptions in networks due to link failures are common [44,47,50,65] and happen in all kinds of networks, from wide-area networks [34,43] to data center networks [27]. Accordingly, many clever mechanisms have been developed to provide fast re-routing under failures entirely in the dataplane, e.g., [10,12,13,17,32,33,42,44,45]. Fast reroute mechanisms are also included in MPLS networks [6,64], IP networks [5], in Openflow [24], among many others.…”

Section: Related Workmentioning

confidence: 99%

“…Several FRR primitives for quickly rerouting traffic has been proposed, though in different contexts. BGP-PIC [18] and Swift [33] support FRR sequences of size 2. Plinko [62] devised both an FRR mechanism and an FRR primitive to tolerate multiple failures.…”

Section: Related Workmentioning

confidence: 99%

PURR: a primitive for reconfigurable fast reroute

Chiesa

Sedar

Antichi

et al. 2019

Proceedings of the 15th International Conference on Emerging Networking Experiments and Technologies

View full text Add to dashboard Cite

Highly dependable communication networks usually rely on some kind of Fast ReRoute (FRR) mechanism which allows to quickly reroute traffic upon failures, entirely in the data plane. This paper studies the design of FRR mechanisms for emerging reconfigurable switches. Our main contribution is an FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation. PURR tolerates multiple concurrent failures and comes with minimal memory requirements, ensuring compact forwarding tables, by unveiling an intriguing connection to classic "string theory" (i.e., stringology), and in particular, the shortest common supersequence problem. PURR is well-suited for high-speed match-action forwarding architectures (e.g., PISA) and supports the implementation of arbitrary network-wide FRR mechanisms. Our simulations and prototype implementation (on an FPGA and Tofino) show that PURR improves TCAM memory occupancy by a factor of 1.5x-10.8x compared to a naïve encoding when implementing state-of-the-art FRR mechanisms. PURR also improves the latency and throughput of datacenter traffic up to a factor of 2.8x-5.5x and 1.2x-2x, respectively, compared to approaches based on recirculating packets.

show abstract

What You Need to Know About (Smart) Network Interface Cards

Katsikas

Barbette

Chiesa

et al. 2021

Passive and Active Measurement

View full text Add to dashboard Cite

Network interface cards (NICs) are fundamental components of modern high-speed networked systems, supporting multi-100 Gbps speeds and increasing programmability. Offloading computation from a server's CPU to a NIC frees a substantial amount of the server's CPU resources, making NICs key to offer competitive cloud services. Therefore, understanding the performance benefits and limitations of offloading a networking application to a NIC is of paramount importance. In this paper, we measure the performance of four different NICs from one of the largest NIC vendors worldwide, supporting 100 Gbps and 200 Gbps. We show that while today's NICs can easily support multihundred-gigabit throughputs, performing frequent update operations of a NIC's packet classifier -as network address translators (NATs) and load balancers would do for each incoming connection -results in a dramatic throughput reduction of up to 70 Gbps or complete denial of service. Our conclusion is that all tested NICs cannot support high-speed networking applications that require keeping track of a large number of frequently arriving incoming connections. Furthermore, we show a variety of counter-intuitive performance artefacts including the performance impact of using multiple tables to classify flows of packets.

show abstract

Swift

Cited by 40 publications

References 39 publications

A Survey of Fast Recovery Mechanisms in the Data Plane

A Survey of Fast Recovery Mechanisms in the Data Plane

PURR: a primitive for reconfigurable fast reroute

What You Need to Know About (Smart) Network Interface Cards

Contact Info

Product

Resources

About