แนวคิดหลัก
It is possible to define a weaker correctness property called Weak-Order that can be preserved during flow migration without buffering or dropping packets, while still being sufficient in practice.
บทคัดย่อ
The content discusses the correctness criteria for migrating flows from one network function (NF) instance to another. It examines the properties of Order (O), Strict-Order (SO), and External-Order (E) that have been proposed in prior work, and identifies their limitations in terms of requiring packet buffering or dropping.
The key insights are:
- States in an NF can be partitioned into two types - those that require immediate synchronization across NF instances for correct packet forwarding, and those that can be eventually synchronized.
- Flows can also be partitioned into subsequences - those that affect the states requiring immediate synchronization, and those that do not.
- Based on this, the authors propose a weaker correctness property called Weak-Order (Weak-O), which requires:
a) Immediate synchronization of the states that are essential for correct packet forwarding
b) Eventually synchronizing the remaining states
- The authors present an algorithm that preserves Weak-O without buffering or dropping packets.
- They 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.
- Experimental results show that with Weak-O, the goodput with and without migration is 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.
สถิติ
The content does not contain any explicit numerical data or metrics. The focus is on defining correctness criteria and proposing an algorithm for flow migration.
คำพูด
There are no direct quotes from the content that are relevant to the key logics.