Work

A fast and portable TCP/IP stack (本文)

Year: 2025
Type: dissertation
Abstract: This dissertation presents three-layered studies that address a research question: how can we realize a fast and portable TCP/IP stack that portably achieves good performance across diverse environments and use cases?The first study, focusing on the middle layer, explores the design of a TCP/IP stack and presents our prototype implementation called iip, an integratable TCP/IP stack.We overhaul the responsibility boundary between a TCP/IP stack implementation and the code provided by developers, and introduce an API that enables iip to allow for easy integration and good performance simultaneously.The second study looks into the lower layer which is packet I/O frameworks.We discuss how to support multiple packet I/O frameworks to increase the likelihood of achieving reasonable performance by circumventing the issues imposed by specific packet I/O frameworks, and present the details of our prototype implementation for iip along with an abstraction model that hides the differences between the APIs of packet I/O frameworks.The third study focuses on the upper layer that implements the logic for specific use cases, and specifically, we build a memory access restriction mechanism, based on a hardware feature called Memory Protection Keys (MPK), as an upperlayer subsystem to improve memory safety for use cases where a process runs iip in user space, while exploring techniques to mitigate its performance overheads.Through the three studies, we introduce a design philosophy that partitions software involving TCP/IP communication into layers and limits the layers performing memory copies of packet data.This design philosophy enables us to implement a technique for reducing memory copies in the upper layer, on top of the middle and lower layers designed to allow for zero-copy I/O.This design philosophy is naturally aligned with a fast and portable TCP/IP stack, as layer partitioning is the key to portability and reduced memory copies contribute to performance. List of Tables4.1 PKRU settings for the two memory access rights (Chapter 4.2.3). .67 4.2 pkey assignment for each memory type (Chapter 4.2.3). . . . . . .68 vi
Institution: Keio University
Language: English
Open Access status: green
OpenAlex ID: W7159906653
Cites: 47
Cited by:
Related to: 10