Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.07701 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Network Functions (NFs) improve the safety and efficiency of networks. Flows traversing NFs may need to be migrated to balance load, conserve energy, etc. When NFs are stateful, the information stored on the NF per flow must be migrated before the flows are migrated, to avoid problems of consistency. We examine what it means to correctly migrate flows from a stateful NF instance. We define the property of Weak-O, where only the state information required for packets to be correctly forwarded is migrated first, while the remaining states are eventually migrated. Weak-O can be preserved without buffering or dropping packets, unlike existing algorithms. We propose an algorithm that preserves Weak-O and prove its correctness. Even though this may cause packet re-ordering, we experimentally demonstrate that the goodputs with and without migration are comparable when the old and new paths have the same delays and bandwidths, or when the new path has larger bandwidth or at most 5 times longer delays, thus making this practical, contrary to what was thought before. We also prove that no criterion stronger than Weak-O can be preserved in a flow migration system that requires no buffering or dropping of packets and eventually synchronizes its states.