 |
And yet some other formulas conclude that in asynchronous flow, if a routing algorithm can sense back pressure and well control the flow following it, then it can propagate the concurrent information to the previous layer, hence to the head of the system.
Because concurrent wait is an absolute wait, by 2 dimensions of a flow, if we only control or reduce the configured concurrent, hence we can reduce the thought too. forwarding flow needs to wait more for backward flow to release concurrent slot.
Therefore we can create a backpressure algorithm with only 1 control mechanism based on cascading concurrent value.
|
IEEE/ICACT20240417 Slide.16
[Big Slide]