 |
Phase 2 is where the core of CDynP executes: Chain-based Dynamic Programming. The DCs are organized into a logical chain. The process begins with the first DC in the chain.
It runs its local DP over its assigned search interval and then compresses the results into a compact State Summary, which contains only layer indices and bottleneck times—no internal details. This State Summary is sent to the next DC.
The next DC inherits this summary, which represents the optimal solution up to that point. It then integrates this with its own local DP, considering the inter-DC communication cost in its state transitions. It finds the best way to extend the global solution using its local resources, compresses the new global state, and passes it downstream.
This process repeats until the tail node has a near-optimal global strategy. The key benefit is distributed execution with strict privacy preservation, as only results, not raw data, are exchanged. |
IEEE/ICACT20260329 Slide.14
[Big Slide]
[YouTube]