645 research outputs found
An Empirical Model of Packet Processing Delay of the Open vSwitch
Network virtualization offers flexibility by decoupling virtual network from
the underlying physical network. Software-Defined Network (SDN) could utilize
the virtual network. For example, in Software-Defined Networks, the entire
network can be run on commodity hardware and operating systems that use virtual
elements. However, this could present new challenges of data plane performance.
In this paper, we present an empirical model of the packet processing delay of
a widely used OpenFlow virtual switch, the Open vSwitch. In the empirical
model, we analyze the effect of varying Random Access Memory (RAM) and network
parameters on the performance of the Open vSwitch. Our empirical model captures
the non-network processing delays, which could be used in enhancing the network
modeling and simulation
Arbitrary Packet Matching in OpenFlow
OpenFlow has emerged as the de facto control
protocol to implement Software-Defined Networking (SDN). In
its current form, the protocol specifies a set of fields on which
it matches packets to perform actions, such as forwarding,
discarding or modifying specific protocol header fields at a switch.
The number of match fields has increased with every version of
the protocol to extend matching capabilities, however, it is still
not flexible enough to match on arbitrary packet fields which
limits innovation and new protocol development with OpenFlow.
In this paper, we argue that a fully flexible match structure
is superior to continuously extending the number of fields
to match upon. We use Berkeley Packet Filters (BPF) for
packet classification to provide a protocol-independent, flexible
alternative to today’s OpenFlow fixed match fields. We have
implemented a prototype system and evaluated the performance
of the proposed match scheme, with a focus on the time it takes
to execute and the memory required to store different match
filter specifications. Our prototype implementation demonstrates
that line-rate arbitrary packet classification can be achieved with
complex BPF programs
On The Modeling of OpenFlow-based SDNs: The Single Node Case
OpenFlow is one of the most commonly used protocols for communication between
the controller and the forwarding element in a software defined network (SDN).
A model based on M/M/1 queues is proposed in [1] to capture the communication
between the forwarding element and the controller. Albeit the model provides
useful insight, it is accurate only for the case when the probability of
expecting a new flow is small. Secondly, it is not straight forward to extend
the model in [1] to more than one forwarding element in the data plane. In this
work we propose a model which addresses both these challenges. The model is
based on Jackson assumption but with corrections tailored to the OpenFlow based
SDN network. Performance analysis using the proposed model indicates that the
model is accurate even for the case when the probability of new flow is quite
large. Further we show by a toy example that the model can be extended to more
than one node in the data plane.Comment: Published in Proceedings of CS & IT for NeCOM 201
Global state, local decisions: Decentralized NFV for ISPs via enhanced SDN
The network functions virtualization paradigm is rapidly gaining interest among Internet service providers. However, the transition to this paradigm on ISP networks comes with a unique set of challenges: legacy equipment already in place, heterogeneous traffic from multiple clients, and very large scalability requirements. In this article we thoroughly analyze such challenges and discuss NFV design guidelines that address them efficiently. Particularly, we show that a decentralization of NFV control while maintaining global state improves scalability, offers better per-flow decisions and simplifies the implementation of virtual network functions. Building on top of such principles, we propose a partially decentralized NFV architecture enabled via an enhanced software-defined networking infrastructure. We also perform a qualitative analysis of the architecture to identify advantages and challenges. Finally, we determine the bottleneck component, based on the qualitative analysis, which we implement and benchmark in order to assess the feasibility of the architecture.Peer ReviewedPostprint (author's final draft
Design of a Hybrid Modular Switch
Network Function Virtualization (NFV) shed new light for the design,
deployment, and management of cloud networks. Many network functions such as
firewalls, load balancers, and intrusion detection systems can be virtualized
by servers. However, network operators often have to sacrifice programmability
in order to achieve high throughput, especially at networks' edge where complex
network functions are required.
Here, we design, implement, and evaluate Hybrid Modular Switch (HyMoS). The
hybrid hardware/software switch is designed to meet requirements for modern-day
NFV applications in providing high-throughput, with a high degree of
programmability. HyMoS utilizes P4-compatible Network Interface Cards (NICs),
PCI Express interface and CPU to act as line cards, switch fabric, and fabric
controller respectively. In our implementation of HyMos, PCI Express interface
is turned into a non-blocking switch fabric with a throughput of hundreds of
Gigabits per second.
Compared to existing NFV infrastructure, HyMoS offers modularity in hardware
and software as well as a higher degree of programmability by supporting a
superset of P4 language
- …