Fine-grained Distributed Data Plane Verification with Intent-based Slicing
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910698698702848 |
|---|---|
| author | Chou, Kuan-Yen Prabhu, Santhosh Subramanian, Giri Zhou, Wenxuan Nayyar, Aanand Godfrey, Brighten Caesar, Matthew |
| author_facet | Chou, Kuan-Yen Prabhu, Santhosh Subramanian, Giri Zhou, Wenxuan Nayyar, Aanand Godfrey, Brighten Caesar, Matthew |
| contents | Data plane verification has grown into a powerful tool to ensure network correctness. However, existing methods with monolithic models have memory requirements tied to network sizes, and the existing method of scaling out is too limited in expressiveness to capture practical network features. In this paper, we describe Scylla, a general data plane verifier that provides fine-grained scale-out without the need for a monolithic network model. Scylla creates models for what we call intent-based slices, each of which is constructed at the rule-level granularity with only enough to verify a given set of intents. The sliced models are retained and incrementally updated in memory across a distributed compute cluster in response to network updates. Our experiments show that Scylla makes the scaling problem more granular -- tied to the size of the intent-based slices rather than that of the overall network. This enables Scylla to verify large, complex networks in minimum units of work that are significantly smaller (in both memory and time) than past techniques, enabling fast scale-out verification with minimal resource requirement. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_20982 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fine-grained Distributed Data Plane Verification with Intent-based Slicing Chou, Kuan-Yen Prabhu, Santhosh Subramanian, Giri Zhou, Wenxuan Nayyar, Aanand Godfrey, Brighten Caesar, Matthew Networking and Internet Architecture Data plane verification has grown into a powerful tool to ensure network correctness. However, existing methods with monolithic models have memory requirements tied to network sizes, and the existing method of scaling out is too limited in expressiveness to capture practical network features. In this paper, we describe Scylla, a general data plane verifier that provides fine-grained scale-out without the need for a monolithic network model. Scylla creates models for what we call intent-based slices, each of which is constructed at the rule-level granularity with only enough to verify a given set of intents. The sliced models are retained and incrementally updated in memory across a distributed compute cluster in response to network updates. Our experiments show that Scylla makes the scaling problem more granular -- tied to the size of the intent-based slices rather than that of the overall network. This enables Scylla to verify large, complex networks in minimum units of work that are significantly smaller (in both memory and time) than past techniques, enabling fast scale-out verification with minimal resource requirement. |
| title | Fine-grained Distributed Data Plane Verification with Intent-based Slicing |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2405.20982 |