RouteBricks

Dobrescu, Mihai; Egi, Norbert; Argyraki, Katerina; Chun, Byung-Gon; Fall, Kevin; Iannaccone, Gianluca; Knies, Allan; Manesh, Maziar; Ratnasamy, Sylvia

doi:10.1145/1629575.1629578

Cited by 347 publications

(17 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…home gateways or wireless access points. More recently, they have also appeared in experimental IP routers [20] and industrial middleboxes [8] that support multi-Gbps line rates. Moreover, we are witnessing a push for virtual network functions that can be deployed on general-purpose platforms on demand, much like virtual machines are being deployed in clouds.…”

Section: Introductionmentioning

confidence: 99%

A Formally Verified NAT

Zaostrovnykh

Pirelli

Pedrosa

et al. 2017

Proceedings of the Conference of the ACM Special Interest Group on Data Communication

Self Cite

View full text Add to dashboard Cite

We present a Network Address Translator (NAT) written in C and proven to be semantically correct according to RFC 3022, as well as crash-free and memory-safe. There exists a lot of recent work on network verification, but it mostly assumes models of network functions and proves properties specific to network configuration, such as reachability and absence of loops. Our proof applies directly to the C code of a network function, and it demonstrates the absence of implementation bugs. Prior work argued that this is not feasible (i.e., that verifying a real, stateful network function written in C does not scale) but we demonstrate otherwise: NAT is one of the most popular network functions and maintains per-flow state that needs to be properly updated and expired, which is a typical source of verification challenges. We tackle the scalability challenge with a new combination of symbolic execution and proof checking using separation logic; this combination matches well the typical structure of a network function. We then demonstrate that formally proven correctness in this case does not come at the cost of performance. The NAT code, proof toolchain, and proofs are available at [58].

show abstract

Section: Introductionmentioning

confidence: 99%

A Formally Verified NAT

Zaostrovnykh

Pirelli

Pedrosa

et al. 2017

Proceedings of the Conference of the ACM Special Interest Group on Data Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…These requirements have been addressed in the design of middleboxes such as firewalls, load balancers, and software routers [Dobrescu et al 2009;Kohler et al 2000] by integrating the networking stack and the application into a single dataplane. The two remaining requirements-protection and resource efficiency-are not addressed in middleboxes because they are single-purpose systems, not exposed directly to users.…”

Section: Design Approachmentioning

confidence: 99%

“…Its architecture builds upon lessons from high-performance middleboxes, such as firewalls, load balancers, and software routers [Dobrescu et al 2009;Kohler et al 2000]. IX separates the control plane, which is responsible for system configuration and coarse-grained resource provisioning between applications, from the dataplanes, which run the networking stack and application logic.…”

Section: Introductionmentioning

confidence: 99%

The IX Operating System

Belay¹,

Prekas

Primorac

et al. 2016

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and μs-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. We present IX, a dataplane operating system that provides high I/O performance and high resource efficiency while maintaining the protection and isolation benefits of existing kernels.IX uses hardware virtualization to separate management and scheduling functions of the kernel (control plane) from network processing (dataplane). The dataplane architecture builds upon a native, zero-copy API and optimizes for both bandwidth and latency by dedicating hardware threads and networking queues to dataplane instances, processing bounded batches of packets to completion, and eliminating coherence traffic and multicore synchronization. The control plane dynamically adjusts core allocations and voltage/frequency settings to meet service-level objectives.We demonstrate that IX outperforms Linux and a user-space network stack significantly in both throughput and end-to-end latency. Moreover, IX improves the throughput of a widely deployed, key-value store by up to 6.4× and reduces tail latency by more than 2×. With three varying load patterns, the control plane saves 46%-54% of processor energy, and it allows background jobs to run at 35%-47% of their standalone throughput.

show abstract

“…The creation of a Click router is very simple, as it uses a custom language in order to specify the connections and dependencies among the modules. Click was proposed as a single-threaded software, although nowadays there are parallel implementations [83].…”

Section: Click Routermentioning

confidence: 99%

“…RouteBricks leverages current server technology to build full software routers that operate in line rate [83]. The proposed architecture employs off-the-shelf server technology in order to build high-speed routers with many ports, in an architecture where the number of servers scales linearly with the number of ports.…”

Section: E Routebricksmentioning

confidence: 99%

Programmable Networks—From Software-Defined Radio to Software-Defined Networking

Macedo

Guedes

Vieira

et al. 2015

IEEE Commun. Surv. Tutorials

109

View full text Add to dashboard Cite

Current implementations of Internet systems are very hard to be upgraded. The ossification of existing standards restricts the development of more advanced communication systems. New research initiatives such as virtualization, softwaredefined radios and software-defined networks allow more flexibility for networks. However, until now, those initiatives have been developed individually. We advocate that the convergence of these overlying and complementary technologies can expand the amount of programmability on the network and support different innovative applications. Hence, this article surveys the most recent research initiatives on programmable networks. We characterize programmable networks, where programmable devices execute specific code, and the network is separated into three planes: data, control and management planes. We discuss the modern programmable network architectures, emphasizing their research issues and, when possible, we highlight their practical implementations. We survey the wireless and wired elements on the programmable data plane. Next, on the programmable control plane, we survey the divisor and controller elements. We conclude with final considerations, open issues and future challenges.

show abstract

RouteBricks

Cited by 347 publications

References 30 publications

A Formally Verified NAT

A Formally Verified NAT

The IX Operating System

Programmable Networks—From Software-Defined Radio to Software-Defined Networking

Contact Info

Product

Resources

About