Copper and Wire: Bridging Expressiveness and Performance for Service Mesh Policies
Open Access
- 30 March 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 233-248
Abstract
Distributed microservice applications require a convenient means of controlling L7 communication between services. Service meshes have emerged as a popular approach to achieving this. However, current service mesh frameworks are difficult to use -- they burden developers in realizing even simple communication policies, lack compatibility with diverse dataplanes, and introduce performance and resource overheads. We identify the root causes of these drawbacks and propose a ground-up new mesh architecture that overcomes them. We develop novel abstractions for mesh communication, a new mesh policy language centered on these abstractions to enable expressive policies, and a novel control plane that enables using minimal dataplane resources for policy enforcement. We develop the precise semantics of our language abstractions and demonstrate how our control plane can use them to execute policies correctly and optimally. We build and evaluate a prototype on realistic workloads and policies and open-source production traces. Our results show that complex policies can be specified in up to 6.75× fewer lines, enforced with up to 2.6× smaller tail latencies and up to 39% fewer CPU resources than today.Keywords
Funding Information
- National Science Foundation (CNS-2023222,CNS-2214015)
This publication has 9 references indexed in Scilit:
- Expressive Policies For Microservice Networks2023
- Murphy: Performance Diagnosis of Distributed Cloud Applications2023
- Dissecting Service Mesh OverheadsarXiv, 2022
- Leveraging Service Meshes as a New Network Layer2021
- Characterizing Microservice Dependency and Performance2021
- Sinan: ML-based and QoS-aware resource management for cloud microservices2021
- An Open-Source Benchmark Suite for Microservices and Their Hardware-Software Implications for Cloud & Edge Systems2019
- HPACK: Header Compression for HTTP/22015
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952