Resilient and Scalable Forwarding for Software-Defined Networks with P4-Programmable Switches

Traditional networking devices support only fixed features and limited configurability. Network softwarization leverages programmable software and hardware platforms to remove those limitations. In this context the concept of programmable data planes allows directly to program the packet processing pipeline of networking devices and create custom control plane algorithms. This flexibility enables the design of novel networking mechanisms where the status quo struggles to meet high demands of next-generation networks like 5G, Internet of Things, cloud computing, and industry 4.0. P4 is the most popular technology to implement programmable data planes. However, programmable data planes, and in particular, the P4 technology, emerged only recently. Thus, P4 support for some well-established networking concepts is still lacking and several issues remain unsolved due to the different characteristics of programmable data planes in comparison to traditional networking. The research of this thesis focuses on two open issues of programmable data planes. First, it develops resilient and efficient forwarding mechanisms for the P4 data plane as there are no satisfying state of the art best practices yet. Second, it enables BIER in high-performance P4 data planes. BIER is a novel, scalable, and efficient transport mechanism for IP multicast traffic which has only very limited support of high-performance forwarding platforms yet. The main results of this thesis are published as 8 peer-reviewed and one post-publication peer-reviewed publication. The results cover the development of suitable resilience mechanisms for P4 data planes, the development and implementation of resilient BIER forwarding in P4, and the extensive evaluations of all developed and implemented mechanisms. Furthermore, the results contain a comprehensive P4 literature study. Two more peer-reviewed papers contain additional content that is not directly related to the main results. They implement congestion avoidance mechanisms in P4 and develop a scheduling concept to find cost-optimized load schedules based on day-ahead forecasts

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

Cooperative resource pooling in multihomed mobile networks

The ubiquity of multihoming amongst mobile devices presents a unique opportunity for users to co-operate, sharing their available Internet connectivity, forming multihomed mobile networks on demand. This model provides users with vast potential to increase the quality of service they receive. Despite this, such mobile networks are typically underutilized and overly restrictive, as additional Internet connectivity options are predominantly ignored and selected gateways are both immutable and incapable of meeting the demand of the mobile network. This presents a number of research challenges, as users look to maximize their quality of experience, while balancing both the financial cost and power consumption associated with utilizing a diverse set of heterogeneous Internet connectivity options. In this thesis we present a novel architecture for mobile networks, the contribution of which is threefold. Firstly, we ensure the available Internet connectivity is appropriately advertised, building a routing overlay which allows mobile devices to access any available network resource. Secondly, we leverage the benefits of multipath communications, providing the mobile device with increased throughput, additional resilience and seamless mobility. Finally, we provide a multihomed framework, enabling policy driven network resource management and path selection on a per application basis. Policy driven resource management provides a rich and descriptive approach, allowing the context of the network and the device to be taken into account when making routing decisions at the edge of the Internet. The aim of this framework, is to provide an efficient and flexible approach to the allocation of applications to the optimal network resource, no matter where it resides in a mobile network. Furthermore, we investigate the benefits of path selection, facilitating the policy framework to choose the optimal network resource for specific applications. Through our evaluation, we prove that our approach to advertising Internet connectivity in a mobile network is both efficient and capable of increasing the utilization of the available network capacity. We then demonstrate that our policy driven approach to resource management and path selection can further improve the user’s quality of experience, by tailoring network resource usage to meet their specific needs

GVSU Undergraduate and Graduate Catalog, 2014-2015

Grand Valley State University 2014-2015 undergraduate and/or graduate course catalog published annually to provide students with information and guidance for enrollment.https://scholarworks.gvsu.edu/course_catalogs/1089/thumbnail.jp

GVSU Undergraduate and Graduate Catalog, 2016-2017

Grand Valley State University 2016-2017 undergraduate and/or graduate course catalog published annually to provide students with information and guidance for enrollment.https://scholarworks.gvsu.edu/course_catalogs/1091/thumbnail.jp

GVSU Undergraduate and Graduate Catalog, 2016-2017

Grand Valley State University 2016-2017 undergraduate and/or graduate course catalog published annually to provide students with information and guidance for enrollment.https://scholarworks.gvsu.edu/course_catalogs/1091/thumbnail.jp

GVSU Undergraduate and Graduate Catalog, 2017-2018

Grand Valley State University 2017-2018 undergraduate and/or graduate course catalog published annually to provide students with information and guidance for enrollment.https://scholarworks.gvsu.edu/course_catalogs/1092/thumbnail.jp

GVSU Undergraduate and Graduate Catalog, 2019-2020

Grand Valley State University 2019-2020 undergraduate and/or graduate course catalog published annually to provide students with information and guidance for enrollment.https://scholarworks.gvsu.edu/course_catalogs/1094/thumbnail.jp