234 research outputs found
Virtual-Mobile-Core Placement for Metro Network
Traditional highly-centralized mobile core networks (e.g., Evolved Packet
Core (EPC)) need to be constantly upgraded both in their network functions and
backhaul links, to meet increasing traffic demands. Network Function
Virtualization (NFV) is being investigated as a potential cost-effective
solution for this upgrade. A virtual mobile core (here, virtual EPC, vEPC)
provides deployment flexibility and scalability while reducing costs,
network-resource consumption and application delay. Moreover, a distributed
deployment of vEPC is essential for emerging paradigms like Multi-Access Edge
Computing (MEC). In this work, we show that significant reduction in
networkresource consumption can be achieved as a result of optimal placement of
vEPC functions in metro area. Further, we show that not all vEPC functions need
to be distributed. In our study, for the first time, we account for vEPC
interactions in both data and control planes (Non-Access Stratum (NAS)
signaling procedure Service Chains (SCs) with application latency requirements)
using a detailed mathematical model
Traffic Optimization in Data Center and Software-Defined Programmable Networks
L'abstract è presente nell'allegato / the abstract is in the attachmen
Control Plane in Software Defined Networks and Stateful Data Planes
L'abstract è presente nell'allegato / the abstract is in the attachmen
Data plane assisted state replication with Network Function Virtualization
Modern 5G networks are capable of providing ultra-low latency and highly scalable network services by employing modern networking paradigms such as Software Defined Networking (SDN) and Network Function Virtualization (NFV). The latter enables performance-critical network applications to be run in a distributed fashion directly inside the infrastructure. Being distributed, those applications rely on sophisticated state replication algorithms to synchronize states among each other. Nevertheless, current implementations of such algorithms do not fully exploit the potential of the modern infrastructures, thus leading to sub-optimal performance.
In this paper, we propose STARE, a novel state replication system tailored for 5G networks. At its core, STARE exploits stateful SDN to offload replication-related processes to the data plane, ultimately leading to reduced communication delays and processing overhead for VNFs. We provide a detailed description of the STARE architecture alongside a publicly-available P4- based implementation. Furthermore, our evaluation shows that STARE is capable of scaling to big networks while introducing low overhead in the network
LOcAl DEcisions on Replicated States (LOADER) in programmable data planes: programming abstraction and experimental evaluation
Programmable data planes recently emerged as a prominent innovation in
Software Defined Networking (SDN), by permitting support of stateful flow
processing functions over hardware network switches specifically designed for
network processing. Unlike early SDN solutions such as OpenFlow, modern
stateful data planes permit to keep (and dynamically update) local per-flow
states inside network switches, thus dramatically improving reactiveness of
network applications to state changes. Still, also in stateful data planes, the
control and update of non-local states is assumed to be completely delegated to
a centralized controller and thus accessed only at the price of extra delay.
Our LOADER proposal aims at contrasting the apparent dichotomy between local
states and global states. We do so by introducing a new possibility: permit to
take localized (in-switch) decisions not only on local states but also on
replicated global states, thus providing support for network-wide applications
without incurring the drawbacks of classical approaches. To this purpose, i) we
provide high-level programming abstractions devised to define the states and
the update logic of a generic network-wide application, and ii) we detail the
underlying low level state management and replication mechanisms. We then show
LOADER's independence of the stateful data plane technology employed, by
implementing it over two distinct stateful data planes (P4 switches and OPP -
Open Packet Processor - switches), and by experimentally validating both
implementations in an emulated testbed using a simple distributed
Deny-of-Service (DoS) detection application
Scalable and Reliable Middlebox Deployment
Middleboxes are pervasive in modern computer networks providing functionalities beyond mere packet forwarding. Load balancers, intrusion detection systems, and network address translators are typical examples of middleboxes. Despite their benefits, middleboxes come with several challenges with respect to their scalability and reliability.
The goal of this thesis is to devise middlebox deployment solutions that are cost effective, scalable, and fault tolerant. The thesis includes three main contributions: First, distributed service function chaining with multiple instances of a middlebox deployed on different physical servers to optimize resource usage; Second, Constellation, a geo-distributed middlebox framework enabling a middlebox application to operate with high performance across wide area networks; Third, a fault tolerant service function chaining system
A Survey on Data Plane Programming with P4: Fundamentals, Advances, and Applied Research
With traditional networking, users can configure control plane protocols to
match the specific network configuration, but without the ability to
fundamentally change the underlying algorithms. With SDN, the users may provide
their own control plane, that can control network devices through their data
plane APIs. Programmable data planes allow users to define their own data plane
algorithms for network devices including appropriate data plane APIs which may
be leveraged by user-defined SDN control. Thus, programmable data planes and
SDN offer great flexibility for network customization, be it for specialized,
commercial appliances, e.g., in 5G or data center networks, or for rapid
prototyping in industrial and academic research. Programming
protocol-independent packet processors (P4) has emerged as the currently most
widespread abstraction, programming language, and concept for data plane
programming. It is developed and standardized by an open community and it is
supported by various software and hardware platforms. In this paper, we survey
the literature from 2015 to 2020 on data plane programming with P4. Our survey
covers 497 references of which 367 are scientific publications. We organize our
work into two parts. In the first part, we give an overview of data plane
programming models, the programming language, architectures, compilers,
targets, and data plane APIs. We also consider research efforts to advance P4
technology. In the second part, we analyze a large body of literature
considering P4-based applied research. We categorize 241 research papers into
different application domains, summarize their contributions, and extract
prototypes, target platforms, and source code availability.Comment: Submitted to IEEE Communications Surveys and Tutorials (COMS) on
2021-01-2
- …